ACM Home Page
Please provide us with feedback. Feedback
Model checking Java programs using structural heuristics
Full text PdfPdf (230 KB)
Source International Symposium on Software Testing and Analysis archive
Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis table of contents
Roma, Italy
SESSION: Static analysis of Java programs table of contents
Pages: 12 - 21  
Year of Publication: 2002
ISBN ~ ISSN:0163-5948 , 1-58113-562-9
Also published in ...
Authors
Alex Groce  Carnegie Mellon University
Willem Visser  RIACS/NASA Ames Research Center
Sponsor
SIGSOFT: ACM Special Interest Group on Software Engineering
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 38,   Citation Count: 14
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/566172.566175
What is a DOI?

ABSTRACT

We describe work in troducing heuristic search into the Java PathFinder model checker, which targets Java bytecode. Rather than focusing on heuristics aimed at a particular kind of error (such as deadlocks) we describe heuristics based on a modification of traditional branch coverage metrics and other structure measures, such as thread inter-dependency. We present experimental results showing the utility of these heuristics, and argue for the usefulness of structural heuristics as a class.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
P. Ammann and P. Black. Test Generation and Recognition with Formal Methods. In Proceedings of the 1st International workshop on Automated Program Analysis, Testing, and Verication, pages 64-67, 2000.
 
3
 
4
5
 
6
7
 
8
 
9
10
 
11
 
12
 
13
 
14
S. Edelkamp, A. L. Lafuente, and S. Leue. Trail-Directed Model Checking. In Proceedings of the Workshop of Software Model Checking, Electrical Notes in Theoretical Computer Science, Elsevier, July 2001.
 
15
 
16
 
17
 
18
 
19
P. E. Hart, N. J. Nilsson and B. Raphael. A formal basis for heuristic determination of minimum path cost. In IEEE Transactions Syst. Science and Cybernetics, 4(2):100-107, 1968.
 
20
K. Havelund, M. Lowry, S. Park, C. Pecheur, J. Penix, W. Visser and J. White. Formal Analysis of the Remote Agent Before and After Flight. In Proceedings of the 5th NASA Langley Formal Methods Workshop, June 2000, 2000.
21
 
22
G. J. Holzmann. Algorithms for automated protocol verification. AT&T Technical Journal, 69(2):32-44, Feb. 1990, pages 32-44. Special Issue on Protocol Testing, Specification, and Verification.
 
23
 
24
G. J. Holzmann and M. H. Smith. Automating Software Feature Verification. In Bell Labs Technical Journal, 5(2);72-87 April-June 2000
 
25
 
26
F. J. Lin, P. M. Chu, and M. T. Liu. Protocol Verification Using Reachability Analysis: The State Space Explosion Problem and Relief Strategies. ACM, 126-135, 1988.
 
27
28
 
29
A. Pretschner. Classical search strategies for test case generation with Constraint Logic Programming. In Proceedings of the Workshop on Formal Approaches to Testing of Software, pages 47-60, 2001.
 
30
RTCA Special Committee 167. Software considerations in airborne systems and equipment certification. Technical Report DO-178B, RTCA, Inc., Dec. 1992.
 
31
 
32
 
33
34
35

CITED BY  14

Collaborative Colleagues:
Alex Groce: colleagues
Willem Visser: colleagues