Proving or disproving likely invariants with constraint reasoning

Proceedings of the 15th Workshop on Logic-based methods in Programming Environments, WLPE 2005

Volumn , Issue , 2005, Pages 01-

  Denmat, Tristan ^a   Gotlieb, Arnaud ^a   Ducassé, Mireille ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATICALLY GENERATED; CONSTRAINT REASONING; CONSTRAINT-BASED REASONING; LIKELY INVARIANTS; PROGRAM INVARIANTS; WORK IN PROGRESS;

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

References (16)

1. B. Botella, A. Gotlieb, and C. Michel. Symbolic execution of floating-point computations. Software Testing, Verification and Reliability Journal, 2005.
2. L. Burdy, Y. Cheon, D. R. Cok, M. D. Ernst, J. R. Kiniry, G. T. Leavens, K. R. Leino, and E. Poll. An overview of JML tools and applications. International Journal on Software Tools for Technology Transfer, 7(3):212-232, 2005.
3. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of Symposium on Principles of Programming Languages, pages 238-252. ACM, 1977.
4. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Proceedings of Symposium on Principles of Programming Languages, pages 84-96. ACM, 1978.
5. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451-490, 1991.
6. 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.
7. M. D. Ernst, A. Czeisler, W. G. Griswold, and D. Notkin. Quickly detecting relevant program invariants. In Proceedings of the International Conference on Software Engineering, pages 449-458. IEEE, 2000.
8. A. Gotlieb, B. Botella, and M. Rueher. Automatic test data generation using constraint solving techniques. In Proceedings of the International Symposium on Software Testing and Analysis, pages 53-62. ACM, 1998.
9. A. Gotlieb, B. Botella, and M. Rueher. A CLP framework for computing structural test data. In First International Conference on Computational Logic, pages 399-413. Springer, 2000.
10. A. Gotlieb, T. Denmat, and B. Botella. Goal-oriented test data generation for programs with pointer variables. In Proceedings of the International Computer Software and Applications Conference. IEEE, 2005.
11. G. Gupta. Horn logic denotations and their applications. In K. R. Apt, V. W. Marek, M. Truszczynski, and D. S. Warren, editors, The Logic Programming Paradigm: A 25-Year Perspective, pages 127-159. Springer, 1999.
12. C. A. R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576-580, 1969.
13. D. Jackson and M. Vaziri. Finding bugs with a constraint solver. In Proceedings of the International Symposium on Software Testing and Analysis, pages 14-25. ACM, 2000.
14. B. Meyer. Object-Oriented Software Construction. Prentice Hall, second edition, 1997.
15. A. Miné. Relational abstract domains for the detection of floating-point run-time errors. In Proceedings of the European Symposium on Programming, volume 2986 of LNCS, pages 3-17. Springer, 2004.
16. J. W. Nimmer and M. D. Ernst. Automatic generation of program specifications. In Proceedings of the International Symposium on Software Testing and Analysis, pages 229-239. ACM, 2002.