LIRA: Handling Constraints of Linear Arithmetics over the Integers and the Reals

(Tool Paper)
  • Bernd Becker
  • Christian Dax
  • Jochen Eisinger
  • Felix Klaedtke
Conference paper

DOI: 10.1007/978-3-540-73368-3_36

Volume 4590 of the book series Lecture Notes in Computer Science (LNCS)
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

Abstract

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(ℝ, ℤ,+,<).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Bernd Becker
    • 1
  • Christian Dax
    • 2
  • Jochen Eisinger
    • 1
  • Felix Klaedtke
    • 2
  1. 1.Albert-Ludwigs-Universität FreiburgGermany
  2. 2.ETH ZurichSwitzerland