LIRA: Handling Constraints of Linear Arithmetics over the Integers and the Reals
- Cite this paper as:
- Becker B., Dax C., Eisinger J., Klaedtke F. (2007) LIRA: Handling Constraints of Linear Arithmetics over the Integers and the Reals. In: Damm W., Hermanns H. (eds) Computer Aided Verification. CAV 2007. Lecture Notes in Computer Science, vol 4590. Springer, Berlin, Heidelberg
The mechanization of many verification tasks relies on efficient implementations of decision procedures for fragments of first-order logic. Interactive theorem provers like pvs also make use of such decision procedures to increase the level of automation. Our tool lira implements decision procedures based on automata-theoretic techniques for first-order logics with linear arithmetic, namely, for FO(ℕ, +), FO(ℤ,+,<), and FO(ℝ, ℤ,+,<).
Unable to display preview. Download preview PDF.