Efficient Coverability Analysis by Proof Minimization

DOI10.1007/978-3-642-32940-1_35zbMath1364.68138OpenAlexW1947886897MaRDI QIDQ2912699

Daniel Kroening, Thomas Wahl, Alexander D. Kaiser

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32940-1_35

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

Handling infinitely branching well-structured transition systems ⋮ \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms ⋮ Long-Run Average Behavior of Vector Addition Systems with States ⋮ Lost in abstraction: monotonicity in multi-threaded programs ⋮ Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States ⋮ Abstraction-based incremental inductive coverability for Petri nets

Uses Software

• Petruchio

This page was built for publication: Efficient Coverability Analysis by Proof Minimization