Inferring invariants by symbolic execution

CEUR Workshop Proceedings

Volumn 259, Issue , 2007, Pages 195-210

  Schmitt, Peter H ^a   Weiß, Benjamin ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AXIOMATI-SATION; FIXED POINTS; JAVA PROGRAM; KEY SYSTEMS; NON-TRIVIAL; PREDICATE ABSTRACTIONS; SYMBOLIC EXECUTION; WHILE LOOPS;

JAVA PROGRAMMING LANGUAGE; SEMANTICS;

COMPUTER SOFTWARE;

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

References (24)

1. B. Beckert, M. Giese, R. Hähnle, V. Klebanov, P. Rümmer, S. Schlager, and P. H. Schmitt. The KeY System 1.0 (deduction component). In F. Pfenning, editor, Proceedings, 21st International Conference on Automated Deduction (CADE), LNCS. Springer, 2007. To appear.
2. B. Beckert and C. Gladisch. White-box testing by combining deduction-based specification extraction and black-box testing. In Y. Gurevich, editor, Proceedings, International Conference on Tests and Proofs (TAP), Zürich, Switzerland, LNCS. Springer, 2007. To appear.
3. B. Beckert, R. Hähnle, and P. H. Schmitt, editors. Verification of Object-Oriented Software: The KeY Approach, Volume 4334 of LNCS. Springer, 2007.
4. B. Beckert, S. Schlager, and P. H. Schmitt. An improved rule for while loops in deductive program verification. In K.-K. Lau, editor, Proceedings, 7th International Conference on Formal Engineering Methods (ICFEM), Volume 3785 of LNCS, pages 315-329. Springer, 2005.
5. D. Beyer, T. A. Henzinger, R. Jhala, and R. Majumdar. Checking memory safety with Blast. In M. Cerioli, editor, Proceedings, 8th International Conference on Fundamental Approaches to Software Engineering (FASE), Volume 3442 of LNCS, pages 2-18. Springer, 2005.
6. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In Proceedings, 12th International Conference on Computer Aided Verification (CAV), pages 154-169. Springer, 2000.
7. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings, 4th Annual ACM Symposium on Principles of Programming Languages (POPL), pages 238-252. ACM Press, 1977.
8. D. Detlefs, G. Nelson, and J. B. Saxe. Simplify: A theorem prover for program checking. Technical Report HPL-2003-148, HP Laboratories Palo Alto, 2003.
9. C. Engel and R. Hähnle. Generating unit tests from formal proofs. In Y. Gurevich, editor, Proceedings, International Conference on Tests and Proofs (TAP), Zürich, Switzerland, LNCS. Springer, 2007. To appear.
10. M. D. Ernst, J. Cockrell, W. G. Griswold, and D. Notkin. Dynamically discovering likely program invariants to support program evolution. IEEE Transactions on Software Engineering, 27(2):99-123, 2001.
11. C. Flanagan and S. Qadeer. Predicate abstraction for software verification. In Proceedings, 29th Annual ACM Symposium on Principles of Programming Languages (POPL), pages 191-202. ACM Press, 2002.
12. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In Proceedings, 9th International Conference on Computer Aided Verification (CAV), pages 72-83. Springer, 1997.
13. D. Harel, D. Kozen, and J. Tiuryn. Dynamic Logic. MIT Press, 2000.
14. J. J. Hunt, E. Jenn, S. Leriche, P. Schmitt, I. Tonin, and C. Wonnemann. A case study of specification and verification using JML in an avionics application. In M. Rochard-Foy and A. Wellings, editors, Proceedings, 4th Workshop on Java Technologies for Real-time and Embedded Systems (JTRES). ACM Press, 2006.
15. Java Card platform specification 2.2.1. Sun Microsystems, Inc., October 2003.
16. J. C. King. Symbolic execution and program testing. Communications of the ACM, 19(7):385-394, 1976.
17. K. R. M. Leino and F. Logozzo. Loop invariants on demand. In K. Yi, editor, Proceedings, 3rd Asian Symposium on Programming Languages and Systems (APLAS), Volume 3780 of LNCS, pages 119-134. Springer, 2005.
18. B. Meyer. Applying "design by contract,". Computer, 25(10):40-51, 1992.
19. W. Mostowski. Fully verified Java Card API reference implementation. In Proceedings, 4th International Verification Workshop (VERIFY'07), Workshop at CADE-21, Bremen, Germany. CEUR Workshop Proceedings, 2007. To appear.
20. S. Ranise and C. Tinelli. The SMT-LIB standard: Version 1.2. Technical report, University of Iowa, 2006.
21. P. Rummer. Sequential, parallel, and quantified updates of first-order structures. In Proceedings, 13th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), Volume 4246 of LNCS, pages 422-436. Springer, 2006.
22. P. H. Schmitt and I. Tonin. Verifying the Mondex case study. In M. Hinchey and T. Margaria, editors, Proceedings, 5th IEEE International Conference on Software Engineering and Formal Methods (SEFM). IEEE Press, 2007. To appear.
23. S. Stepney, D. Cooper, and J. Woodcock. An electronic purse: Specification, refinement, and proof. Technical monograph PRG-126, Oxford University Computing Laboratory, July 2000.
24. B. Weiß. Inferring invariants by static analysis in KeY. Diplomarbeit, University of Karlsruhe, March 2007.