Download:
|
by Cormac Flanagan, K. Rustan, M. Leino
In Proceedings of the International Symposium of Formal Methods Europe
http://www.research.compaq.com/SRC/personal/rustan/papers/krml100.ps
Add To MetaCart
Abstract:
Abstract. A static program checker that performs modular checking can check one program module for errors without needing to analyze the entire program. Modular checking requires that each module be accompanied by annotations that specify the module. To help reduce the cost of writing specifications, this paper presents Houdini, an annotation assistant for the modular checker ESC/Java. To infer suitable ESC/Java annotations for a given program, Houdini generates a large number of candidate annotations and uses ESC/Java to verify or refute each of these annotations. The paper describes the design, implementation, and preliminary evaluation of Houdini. 0
Citations
|
407
|
Construction of abstract state graphs with PVS
– Graf, Saïdi
- 1997
|
|
248
|
Cousot and Radhia Cousot. Abstract Interpretation Frameworks
– Patrick
- 1992
|
|
172
|
A Static Analyzer for Finding Dynamic Programming Errors. Software: Practice and Experience
– Bush, Pincus, et al.
|
|
155
|
Type-based race detection for Java
– Flanagan, Freund
- 2000
|
|
117
|
Set-based analysis of ML programs
– Heintze
- 1994
|
|
98
|
Mercator: A scalable, extensible web crawler
– Heydon, Najork
- 1999
|
|
84
|
Quickly detecting relevant program invariants
– Ernst, Czeisler, et al.
- 2000
|
|
83
|
B.: ESC/Java User’s Manual
– Leino, Nelson, et al.
- 2000
|
|
60
|
Avoiding exponential explosion: generating compact verification conditions
– Flanagan, Saxe
- 2001
|
|
31
|
Raymie Stata. Checking Java programs via guarded commands
– Leino, Saxe
- 1999
|
|
24
|
Effective Static Debugging via Componential Set-Based Analysis
– Flanagan
- 1997
|
|
22
|
Annotation inference for modular checkers
– Flanagan, Joshi, et al.
- 2001
|
|
3
|
Compaq Systems Research Center. On the Web at research.compaq.com/SRC/software
– Java2html
|