Efficient Proof Engines for Bounded Model Checking of Hybrid Systems |
| | Abstract | In this paper we present HySat, a new bounded model checker for linear hybrid systems, incorporating a tight integration of a DPLL-based pseudo-Boolean SAT solver and a linear programming routine as core engine. In contrast to related tools like MathSAT, ICS, or CVC, our tool exploits all of the various optimizations that arise naturally in the bounded model checking context, e.g. isomorphic replication of learned conflict clauses or tailored decision strategies, and extends them to the hybrid domain. We demonstrate that those optimizations are crucial to the performance of the tool. | | Keywords | verification, bounded model checking, hybrid systems, infinite-state systems, decision procedures, satisfiability | | Type | Journal paper [With referee] | | Journal | Electronic Notes in Theoretical Computer Science | | Year | 2005 Vol. 133 pp. 119-137 | | Electronic version(s) | [pdf] | | BibTeX data | [bibtex] | | IMM Group(s) | Computer Science & Engineering |
|