Using a software testing technique to improve theorem proving

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

Volumn 2931, Issue , 2004, Pages 30-41

  Hähnle, Reiner ^a   Wallenburg, Angela ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL METHODS; TESTING; THEOREM PROVING;

FORMAL PROOFS; IMPROVE-A; INDUCTION VARIABLES; PARTITION TESTING; PROGRAM CODE; SOFTWARE TESTING TECHNIQUES; TEST CASE GENERATION; USER INTERACTION;

SOFTWARE TESTING;

EID: 35048849431     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24617-6_3     Document Type: Article

References (15)

1. Weyuker, E.J., Ostrand, T.J.: Theories of Program Testing and the Application of Revealing Subdomains. IEEE Transactions on Software Engineering 6 (1980) 236-246
2. Hamlet, D., Taylor, R.: Partition Testing Does Not Inspire Confidence. IEEE Transactions on Software Engineering 16 (1990) 1402-1411
3. Goodenough, J.B., Gerhart, S.L.: Toward a Theory of Test Data Selection. IEEE Transactions on Software Engineering 1 (1975) 156-173
4. Howden, W.E.: Reliability of the Path Analysis Testing Strategy. IEEE Transactions on Software Engineering 2 (1976) 208-215
5. Richardson, D., Clarke, L.: Partition Analysis: A Method Combining Testing and Verification. IEEE Transactions on Software Engineering 11 (1985) 1477-1490
6. Ahrendt, W., Baar, T., Beckert, B., Giese, M., Hähnle, R., Menzel, W., Mostowski, W., Schmitt, P.H.: The KeY system: Integrating object-oriented design and formal methods. In Kutsche, R.D., Weber, H., eds.: Fundamental Approaches to Software Engineering. Volume 2306 of LNCS., Springer-Verlag (2002) 327-330
7. Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press (2000)
8. Beckert, B.: A dynamic logic for the formal verification of Java Card programs. In Attali, I., Jensen, T., eds.: Java on Smart Cards: Programming and Security. Revised Papers, Java Card 2000, Cannes, France. Volume 2041 of LNCS., Springer-Verlag (2001) 6-24
9. Burstall, R.M.: Program proving as hand simulation with a little induction. In Rosenfeld, J.L., ed.: Information Processing 74, Proceedings of IFIP Congress 74. (1974) 201-210
10. Hähnle, R., Heisel, M., Reif, W., Stephan, W.: An interactive verification system based on dynamic logic. In Siekmann, J., ed.: Proc. 8th Conference on Automated Deduction CADE, Oxford. Volume 230 of LNCS., Springer-Verlag (1986) 306-315
11. Heisel, M., Reif, W., Stephan, W.: Program verification by symbolic execution and induction. In: Proc. 11th German Workshop on Artifical Intelligence. Volume 152 of Informatik Fachberichte., Springer-Verlag (1987) 201-210
12. Geller, M.M.: Test data as an aid in proving program correctness. Communications of the ACM 21 (1978) 368-375
13. Nimmer, J.W., Ernst, M.D.: Automatic generation of program specifications. In: Proceedings of the international symposium on Software testing and analysis, ACM Press (2002) 229-239
14. Slind, K.: Derivation and use of induction schemes in higher-order logic. In Gunter, E.L., Felty, A., eds.: Proc. 10th International Theorem Proving in Higher Order Logics Conference. Volume 1275 of LNCS., Springer-Verlag (1997) 275-290
15. Claessen, K., Hähnle, R., Mårtensson, J.: Verification of hardware systems with first-order logic. In Sutcliffe, G., Pelletier, J., Suttner, C., eds.: Proc. Problems and Problem Sets Workshop, affiliated to CADE-18, Copenhagen, DIKU, University of Copenhagen, Denmark (2002) Technical Report.