Proving Liveness by Backwards Reachability

DOI10.1007/11817949_7zbMath1151.68498OpenAlexW2138112549MaRDI QIDQ5756597

M. Saxena, Ahmed Rezine, Bengt Jonsson, Parosh Aziz Abdulla

Publication date: 4 September 2007

Published in: CONCUR 2006 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11817949_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) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Parameterized verification of leader/follower systems via first-order temporal logic ⋮ Temporal Verification of Fault-Tolerant Protocols ⋮ Temporal prophecy for proving temporal properties of infinite-state systems

This page was built for publication: Proving Liveness by Backwards Reachability