See this document in CiteSeerX!

Path Sensitive Program Analysis Using Boolean Satisfiability (2003)  (Make Corrections)  
Yichen Xie, Andy Chou



  Home/Search   Context   Related

 
View or download:
stanford.edu/~acc/pldi2003.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  stanford.edu/~acc/publications (more)
(Enter author homepages)

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

Abstract: Recent advances in boolean satisfiability (SAT) solvers have made it possible to solve structured formulas on the order of a million variables. In this work we show how to e#ciently transform program analysis problems directly into SAT instances. The translation is similar to generating verification conditions, but we avoid exponential growth by introducing temporary variables in place of using substitution. Unlike most approaches based on general purpose theorem provers, our transformation... (Update)

Active bibliography (related documents):   More   All
0.1:   ARCHER: Using Symbolic, Path-sensitive Analysis to Detect.. - Xie, Chou, Engler (2003)   (Correct)
0.1:   Correlation Exploitation in Error Ranking - Kremenek, Ashcraft, Yang, Engler (2004)   (Correct)
0.1:   Code Inection in C and CPP: A Survey of Vulnerabilities.. - Younan, Joosen, Piessens (2004)   (Correct)

Similar documents based on text:   More   All
0.3:   Generating Abstractors from Abstraction Functions - Huang, Lamb (1992)   (Correct)
0.2:   Solving Difficult SAT Instances in the Presence of Symmetry - Aloul, Ramani, Markov.. (2002)   (Correct)
0.1:   Algorithms for Satisfiability in Combinational Circuits.. - Marques-Silva, Silva (1999)   (Correct)

BibTeX entry:   (Update)

@misc{ xie-path,
  author = "Yichen Xie and Andy Chou",
  title = "Path Sensitive Program Analysis Using Boolean Satisfiability",
  url = "citeseer.ist.psu.edu/563684.html" }
Citations (may not include all citations):
828   Model Checking - Clarke, Grumberg et al. - 1999
259   A survey of program slicing techniques - Tip - 1995
244   Symbolic model checking without bdds - Biere, Cimatti et al. - 1999
129   Precise interprocedural dataflow analysis via graph reachabi.. - Reps, Horowitz et al. - 1995
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   Lazy abstraction - Henzinger, Jhala et al. - 2002
69   cient sat solver (context) - Moskewicz, Madigan et al. - 2001
67   CCured: type-safe retrofitting of legacy code - Necula, McPeak et al. - 2002
59   A static analyzer for finding dynamic programming errors - Bush, Pincus et al. - 2000
51   Extended static checking - Detlefs, Leino et al. - 1998
47   A system and language for building system-specific (context) - Hallem, Chelf et al. - 2002
46   Using programmer-written compiler extensions to catch securi.. - Ashcraft, Engler - 2002
36   Finding bugs with a constraint solver (context) - Jackson, Vaziri - 2000
31   A first step towards automated detection of bu#er overrun vu.. (context) - Wagner, Foster et al. - 2000
31   Automating first-order relational logic - Jackson - 2000
27   Cleanness checking of string manipulations in c programs via.. - Dor, Rodeh et al. - 2001
26   Avoiding exponential explosion: Generating compact verificat.. (context) - Flanagan, Saxe - 2001
22   cient detection of all pointer and array access errors (context) - Austin, Breach et al. - 1994
13   ective use of boolean satisfiability procedures in the forma.. (context) - Velev, Bryant - 2002
13   Bounded model checking using satisfiability solving - Clarke, Biere et al. - 2001
11   Path-sensitive program verification in polynomial time - Das, Lerner et al. - 2002
1   ciently computing static single assignment from and the cont.. (context) - Cytron, Ferrante et al. - 1991

Documents on the same site (http://www.stanford.edu/~acc/publications.html):   More
Bugs as Deviant Behavior: A General Approach to.. - Engler, Chen.. (2001)   (Correct)
An Empirical Study of Operating Systems Errors - Chou, Yang, Chelf, Hallem.. (2001)   (Correct)
A Simple Method for Extracting Models from Protocol Code - Lie, Chou, Engler, Dill (2001)   (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