Parameterized Verification of Infinite-State Processes with Global Conditions

DOI10.1007/978-3-540-73368-3_17zbMath1135.68461OpenAlexW1541228707MaRDI QIDQ5429320

Ahmed Rezine, Giorgio Delzanno, Parosh Aziz Abdulla

Publication date: 29 November 2007

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73368-3_17

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (15)

Regular model checking: evolution and perspectives ⋮ Cardinality constraints for arrays (decidability results and applications) ⋮ Monotonic Abstraction for Programs with Dynamic Memory Heaps ⋮ Exploiting step semantics for efficient bounded model checking of asynchronous systems ⋮ Parameterized model checking on the TSO weak memory model ⋮ Unnamed Item ⋮ Towards SMT Model Checking of Array-Based Systems ⋮ Light-Weight SMT-based Model Checking ⋮ MCMT: A Model Checker Modulo Theories ⋮ Handling Parameterized Systems with Non-atomic Global Conditions ⋮ Monotonic Abstraction in Parameterized Verification ⋮ Automatic Verification of Directory-Based Consistency Protocols ⋮ Approximated parameterized verification of infinite-state processes with global conditions ⋮ Monotonic Abstraction in Action ⋮ Unnamed Item

This page was built for publication: Parameterized Verification of Infinite-State Processes with Global Conditions