Constrained Monotonic Abstraction: A CEGAR for Parameterized Verification

DOI10.1007/978-3-642-15375-4_7zbMath1287.68117OpenAlexW1853246977MaRDI QIDQ3584923

Frédéric Haziza, Giorgio Delzanno, Chih-Duo Hong, Yu-Fang Chen, Ahmed Rezine, Parosh Aziz Abdulla

Publication date: 31 August 2010

Published in: CONCUR 2010 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15375-4_7

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)

Related Items

Petri nets with name creation for transient secure association

Uses Software

• CEGAR
• FOCI