Linear Completeness Thresholds for Bounded Model Checking
From MaRDI portal
Publication:3088266
DOI10.1007/978-3-642-22110-1_44zbMath1360.68592MaRDI QIDQ3088266
Ofer Strichman, Thomas Wahl, Joël Ouaknine, Daniel Kroening, James Worrell
Publication date: 19 August 2011
Published in: Computer Aided Verification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22110-1_44
68Q45: Formal languages and automata
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
On the completeness of bounded model checking for threshold-based distributed algorithms: reachability, Formally verified algorithms for upper-bounding state space diameters, Incremental bounded model checking for embedded software, TOrPEDO : witnessing model correctness with topological proofs, Model checking and strategy synthesis for multi-agent systems for resource allocation, Parameterized complexity classes beyond para-NP, SAT-Based Model Checking
Cites Work