Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems)

DOI10.1007/978-3-540-71209-1_56zbMath1186.68312OpenAlexW1870526560MaRDI QIDQ5758139

Noomene Ben Henda, Giorgio Delzanno, Ahmed Rezine, Parosh Aziz Abdulla

Publication date: 3 September 2007

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71209-1_56

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 (20)

Structural Invariants for the Verification of Systems with Parameterized Architectures ⋮ Computing Parameterized Invariants of Parameterized Petri Nets ⋮ Model Checking Parameterized Systems ⋮ Unnamed Item ⋮ Regular model checking: evolution and perspectives ⋮ Cardinality constraints for arrays (decidability results and applications) ⋮ Monotonic Abstraction for Programs with Dynamic Memory Heaps ⋮ Parameterized model checking on the TSO weak memory model ⋮ Verification of component-based systems with recursive architectures ⋮ Towards SMT Model Checking of Array-Based Systems ⋮ Checking deadlock-freedom of parametric component-based systems ⋮ Light-Weight SMT-based Model Checking ⋮ MCMT: A Model Checker Modulo Theories ⋮ Higher-order quantifier elimination, counter simulations and fault-tolerant systems ⋮ Handling Parameterized Systems with Non-atomic Global Conditions ⋮ Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols ⋮ Monotonic Abstraction in Parameterized Verification ⋮ Automatic Verification of Directory-Based Consistency Protocols ⋮ Monotonic Abstraction in Action ⋮ Computing parameterized invariants of parameterized Petri nets

This page was built for publication: Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems)