See this document in CiteSeerX!

Interprocedural Shape Analysis with Separated Heap Abstractions  (Make Corrections)  
Alexey Gotsman, Josh Berdine, Byron Cook



  Home/Search   Context   Related

 
View or download:
foment.net/byron/papers...interproc.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  microsoft.com/~bycook/papers (more)
(Enter author homepages)

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

Abstract: We describe an interprocedural shape analysis that makes use of spatial locality (i.e. the fact that most procedures modify only a small subset of the heap) in its representation of abstract states. Instead of tracking reachability information directly and aliasing information indirectly, our representation tracks reachability indirectly and aliasing directly. Computing the e#ect of procedure calls and returns on an abstract state is easy because the representation exhibits spatial... (Update)

Active bibliography (related documents):   More   All
0.7:   A Local Shape Analysis based on Separation Logic - Distefano, O'Hearn, Yang (2006)   (Correct)
0.6:   An Overview of the Jahob Analysis System - Project Goals and.. - Kuncak, Rinard   (Correct)
0.5:   Symbolic Execution with Separation Logic - Berdine, Calcagno, O'Hearn (2005)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ gotsman-interprocedural,
  author = "Alexey Gotsman and Josh Berdine and Byron Cook",
  title = "Interprocedural Shape Analysis with Separated Heap Abstractions",
  url = "citeseer.ist.psu.edu/753458.html" }
Citations (may not include all citations):
129   Precise interprocedural dataflow analysis via graph reachabi.. - Reps, Horwitz et al. - 1995
111   Separation logic: A logic for shared mutable data structures - Reynolds - 2002
58   Local reasoning about programs that alter data structures (context) - O'Hearn, Reynolds et al. - 2001
24   Procedures and parameters: An axiomatic approach (context) - Hoare - 1971
13   Information flow analysis in logical form - Amtoft, Banerjee - 2004
9   Soundness and completeness of an axiomatic system for progra.. (context) - Cook - 1978
7   A decidable fragment of separation logic - Berdine, Calcagno et al. - 2004
6   Symbolic execution with separation logic - Berdine, Calcagno et al. - 2005
6   Region-based shape analysis with tracked locations (context) - Hackett, Rugina - 2005
5   A local shape analysis based on separation logic - Distefano, O'Hearn et al. - 2006
4   Automatic verification of pointer programs using grammar-bas.. (context) - Lee, Yang et al. - 2005
3   A semantics for procedure local heaps and its abstractions (context) - Rinetzky, Bauer et al. - 2005
2   Interprocedural functional shape analysis using local heaps (context) - Rinetzky, Sagiv et al. - 2004
2   Automatic termination proofs for programs with shape-shiftin.. - Berdine, Cook et al. - 2006

Documents on the same site (http://research.microsoft.com/~bycook/papers.htm):   More
Cogent: Accurate theorem proving for program verification - Cook, Kroening, Sharygina (2005)   (Correct)
Refining Approximations in Software Predicate Abstraction - Ball, Cook, Das, Rajamani (2004)   (Correct)
Using Stålmarck's algorithm to prove inequalities - Cook, Gonthier   (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