Efficient Proof Engines for Bounded Model Checking of Hybrid Systems
Authors:
- Martin FränzleMFMartin Fränzle
- Christian HerdeCHChristian Herde
Open Access
- 31 May 2005
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 133, 119-137
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT2002
- Generic ILP versus specialized 0-1 ILP2006 IEEE/ACM International Conference on Computer Aided Design, 2002
- GRASP: a search algorithm for propositional satisfiabilityIEEE Transactions on Computers, 1999
- The Impact of Branching Heuristics in Propositional Satisfiability Algorithms1999
- A linear-time transformation of linear inequalities into conjunctive normal formInformation Processing Letters, 1998
- Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear ProgramINFORMS Journal on Computing, 1997
- Locating Minimal Infeasible Constraint Sets in Linear ProgramsINFORMS Journal on Computing, 1991
- Predicative programming Part ICommunications of the ACM, 1984
- A machine program for theorem-provingCommunications of the ACM, 1962