Linear Completeness Thresholds for Bounded Model Checking

DOI10.1007/978-3-642-22110-1_44zbMath1360.68592OpenAlexW174184838MaRDI 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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (7)

SAT-Based Model Checking ⋮ Model checking and strategy synthesis for multi-agent systems for resource allocation ⋮ Parameterized complexity classes beyond para-NP ⋮ Formally verified algorithms for upper-bounding state space diameters ⋮ Incremental bounded model checking for embedded software ⋮ On the completeness of bounded model checking for threshold-based distributed algorithms: reachability ⋮ TOrPEDO : witnessing model correctness with topological proofs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computer Aided Verification
• On finite monoids having only trivial subgroups
• Computer Aided Verification
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: Linear Completeness Thresholds for Bounded Model Checking