Cinzia Di Giusto

Orcid: 0000-0003-1563-6581

According to our database1, Cinzia Di Giusto authored at least 39 papers between 2006 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Guessing the Buffer Bound for k-Synchronizability.
Int. J. Found. Comput. Sci., December, 2023

Multiparty half-duplex systems and synchronous communications.
J. Log. Algebraic Methods Program., February, 2023

A Partial Order View of Message-Passing Communication Models.
Proc. ACM Program. Lang., January, 2023

Weakly Synchronous Systems with Three Machines Are Turing Powerful.
Proceedings of the Reachability Problems - 17th International Conference, 2023

Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata.
Proceedings of the 34th International Conference on Concurrency Theory, 2023

2022
A non-sequential hierarchy of message-passing models.
CoRR, 2022

2021
Towards Generalised Half-Duplex Systems.
Proceedings of the Proceedings 14th Interaction and Concurrency Experience, 2021

A Unifying Framework for Deciding Synchronizability.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020
Spiking neural networks modelled as timed automata: with parameter learning.
Nat. Comput., 2020

On the k-synchronizability of Systems.
Proceedings of the Foundations of Software Science and Computation Structures, 2020

2019
On the k-synchronizability for mailbox systems.
CoRR, 2019

Analysis of Discrete Models for Ecosystem Ecology.
Proceedings of the Biomedical Engineering Systems and Technologies, 2019

Pattern Matching in Discrete Models for Ecosystem Ecology.
Proceedings of the 12th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2019), 2019

2018
Activity Networks with Delays an Application to Toxicity Analysis.
Fundam. Informaticae, 2018

Inferring the Synaptical Weights of Leaky Integrate and Fire Asynchronous Neural Networks: Modelled as Timed Automata.
Proceedings of the Biomedical Engineering Systems and Technologies, 2018

Parameter Learning for Spiking Neural Networks Modelled as Timed Automata.
Proceedings of the 11th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2018), 2018

2017
Formal Validation of Neural Networks as Timed Automata.
Proceedings of the 8th International Conference on Computational Systems-Biology and Bioinformatics, 2017

2016
Event-based run-time adaptation in communication-centric systems.
Formal Aspects Comput., 2016

Activity Networks with Delays An application to toxicity analysis.
CoRR, 2016

2015
Disciplined structured communications with disciplined runtime adaptation.
Sci. Comput. Program., 2015

An Event-Based Approach to Runtime Adaptation in Communication-Centric Systems.
Proceedings of the Web Services, Formal Methods, and Behavioral Types, 2015

2014
Systemic approach for toxicity analysis.
Proceedings of the 5th International Workshop on Biological Processes & Petri Nets co-located with 35th International Conference on Application and Theory of Petri Nets and Concurreny (PETRI NETS 2014), 2014

2013
A Categorical Theory of Patches.
Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, 2013

Session Types with Runtime Adaptation: Overview and Examples.
Proceedings of the Proceedings 6th Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software, 2013

Disciplined structured communications with consistent runtime adaptation.
Proceedings of the 28th Annual ACM Symposium on Applied Computing, 2013

2012
On the Expressive Power of Multiple Heads in CHR.
ACM Trans. Comput. Log., 2012

Adaptable processes
Log. Methods Comput. Sci., 2012

Towards the Verification of Adaptable Processes.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change, 2012

2011
Adaptable Processes (Extended Abstract).
Proceedings of the Formal Techniques for Distributed Systems, 2011

Hunting Distributed Malware with the κ-Calculus.
Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

Revisiting Glue Expressiveness in Component-Based Systems.
Proceedings of the Coordination Models and Languages - 13th International Conference, 2011

2010
Steps on the Road to Component Evolvability.
Proceedings of the Formal Aspects of Component Software - 7th International Workshop, 2010

2009
Expressiveness of Multiple Heads in CHR.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Move vs Copy: Towards a Formal Comparison of Ambients and Higher-Order Process Calculi.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

On the Expressiveness of Forwarding in Higher-Order Communication.
Proceedings of the Theoretical Aspects of Computing, 2009

The <i>kappa</i>-Lattice: Decidability Boundaries for Qualitative Analysis in Biological Languages.
Proceedings of the Computational Methods in Systems Biology, 7th International Conference, 2009

2008
Full Abstraction for Linda.
Proceedings of the Programming Languages and Systems, 2008

2007
CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence.
Proceedings of the Programming Languages and Systems, 5th Asian Symposium, 2007

2006
On Recursion, Replication and Scope Mechanisms in Process Calculi.
Proceedings of the Formal Methods for Components and Objects, 5th International Symposium, 2006


  Loading...