A sequent calculus for integer arithmetic with counterexample generation

CEUR Workshop Proceedings

Volumn 259, Issue , 2007, Pages 179-194

  Rummer, Philipp ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED TOOLS; FIRST ORDER LOGIC; INTEGER ARITHMETIC; LINEAR INEQUALITIES; NONLINEAR INEQUALITY; PROOF OBLIGATIONS; SEQUENT CALCULUS; VERIFICATION SYSTEMS;

CALCULATIONS; DIFFERENTIATION (CALCULUS); NONLINEAR EQUATIONS;

FORMAL LOGIC;

EID: 43149115759     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. Beckert, B., Hähnle, R., Schmitt, P.H., eds.: Verification of Object-Oriented Software: The KeY Approach. LNCS 4334. Springer-Verlag (2007)
2. Mostowski, W.: Fully verified JavaCard API reference implementation. In: 4th International Verification Workshop. (2007) To appear.
3. Fitting, M.C.: First-Order Logic and Automated Theorem Proving. 2nd edn. Springer-Verlag, New York (1996)
4. King, J.C.: Symbolic execution and program testing. Communications of the ACM 19 (1976) 385-394
5. Knuth, D.E.: The Art of Computer Programming: Seminumerical Algorithms. Addison-Wesley (1997) Third edition.
6. Buchberger, B.: An algorithmical criterion for the solvability of algebraic systems. Aequationes Mathematicae 4 (1970) 374-383 (German).
7. Buchberger, B.: A critical-pair/completion algorithm for finitely generated ideals in rings. In: Proceedings of the Symposium "Rekursive Kombinatorik," on Logic and Machines: Decision Problems and Complexity, London, UK, Springer-Verlag (1984) 137-161
8. Dershowitz, N.: Termination of rewriting. J. Symb. Comput. 3 (1987) 69-116
9. Dershowitz, N., Manna, Z.: Proving termination with multiset orderings. Commun. ACM 22 (1979) 465-476
10. Schrijver, A.: Theory of Linear and Integer Programming. Wiley (1986)
11. Owre, S., Rajan, S., Rushby, J., Shankar, N., Srivas, M.: PVS: Combining specification, proof checking, and model checking. In Alur, R., Henzinger, T.A., eds.: Proceedings, CAV. Volume 1102 of LNCS., Springer (1996) 411-414
12. Dowek, G., Felty, A., Herbelin, H., Huet, G., Murthy, C, Parent, C, Paulin-Mohring, C, Werner, B.: The Coq proof assistant user's guide. Rapport Techniques 154, INRIA, Rocquencourt, France (1993) Version 5.8.
13. Kaufmann, M., Moore, J.S.: ACL2: An industrial strength version of nqthm. In: Compass'96: Eleventh Annual Conference on Computer Assurance, Gaithersburg, Maryland, National Institute of Standards and Technology (1996)
14. Warren A. Hunt, J., Krug, R.B., Moore, J.S.: Linear and nonlinear arithmetic in ACL2. In Geist, D., Tronci, E., eds.: CHARME. Volume 2860 of Lecture Notes in Computer Science., Springer (2003) 319-333
15. Breunesse, C.B., Jacobs, B., van den Berg, J.: Specifying and verifying a decimal representation in java for smart cards. In: Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology, London, UK, Springer-Verlag (2002) 304-318
16. Gemplus purse applet. (http://www.gemplus.com/smart/r-d/publications/ case-study/)
17. Kapur, D., Nie, X.: Reasoning about numbers in tecton. In: International Symposium on Methodologies for Intelligent Systems, Charlotte, North Carolina. (1994)
18. Matijasevic, Y.: Enumerable sets are diophantine (Russian). Dokl. Akad. Nauk SSSR 191 (1970) 279-282
19. Translation in Soviet Math Doklady, Vol 11, 1970.
20. Warren A. Hunt, J., Krug, R.B., Moore, J.S.: Integrating nonlinear arithmetic into into ACL2. In: Fifth International Workshop on the ACL2 Theorem Prover and Its Applications (ACL2-2004). (2004)
21. Kapur, D., Cyrluk, D.: Reasoning about nonlinear inequality constraints: a multi-level approach. In: Proceedings of a workshop on Image understanding workshop, San Francisco, CA, USA, Morgan Kaufmann Publishers Inc. (1989) 904-915
22. Harrison, J.: The HOL light manual (1.1) (2000)
23. Ranise, S., Tinelli, C: The Satisfiability Modulo Theories Library (SMT-LIB). www.SMT-LIB.org (2006)
24. Rummer, P., Shah, M.A.: Proving programs incorrect using a sequent calculus for Java Dynamic Logic. In: International Conference on Tests And Proofs (TAP). LNCS, Springer (2007) To appear.