loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
18th IEEE International Conference on Automated Software Engineering (ASE'03)
A New Structural Coverage Criterion for Dynamic Detection of Program Invariants
Montreal, Quebec, Canada
October 06-October 10
ISBN: 0-7695-2035-9
Neelam Gupta, The University of Arizona
Zachary V. Heidepriem, The University of Arizona
Dynamic detection of program invariants is emerging as an important research area with many challenging problems. Generating suitable test cases that support accurate detection of program invariants is crucial to the dynamic approach for invariant detection. In this paper, we propose a new structural coverage criterion called Invariant-coverage criterion for dynamic detection of program invariants. We also show how the invariant-coverage criterion can be used to improve the accuracy of dynamically detected invariants. We first used the Daikon tool to report likely program invariants using the branch coverage and all definition-use pair coverage test suites for several programs. We then generated invariant-coverage suites for these likely invariants. When Daikon was run with the invariant-coverage suites, several spurious invariants reported earlier by the branch coverage and definition-use pair coverage test suites were removed from the reported invariants. Our approach also produced more meaningful invariants than randomly generated test suites.
Index Terms:
Test data generation, path testing, program invariants, dynamic analysis, execution traces
Citation:
Neelam Gupta, Zachary V. Heidepriem, "A New Structural Coverage Criterion for Dynamic Detection of Program Invariants," ase, pp.49, 18th IEEE International Conference on Automated Software Engineering (ASE'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.