Bounded Model Checking with Parametric Data Structures

DOI10.1016/j.entcs.2006.12.019zbMath1277.68129OpenAlexW2113236984MaRDI QIDQ2864380

Bernd Becker, Erika Ábrahám, Martin Steffen, Marc Herbstritt

Publication date: 6 December 2013

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.12.019

zbMATH Keywords

hybrid automataSATBMCparametric data structures

Mathematics Subject Classification ID

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

Uses Software

• MiniSat
• Chaff
• BerkMin
• CVC Lite

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The algorithmic analysis of hybrid systems
• Accelerating bounded model checking of safety properties
• BerkMin: A fast and robust SAT-solver
• GRASP: a search algorithm for propositional satisfiability
• Computer Aided Verification
• Computer Aided Verification
• Verification of Timed Automata via Satisfiability Checking
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Theory and Applications of Satisfiability Testing
• Correct Hardware Design and Verification Methods
• Computer Aided Verification

This page was built for publication: Bounded Model Checking with Parametric Data Structures