See this document in CiteSeerX!

ESP: Path-Sensitive Program Verification in Polynomial Time (2002)  (Make Corrections)  (51 citations)
Manuvir Das, Sorin Lerner, Mark Seigle



  Home/Search   Context   Related

 
View or download:
mit.edu/readinggroup/esppldi02.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  mit.edu/readinggroup/summer02 (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In this paper, we present a new algorithm for partial program verification that runs in polynomial time and space. We are interested in checking that a program satisfies a given temporal safety property. Our insight is that by accurately modeling only those branches in a program for which the property-related behavior di#ers along the arms of the branch, we can design an algorithm that is accurate enough to verify the program with respect to the given property, without paying the potentially... (Update)

Cited by:   More
A Next-Generation Platform for Analyzing Executables - Reps Balakrishnan Lim   (Correct)
Intermediate-Representation Recovery from Low-Level Code - Thomas Reps Gogul   (Correct)
WYSINWYX: What You See Is Not What You eXecute - Balakrishnan Reps Melski   (Correct)

Active bibliography (related documents):   More   All
0.8:   Path-Sensitive Program Verification in Polynomial Time - Das, Lerner, Seigle (2002)   (Correct)
0.2:   Expansion-based Removal of Semantic Partial Redundancies - Knoop, Rüthing, Steffen (1999)   (Correct)
0.2:   Loop Quasi-Invariance Code Motion - Song, FUTAMURA, GLÜCK, HU   (Correct)

Similar documents based on text:   More   All
0.3:   Speeding UpDa263 wAna13E Using Flow-Insensitive.. - Thomc Ball Manuvir   (Correct)
0.3:   Composing Dataflow Analyses and Transformations - Lerner, Grove, Chambers (2001)   (Correct)
0.3:   BTA Termination Using CFL-Reachability - Das, Reps (1996)   (Correct)

Related documents from co-citation:   More   All
24:   Enforcing high-level protocols in low-level software - ahndrich, DeLine - 2001
21:   Checking system rules using system-specific (context) - Engler, Chelf et al. - 2000
20:   Extended static checking for Java - Flanagan, Leino et al. - 2002

BibTeX entry:   (Update)

Manuvir Das, Sorin Lerner, and Mark Seigle. Esp: Pathsensitive program verification in polynomial time. In 2002. http://citeseer.ist.psu.edu/das02esp.html   More

@misc{ das02esp,
  author = "M. Das and S. Lerner and M. Seigle",
  title = "Esp: Pathsensitive program verification in polynomial time",
  text = "Manuvir Das, Sorin Lerner, and Mark Seigle. Esp: Pathsensitive program
    verification in polynomial time. In 2002.",
  year = "2002",
  url = "citeseer.ist.psu.edu/das02esp.html" }
Citations (may not include all citations):
815   Abstract interpretation: a unified lattice model for static .. (context) - Cousot, Cousot - 1977
650   An axiomatic basis for computer programming (context) - Hoare - 1989
154   Simplification by cooperating decision procedures (context) - Nelson, Oppen - 1979
140   Extended Static Checking for Java - Flanagan, Leino et al. - 2002
138   Enforcing high-level protocols in low-level software - Deline, Fahndrich - 2001
108   Automatically validating temporal safety properties of inter.. - Ball, Rajamani - 2001
100   Checking system rules using system-specific (context) - Engler, Chelf et al. - 2000
88   Static detection of dynamic memory errors - Evans - 1996
69   Unification-based pointer analysis with directional assignme.. - Das - 2000
67   Bugs as deviant behavior: A general approach to inferring er.. - Engler, Chen et al. - 2001
65   Typestate: A programming language concept for enhancing soft.. (context) - Strom, Yemini - 1986
59   A static analyzer for finding dynamic programming errors - Bush, Pincus et al. - 2000
51   annotation assistant escjava (context) - Leino, annotation et al. - 2001
51   ESP: Path-Sensitive Program Verification in Polynomial Time - Das, Lerner et al. - 2002
47   A system and language for building system-specific (context) - Hallem, Chelf et al. - 2002
46   Flow-Sensitive Type Qualifiers - Aiken, Foster et al. - 2002
45   Gated SSA-based demand-driven symbolic analysis for parallel.. - Tu, Padua - 1995
44   cient context-sensitive pointer analysis for C programs (context) - Wilson, Lam - 1995
35   Role analysis - Kuncak, Lam et al. - 2002
33   Mining specifications - Ammons, Bodik et al. - 2002
33   Improving data-flow analysis with path profiles - Ammons, Larus - 1998
22   Precise interprocedural data ow analysis via graph reachabil.. (context) - Reps, Horwitz et al. - 1995
20   Estimating the Impact of Scalable Pointer Analysis on Optimi.. - Das, Liblit et al. - 2001
12   Path-sensitive value-flow analysis - Bodik, Anik - 1998
5   Property-oriented expansion (context) - Ste - 1996
2   Qualified dataflow analysis (context) - Holley, Rosen - 1980
1   Expansion-based removal of semantic partial redundancies - Knoop, Ruthing et al. - 1999



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://pag.lcs.mit.edu/reading-group/summer02.html):
The Embedded Machine: - Predictable Portable Real-Time   (Correct)
Alias Annotations for Program Understanding - Aldrich, Kostadinov, Chambers (2002)   (Correct)

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