LIRA: Handling constraints of linear arithmetics over the integers and the reals

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4590 LNCS, Issue , 2007, Pages 307-310

  Becker, Bernd ^a   Dax, Christian ^b   Eisinger, Jochen ^a   Klaedtke, Felix ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38149038601     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73368-3_36     Document Type: Conference Paper

References (14)

1. Bardin, S., Leroux, J., Point, G.: FAST extended release. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 63-66. Springer, Heidelberg (2006)
2. Boigelot, B., Jodogne, S., Wolper, P.: An effective decision procedure for linear arithmetic over the integers and reals. ACM Trans.Comput. Log 6, 614-633 (2005)
3. Bozzano, M., Bruttomesso, R., Cimatti, A., Junttila, T.A., van Rossum, P., Schulz, S., Sebastiani, R.: The MathSAT 3 system. In: Ziarko, W., Yao, Y. (eds.) RSCTC 2000. LNCS (LNAI), vol. 3632, pp. 315-321. Springer, Heidelberg (2001)
4. Büchi, J.: Weak second-order arithmetic and finite automata. Zeitschrift der mathematischen Logik und Grundlagen der Mathematik 6, 66-92 (1960)
5. Couvreur, J.-M.: A BDD-like implementation of an automata package, In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 310-311. Springer, Heidelberg (2005)
6. CUDD, Colorado university Decision Diagram package, http://visi.colorado. edu/-fabio/CUDD/
7. Damm, W., Disch, S., Hungar, H., Pang, J., Pigorsch, F., Scholl, C., Waldmann, U., Wirtz, B.: Automatic verification of hybrid systems with large discrete state space. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol. 4218, pp. 276-291. Springer, Heidelberg (2006)
8. Dax, C., Eisinger, J., Klaedtke, F.: Mechanizing the powerset construction for restricted classes of w-automata, Tech. Report 228, Institut für Informatik, Albert-Ludwigs-Universität Freiburg (2007)
9. Dutertre, B., de Moura, L.: The Yices SMT solver (2006) Available at http://yices.csl.sri.com/tool-paper.pdf
10. Eisinger, J., Klaedtke, F.: Don't care words with an application to the automata-based approach for real addition. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 67-80. Springer, Heidelberg (2006)
11. Klarlund, N.: A theory of restrictions for logics and automata. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 406-417. Springer, Heidelberg (1999)
12. Klarlund, N., Møller, A., Schwartzbach, M.I.: MONA implementation secrets. Int. J. Found. Comput. Sci. 13, 571-586 (2002)
13. lash, The Liège Automata-based Symbolic Handler http://www.montefiore.ulg.ac.be/-{}boigelot/research/lash/
14. omega, The Omega project. http://www.cs.umd.edu/projects/omega/