Cinzia Di Giusto
Publications
Publications
|
|
Choreographies for Program UnderstandingFORTE 2025 - 45th International Conference on Formal Techniques for Distributed Objects, Components, and Systems, Jun 2025, Lille, France. pp.173-181, ⟨10.1007/978-3-031-95497-9_10⟩ |
|
|
Les systèmes faiblement synchrones avec trois machines sont Turing-completsAlgoTel 2024 – 26èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2024, Saint-Briac-sur-Mer, France |
Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata34th International Conference on Concurrency Theory (CONCUR 2023), Sep 2023, Antwerp, Belgium. ⟨10.4230/LIPIcs.CONCUR.2023.33⟩ |
|
|
|
Weakly Synchronous Systems with Three Machines Are Turing PowerfulRP 2023 - 17th International Conference on Reachability Problems, 2023, Nice, France. pp.28-41, ⟨10.1007/978-3-031-45286-4_3⟩ |
|
|
Formalising Futures and Promises in ViperJFLA 2022 - 33èmes Journées Francophones des Langages Applicatifs, Jun 2022, Saint-Médard-d'Excideuil, France. pp.165-183 |
|
|
A Unifying Framework for Deciding SynchronizabilityCONCUR 2021 - 32nd International Conference on Concurrency Theory, Aug 2021, Paris, France. pp.1-33 |
|
|
On the k-synchronizability of Systems23rd International Conference on Foundations of Software Science and Computer Systems (FOSSACS 2020), Apr 2020, Dublin, Ireland. pp.157-176, ⟨10.1007/978-3-030-45231-5_9⟩ |
Analysis of Discrete Models for Ecosystem Ecology12th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2019), Ana Roque; Arkadiusz Tomczyk; Elisabetta De Maria; Felix Putze; Roman Moucek; Ana Fred; Hugo Gamboa, Feb 2019, Prague, Czech Republic. pp.242--264, ⟨10.1007/978-3-030-46970-2_12⟩ |
|
|
|
Pattern Matching in discrete Models for Ecosystem Ecology10. International Conference on Bioinformatics Models, Methods and Algorithms (Bioinformatics 2019), Feb 2019, Prague, Czech Republic. pp.101--111 |
|
|
Parameter Learning for Spiking Neural Networks Modelled as Timed Automata9th International Conference on Bioinformatics Models, Methods and Algorithms, Jan 2018, Funchal, France. ⟨10.5220/0006530300170028⟩ |
|
|
Formal Validation of Neural Networks as Timed Automatathe 8th International Conference on Computational Systems-Biology and Bioinformatics, Dec 2017, Nha Trang City, France. ⟨10.1145/3156346.3156350⟩ |
Systemic approach for toxicity analysis5th International Workshop on Biological Processes and Petri Nets (BioPPN 2014), Jun 2014, Tunis, Tunisia. pp.30--44 |
|
|
|
A Categorical Theory of PatchesMFPS - Mathematical Foundations of Programming Semantics, Jun 2013, New Orleans, United States. pp.283-307, ⟨10.1016/j.entcs.2013.09.018⟩ |
Disciplined structured communications with consistent runtime adaptationSAC '13 Proceedings of the 28th Annual ACM Symposium on Applied Computing, Mar 2013, Coimbra, Portugal. pp.1913-1918, ⟨10.1145/2480362.2480716⟩ |
|
Towards the Verification of Adaptable ProcessesLeveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change - 5th International Symposium (ISoLA 2012), Proceedings, Part I, 2012, Heraklion, Crète, Greece. pp.269--283, ⟨10.1007/978-3-642-34026-0_20⟩ |
|
|
|
Adaptable Processes (Extended Abstract)13th Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 31th International Conference on FORmal TEchniques for Networked and Distributed Systems (FORTE), Jun 2011, Reykjavik,, Iceland. pp.90-105, ⟨10.1007/978-3-642-21461-5_6⟩ |
|
|
Revisiting Glue Expressiveness in Component-Based Systems13th Conference on Coordination Models and Languages (COORDINATION), Jun 2011, Reykjavik, Iceland. pp.16-30, ⟨10.1007/978-3-642-21464-6_2⟩ |
A Calculus for Component Evolvability (Extended Abstract)Formal Aspects of Component Software (FACS 2010), 2010, Guimarães, Portugal |
|
|
|
CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence5th Asian Symposium on Programming Languages and Systems (APLAS'07), Nov 2007, Singapore, Singapore. pp.383-398, ⟨10.1007/978-3-540-76637-7_26⟩ |
|
|
Expressiveness of Recursion, Replication and Scope Mechanisms in Process Calculi5th International Symposium on Formal Methods for Components and Objects (FMCO'06), Nov 2006, Amsterdam, Netherlands. pp.185-206, ⟨10.1007/978-3-540-74792-5⟩ |
|
|
Guessing the Buffer Bound for k-SynchronizabilityImplementation and Application of Automata, 12803, Springer International Publishing, pp.102-114, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-79121-6_9⟩ |
Inferring the Synaptical Weights of Leaky Integrate and Fire Asynchronous Neural Networks: Modelled as Timed AutomataBiomedical Engineering Systems and Technologies, 1024, Springer International Publishing, pp.149-166, 2019, Communications in Computer and Information Science, ⟨10.1007/978-3-030-29196-9_9⟩ |
|
|
On the Impact of the Communication Model on Realisability2025 |
|
|
Realisability and Complementability of Multiparty Session Types2025 |
|
|
Weakly synchronous systems with three machines are Turing powerful2024 |
|
|
Weakly synchronous systems with three machines are Turing powerful *2024 |
|
|
Spiking Neural Networks modelled as Timed Automata with parameter learning2018 |
|
|
Weakly synchronous systems with three machines are Turing powerfulInria. 2023 |
|
|
Complexity of Membership and Non-Emptiness Problems in Unbounded Memory AutomataUniversité Côte d'Azur, CNRS, I3S, France; IBISC, Univ. Evry, Université Paris-Saclay, France; Scalian Digital Systems, Valbonne, France. 2023 |
|
|
A partial order view of message-passing communication models[Research Report] Université Nice Côte d’Azur, CNRS, I3S, France. 2022 |
|
|
On the k-synchronizability of systems[Research Report] Laboratoire I3S. 2019 |
|
|
Multiparty Reactive Sessions[Research Report] 9270, INRIA. 2019, pp.65 |
|
|
Modeling Third Generation Neural Networks as Timed Automata and verifying their behavior through Temporal Logic[Research Report] Université Côte d'Azur, CNRS, I3S, France. 2017 |
|
|
Activity Networks with Delays An application to toxicity analysis[Research Report] Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe BIOINFO MDSC - Modèles Discrets pour les Systèmes Complexes. 2016 |
|
|
An Event-Based Approach to Runtime Adaptation in Communication-Centric Systems[Research Report] Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe BIOINFO MDSC - Modèles Discrets pour les Systèmes Complexes; Johann Bernoulli Institute for Mathematics and Computer Science, University of Groeningen. 2014 |
|
|
Synchronisability in Mailbox CommunicationEXPRESS/SOS 2024, Electronic Proceedings in Theoretical Computer Science, 412, pp.19-34, 2024, ⟨10.4204/EPTCS.412.3⟩ |