3 Hits in 1.4 sec

McScM: A General Framework for the Verification of Communicating Machines [chapter]

Alexander Heußner, Tristan Le Gall, Grégoire Sutre
2012 Lecture Notes in Computer Science  
Seen as a general framework for the class of transition systems with finite control/infinite data, McScM delivers the basic infrastructure for implementing verification algorithms, and privileges to conveniently  ...  We present McScM, a platform for implementing and comparing verification algorithms for the class of finite-state processes exchanging messages over reliable, unbounded FIFO channels.  ...  We aim at filling this gap by presenting a Model Checker for Systems of Communicating Machines (McScM) that combines different algorithms for the safety verification problem of CM under the same roof and  ... 
doi:10.1007/978-3-642-28756-5_34 fatcat:n5mqloosaffj5dqnzse6htx7um

Extrapolation-Based Path Invariants for Abstraction Refinement of Fifo Systems [chapter]

Alexander Heußner, Tristan Le Gall, Grégoire Sutre
2009 Lecture Notes in Computer Science  
Automatic abstraction refinement is also desirable for the safety verification of complex infinite-state models.  ...  This paper investigates Cegar in the context of formal models of network protocols, in our case, the verification of fifo systems.  ...  We thank the anonymous reviewers for supporting and guiding the genesis of this publication, and we are especially grateful for the fruitful and challenging discussions with Jérôme Leroux and Anca Muscholl  ... 
doi:10.1007/978-3-642-02652-2_11 fatcat:xaaszrg3dzceje5geg5zmvsg54

Verifying Asynchronous Interactions via Communicating Session Automata [chapter]

Julien Lange, Nobuko Yoshida
2019 Lecture Notes in Computer Science  
We introduce a new asynchronous compatibility property for csa, called k-multiparty compatibility (k-mc), which is a strict superset of the synchronous multiparty compatibility used in theories and tools  ...  This paper proposes a sound procedure to verify properties of communicating session automata (csa), i.e., communicating automata that include multiparty session types.  ...  We thank Laura Bocchi and Alceste Scalas for their comments, and David Castro and Nicolas Dilley for testing the artifact.  ... 
doi:10.1007/978-3-030-25540-4_6 fatcat:jpr6v6h5unaszgzxfzprnweghe