default search action
Cinzia Di Giusto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j9]Cinzia Di Giusto
, Laetitia Laversa
Guessing the Buffer Bound for k-Synchronizability. Int. J. Found. Comput. Sci. 34(8): 1051-1076 (2023) - [j8]Cinzia Di Giusto, Loïc Germerie Guizouarn
Multiparty half-duplex systems and synchronous communications. J. Log. Algebraic Methods Program. 131: 100843 (2023) - [j7]Cinzia Di Giusto
A Partial Order View of Message-Passing Communication Models. Proc. ACM Program. Lang. 7(POPL): 1601-1627 (2023) - [c28]Clément Bertrand, Cinzia Di Giusto, Hanna Klaudel, Damien Regnault:
Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata. CONCUR 2023: 33:1-33:17 - [c27]Cinzia Di Giusto
Weakly Synchronous Systems with Three Machines Are Turing Powerful. RP 2023: 28-41 - [e2]Clément Aubert, Cinzia Di Giusto, Simon Fowler, Larisa Safina:
Proceedings 16th Interaction and Concurrency Experience, ICE 2023, Lisbon, Portugal, 19th June 2023. EPTCS 383, 2023 [contents] - [i9]Clément Bertrand, Cinzia Di Giusto, Hanna Klaudel, Damien Regnault:
Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata. CoRR abs/2307.03561 (2023) - [i8]Cinzia Di Giusto, Davide Ferré, Étienne Lozes, Nicolas Nisse:
Weakly synchronous systems with three machines are Turing powerful. CoRR abs/2308.10578 (2023) - 2022
- [e1]Clément Aubert, Cinzia Di Giusto, Larisa Safina, Alceste Scalas:
Proceedings 15th Interaction and Concurrency Experience, ICE 2022, Lucca, Italy, 17th June 2022. EPTCS 365, 2022 [contents] - [i7]Cinzia Di Giusto, Davide Ferré, Laetitia Laversa, Étienne Lozes:
A non-sequential hierarchy of message-passing models. CoRR abs/2210.13062 (2022) - 2021
- [c26]Benedikt Bollig, Cinzia Di Giusto, Alain Finkel, Laetitia Laversa, Étienne Lozes, Amrita Suresh:
A Unifying Framework for Deciding Synchronizability. CONCUR 2021: 14:1-14:18 - [c25]Cinzia Di Giusto
Guessing the Buffer Bound for k-Synchronizability. CIAA 2021: 102-114 - [c24]Cinzia Di Giusto, Loïc Germerie Guizouarn
Towards Generalised Half-Duplex Systems. ICE 2021: 22-37 - [i6]Cinzia Di Giusto, Laetitia Laversa, Étienne Lozes:
Guessing the buffer bound for k-synchronizability. CoRR abs/2104.14408 (2021) - 2020
- [j6]Elisabetta De Maria, Cinzia Di Giusto, Laetitia Laversa:
Spiking neural networks modelled as timed automata: with parameter learning. Nat. Comput. 19(1): 135-155 (2020) - [c23]Cinzia Di Giusto
On the k-synchronizability of Systems. FoSSaCS 2020: 157-176
2010 – 2019
- 2019
- [c22]Cinzia Di Giusto, Cédric Gaucherel, Hanna Klaudel, Franck Pommereau:
Pattern Matching in Discrete Models for Ecosystem Ecology. BIOINFORMATICS 2019: 101-111 - [c21]Cinzia Di Giusto, Cédric Gaucherel, Hanna Klaudel, Franck Pommereau:
Analysis of Discrete Models for Ecosystem Ecology. BIOSTEC (Selected Papers) 2019: 242-264 - [i5]Cinzia Di Giusto, Laetitia Laversa, Étienne Lozes:
On the k-synchronizability for mailbox systems. CoRR abs/1909.01627 (2019) - 2018
- [j5]Franck Delaplace, Cinzia Di Giusto, Jean-Louis Giavitto, Hanna Klaudel, Antoine Spicher:
Activity Networks with Delays an Application to Toxicity Analysis. Fundam. Informaticae 160(1-2): 119-142 (2018) - [c20]Elisabetta De Maria, Cinzia Di Giusto:
Parameter Learning for Spiking Neural Networks Modelled as Timed Automata. BIOINFORMATICS 2018: 17-28 - [c19]Elisabetta De Maria, Cinzia Di Giusto:
Inferring the Synaptical Weights of Leaky Integrate and Fire Asynchronous Neural Networks: Modelled as Timed Automata. BIOSTEC (Selected Papers) 2018: 149-166 - [i4]Elisabetta De Maria, Cinzia Di Giusto, Laetitia Laversa:
Spiking Neural Networks modelled as Timed Automata with parameter learning. CoRR abs/1808.01893 (2018) - 2017
- [c18]Elisabetta De Maria, Cinzia Di Giusto, Giovanni Ciatto
Formal Validation of Neural Networks as Timed Automata. CSBio 2017: 15-22 - 2016
- [j4]Cinzia Di Giusto, Jorge A. Pérez
Event-based run-time adaptation in communication-centric systems. Formal Aspects Comput. 28(4): 531-566 (2016) - [i3]Franck Delaplace, Cinzia Di Giusto, Jean-Louis Giavitto, Hanna Klaudel:
Activity Networks with Delays An application to toxicity analysis. CoRR abs/1608.07440 (2016) - 2015
- [j3]Cinzia Di Giusto, Jorge A. Pérez
Disciplined structured communications with disciplined runtime adaptation. Sci. Comput. Program. 97: 235-265 (2015) - [c17]Cinzia Di Giusto, Jorge A. Pérez
An Event-Based Approach to Runtime Adaptation in Communication-Centric Systems. WS-FM 2015: 67-85 - 2014
- [c16]Cinzia Di Giusto, Hanna Klaudel, Franck Delaplace:
Systemic approach for toxicity analysis. BioPPN@Petri Nets 2014: 30-44 - 2013
- [c15]Cinzia Di Giusto, Jorge A. Pérez
Disciplined structured communications with consistent runtime adaptation. SAC 2013: 1913-1918 - [c14]Cinzia Di Giusto, Jorge A. Pérez
Session Types with Runtime Adaptation: Overview and Examples. PLACES 2013: 21-32 - [c13]Samuel Mimram
A Categorical Theory of Patches. MFPS 2013: 283-307 - [i2]Samuel Mimram, Cinzia Di Giusto:
A Categorical Theory of Patches. CoRR abs/1311.3903 (2013) - 2012
- [j2]Mario Bravetti, Cinzia Di Giusto, Jorge A. Pérez
Adaptable processes. Log. Methods Comput. Sci. 8(4) (2012) - [j1]Cinzia Di Giusto, Maurizio Gabbrielli
On the Expressive Power of Multiple Heads in CHR. ACM Trans. Comput. Log. 13(1): 6:1-6:19 (2012) - [c12]Mario Bravetti, Cinzia Di Giusto, Jorge A. Pérez
Towards the Verification of Adaptable Processes. ISoLA (1) 2012: 269-283 - 2011
- [c11]Cinzia Di Giusto, Jean-Bernard Stefani:
Revisiting Glue Expressiveness in Component-Based Systems. COORDINATION 2011: 16-30 - [c10]Mila Dalla Preda, Cinzia Di Giusto:
Hunting Distributed Malware with the κ-Calculus. FCT 2011: 102-113 - [c9]Mario Bravetti, Cinzia Di Giusto, Jorge A. Pérez
Adaptable Processes (Extended Abstract). FMOODS/FORTE 2011: 90-105 - 2010
- [c8]Mario Bravetti, Cinzia Di Giusto, Jorge A. Pérez
Steps on the Road to Component Evolvability. FACS 2010: 295-299
2000 – 2009
- 2009
- [c7]Giorgio Delzanno, Cinzia Di Giusto, Maurizio Gabbrielli
The kappa-Lattice: Decidability Boundaries for Qualitative Analysis in Biological Languages. CMSB 2009: 158-172 - [c6]Cinzia Di Giusto, Jorge A. Pérez
On the Expressiveness of Forwarding in Higher-Order Communication. ICTAC 2009: 155-169 - [c5]Cinzia Di Giusto, Jorge A. Pérez:
Move vs Copy: Towards a Formal Comparison of Ambients and Higher-Order Process Calculi. ICTCS 2009: 107-112 - [c4]Cinzia Di Giusto, Maurizio Gabbrielli
Expressiveness of Multiple Heads in CHR. SOFSEM 2009: 205-216 - 2008
- [c3]Cinzia Di Giusto, Maurizio Gabbrielli
Full Abstraction for Linda. ESOP 2008: 78-92 - [i1]Cinzia Di Giusto, Maurizio Gabbrielli, Maria Chiara Meo:
Expressiveness of multiple heads in CHR. CoRR abs/0804.3351 (2008) - 2007
- [c2]Jesús Aranda
CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence. APLAS 2007: 383-398 - 2006
- [c1]Jesús Aranda
On Recursion, Replication and Scope Mechanisms in Process Calculi. FMCO 2006: 185-206
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: