See this document in CiteSeerX!

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



  Home/Search   Context   Related

 
View or download:
microsoft.com/esp/pu...espdataflow.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  microsoft.com/manuvir/Docs/pub (more)
(Enter author homepages)

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

Abstract: In this paper, we present a new algorithm for 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 propertyrelated behaviour of the program differs along the arms of the branch, we can design an algorithm that is accurate enough for verification without paying the exponential cost of full path-sensitive... (Update)

Similar documents based on text:   More   All
0.7:   ESP: Path-Sensitive Program Verification in Polynomial Time - Das, Lerner, Seigle (2002)   (Correct)
0.5:   Speeding UpDa263 wAna13E Using Flow-Insensitive.. - Thomc Ball Manuvir   (Correct)
0.2:   Composing Dataflow Analyses and Transformations - Lerner, Grove, Chambers (2001)   (Correct)

BibTeX entry:   (Update)

Manuvir Das, Sorin Lerner, and Mark Seigle. Path-sensitive program verification in polynomial time. In Proceedings of the ACM SIGPLAN 2002. http://citeseer.ist.psu.edu/das02pathsensitive.html   More

@misc{ das02pathsensitive,
  author = "M. Das and S. Lerner and M. Seigle",
  title = "Path-sensitive program verification in polynomial time",
  text = "Manuvir Das, Sorin Lerner, and Mark Seigle. Path-sensitive program verification
    in polynomial time. In Proceedings of the ACM SIGPLAN 2002.",
  year = "2002",
  url = "citeseer.ist.psu.edu/das02pathsensitive.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
138   Enforcing high-level pro- tocols in low-level software - Deline, hndrich - 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
59   A static analyzer for finding dynamic programming errors - Bush, Pincus et al. - 2000
51   annotation assistant escjava (context) - Flanagan, an et al. - 2001
51   Extended static checking - Detlefs, Leino et al. - 1998
33   Mining specifications - Ammons, Bodik et al. - 2002
33   Improving data-flow analysis with path profiles - Ammons, Larus - 1998
28   and Martin Rinard (context) - Kuncak, Lam
20   Estimating the Impact of Scalable Pointer Analysis on Optimi.. - Das, Liblit et al. - 2001

[Article contains additional citations not shown here]



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


Documents on the same site (http://research.microsoft.com/manuvir/Docs/pub.html):
Scalable Context-Sensitive Flow Analysis Using.. - Fähndrich, Rehof, Das (2000)   (Correct)
BTA Termination Using CFL-Reachability - Das, Reps (1996)   (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