Compositional verification of asynchronous processes via constraint solving

DOI10.1007/11523468_100MaRDI QIDQ5716749zbMATH OpenOpenAlexFDO

Authors Giorgio Delzanno, Maurizio Gabbrielli

Publication date 10 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Compositional verification of asynchronous concurrent systems using CADP
• Constraint-based deductive model checking
• BDD vs. constraint-based model checking: An experiment evaluation for asynchronous concurrent systems
• scientific article; zbMATH DE number 1406234
• Verification of sets of infinite state processes using program transformation

Cited in

(6)

• A system for compositional verification of asynchronous objects
• On the computation of counterexamples in compositional nonblocking verification
• Compositional verification of asynchronous concurrent systems using CADP
• A Proof System for Compositional Verification of Probabilistic Concurrent Processes
• The semantic foundations of a compositional proof method for synchronously communicating processes
• Compositional Nonblocking Verification Using Generalized Nonblocking Abstractions

This page was built for publication: Compositional verification of asynchronous processes via constraint solving

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716749)