(Enter summary)
Abstract: Explicitly stated program invariants can help programmers
by characterizing aspects of program execution and identifying
program properties that must be preserved when modifying
code; invariants can also be of assistance to automated
tools. Unfortunately, these invariants are usually absent from
code. Previous work showed how to dynamically detect invariants
by looking for patterns in and relationships among
variable values captured in program traces. A prototype implementation,
Daikon,... (Update)
Context of citations to this paper: More
...something is implemented, but also exposes the full complexity of a given implementation. Daikon has been improved in many ways [16, 17, 13] and has been used for various applications including program evolution [15] refactoring [32] test suite quality evaluation [24] bug...
Cited by: More
Discovering Algebraic Specifications from Java Classes - Henkel, Diwan (2003)
(Correct)
Similar documents (at the sentence level): More
27.0%: Dynamically Discovering Pointer-Based Program Invariants - Ernst, Griswold, Kataoka.. (1999)
(Correct)
16.6%: Dynamically Discovering Likely Program Invariants - Ernst (2000)
(Correct)
6.6%: Quickly Detecting Relevant Program Invariants - Ernst, Czeisler, Griswold.. (1999)
(Correct)
Active bibliography (related documents): More All
0.7: Dynamically Discovering Likely Program Invariants to .. - Ernst, Cockrell.. (2000)
(Correct)
0.4: Automatic Generation and Checking of Program Specifications - Nimmer (2001)
(Correct)
0.3: Automatic Generation of Program Specifications - Nimmer, Ernst (2002)
(Correct)
Similar documents based on text: More All
0.3: Verifying Distributed Algorithms via Dynamic Analysis and.. - Win, Ernst (2002)
(Correct)
0.3: Exploiting Synergy Between Testing and Inferred Partial.. - Xie, Notkin (2003)
(Correct)
0.3: Automatic Generation of Invariants in Processor Verification - Su, Dill, Barrett (1996)
(Correct)
BibTeX entry: (Update)
M. D. Ernst, W. G. Griswold, Y. Kataoka, and D. Notkin. Dynamically discovering program invariants involving collections. TR UW-CSE-99-11-02, University of Washington, 2000. revised version of March 17, 2000. http://citeseer.ist.psu.edu/article/ernst00dynamically.html More
@misc{ ernst00dynamically,
author = "M. Ernst and W. Griswold and Y. Kataoka and D. Notkin",
title = "Dynamically discovering program invariants involving collections",
text = "M. D. Ernst, W. G. Griswold, Y. Kataoka, and D. Notkin. Dynamically discovering
program invariants involving collections. TR UW-CSE-99-11-02, University
of Washington, 2000. revised version of March 17, 2000.",
year = "2000",
url = "citeseer.ist.psu.edu/article/ernst00dynamically.html" }
Citations (may not include all citations):
252
Analysis of pointers and structures (context) - Chase, Wegman et al. - 1990
207
Flow analysis and optimization of Lisp-like structures (context) - Jones, Muchnick - 1981
175
A safe approximate algorithm for interprocedural pointer ali..
- Landi, Ryder - 1992
171
Dynamically discovering likely program invariants to support..
- Ernst, Cockrell et al. - 1999
150
Parametric shape analysis via 3-valued logic
- Sagiv, Reps et al. - 1999
146
Parallelizing programs with recursive data structures (context) - Hendren, Nicolau - 1990
141
Compaq Systems Research Center (context) - Detlefs, Rustan et al. - 1998
132
Detecting conflicts between structure accesses (context) - Larus, Hilfinger - 1988
99
A shape analysis for heap-directed pointers in C (context) - Ghiya, Hendren et al. - 1996
92
A flexible approach to interprocedural data flow analysis an.. (context) - Jones, Muchnick - 1982
88
Static detection of dynamic memory errors
- Evans - 1996
84
Data flow analysis for verifying properties of concurrent pr..
- Dwyer, Clarke - 1994
79
Abstractions for recursive pointer data structures: Improvin..
- Hendren, Hummel et al. - 1992
70
Points-to analysis in almost linear time
- Steensgaard - 1996
68
Interprocedural data flow analysis in the presence of pointe..
- Weihl - 1980
63
LCLint: A tool for using specifications to check code
- Evans, Guttag et al. - 1994
62
Program Analysis and Specialization for the C Programming La.. (context) - Andersen - 1994
56
An overview of the Extended Static Checking system
- Detlefs - 1996
55
Quickly detecting relevant program invariants
- Ernst, Czeisler et al. - 2000
49
Reasoning about Java classes
- Jacobs, van den Berg et al. - 1998
39
An empirical analysis of instruction repetition (context) - Sodani, Sohi - 1998
39
The effects of precision on pointer analysis
- Shapiro, Horwitz - 1997
35
Value profiling and optimization
- Calder, Feller et al.
35
Lackwit: A program understanding tool based on type inferenc..
- O'Callahan, Jackson - 1997
33
Speculative disambiguation: A compilation technique for dyna.. (context) - Huang, Slavenburg et al. - 1994
26
An extended static checker for Modula (context) - Rustan, Leino et al. - 1998
24
Dependent types in logic programming (context) - Pfenning - 1992
23
The concept of dynamic analysis
- Ball - 1999
22
Data Structures and Algorithm Analysis in Java (context) - Weiss - 1999
17
Assessing the effects of flow-sensitivity on pointer alias a..
- Hind, Pioli - 1998
16
Verification of concurrent software with FLAVERS (context) - Naumovich, Clarke et al. - 1997
15
Run-time disambiguation: Coping with statically unpredictabl.. (context) - Nicolau - 1989
15
A practical context-sensitive interprocedural alias analysis.. (context) - Hendren, Emami et al. - 1993
14
Formal specification techniques for promoting software modul.. (context) - Tan - 1994
11
and Alan Eustace (context) - Calder, Feller - 1997
10
A study of pointer aliasing for software pipelining using ru.. (context) - Su, Habib et al. - 1994
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC