Abstract
In this chapter, we present a decision procedure which is tailored to fit the needs of BMC of infinite-state systems with piecewise linear variable updates, e.g. of linear hybrid automata, as introduced in chapter 2. Our tool, we name it HySAT-1, tightly integrates a DPLL style SAT solver with a linear programming routine, combining the virtues of both methods: Linear programming adds the capability of solving large conjunctive systems of linear inequalities over the reals, whereas the SAT solver accounts for fast Boolean search and efficient handling of disjunctions. Building on the work presented in chapter 3, we use our pseudo-Boolean solver GOBLIN as SAT engine in HySAT-1.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2011 Vieweg+Teubner Verlag | Springer Fachmedien Wiesbaden GmbH
About this chapter
Cite this chapter
Herde, C. (2011). Integration of DPLL-SAT and Linear Programming. In: Efficient Solving of Large Arithmetic Constraint Systems with Complex Boolean Structure. Vieweg+Teubner. https://doi.org/10.1007/978-3-8348-9949-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-8348-9949-1_4
Publisher Name: Vieweg+Teubner
Print ISBN: 978-3-8348-1494-4
Online ISBN: 978-3-8348-9949-1
eBook Packages: Computer ScienceComputer Science (R0)