Towards verification and testing of Java programs

  • Authors:
  • Ana C. V. de Melo;Paulo R. F. Nunes;Kleber S. Xavier

  • Affiliations:
  • University of São Paulo, São Paulo -- Brazil;University of São Paulo, São Paulo -- Brazil;University of São Paulo, São Paulo -- Brazil

  • Venue:
  • Proceedings of the 2008 ACM symposium on Applied computing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Testing object-oriented programs is still a hard task, despite many studies on criteria to better cover the test space. Test criteria establish requirements one want to achieve in testing programs to help in finding software defects. On the other hand, program verification guarantees that a program preserves its specification but it is not very straightforwardly applicable in many cases. Both program testing and verification are expensive tasks and could be used to complement each other. This paper presents a study on using formal verification to reduce the space of program testing. As properties are checked using program model checkers, programs are traced. Information from these traces can be used to realize how much testing criteria have been satisfied, reducing the further program test space. The present work is a study on how much the test space of concurrent Java programs can be reduced if DeadlockFreedom is checked prior to testing.