See this document in CiteSeerX!

A Semantics for Procedure Local Heaps  (Make Corrections)  
and its Abstractions Noam Rinetzky Jorg Bauer + Thomas Reps Mooly Sagiv...



  Home/Search   Context   Related

 
View or download:
wisc.edu/wpis/paper...popl05_asfplh.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  wisc.edu/wpis/papers/ (more)
(Enter author homepages)

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

Abstract: The goal of this work is to develop compile-time algorithms for automatically verifying properties of imperative programs that manipulate dynamically allocated storage. The paper presents an analysis method that uses a characterization of a procedure's behavior in which parts of the heap not relevant to the procedure are ignored. The paper has two main parts: The first part introduces a non-standard concrete semantics, in which called procedures are only passed parts of the heap. In this... (Update)

Active bibliography (related documents):   More   All
0.3:   Boolean Algebra of Shape Analysis Constraints - Kuncak, Rinard (2004)   (Correct)
0.3:   Safety and Liveness in Concurrent Pointer Programs - Distefano, Katoen, Rensink   (Correct)
0.3:   Implications of a Data Structure Consistency Checking System - Kuncak, Lam, Zee, Rinard (2005)   (Correct)

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

BibTeX entry:   (Update)

@misc{ ions-semantics,
  author = "And Its Ions",
  title = "A Semantics for Procedure Local Heaps",
  url = "citeseer.ist.psu.edu/762690.html" }
Citations (may not include all citations):
312   Systematic design of program analysis frameworks (context) - Cousot, Cousot - 1979
283   A relational model of data for large shared data banks (context) - Codd - 1970
233   Natural semantics (context) - Kahn - 1987
181   Principles of Program Analysis (context) - Nielson, Nielson et al. - 1999
131   Interprocedural may-alias analysis for pointers: Beyond k-li.. - Deutsch - 1994
111   Separation logic: a logic for shared mutable data structures - Reynolds - 2002
110   BI as an assertion language for mutable data structures - Ishtiaq, O'Hearn - 2001
63   A storeless model for aliasing and its abstractions using fi.. (context) - Deutsch - 1992
17   Putting static analysis to work for verification: A case stu.. (context) - Lev-Ami, Reps et al. - 2000
15   Operational Models of Programming Languages and Representati.. (context) - Deutsch - 1992
9   Storeless semantics and alias logic (context) - Bozga, Iosif et al. - 2003
8   Abstract storage structures (context) - Jonkers - 1981
5   Static analysis of accessed regions in recursive data struct.. (context) - Chong, Rugina - 2003
4   A relational approach to interprocedural shape analysis - Jeannet, Loginov et al. - 2004
4   A safe approximate algorithm for interprocedural aliasing (context) - Landi, Ryder - 1992
4   Technion Israel Institute of Technology (context) - Rinetzky, analysis - 2001
1   http://www.avacs.org (context) - Rinetzky, Bauer et al. - 2004

Documents on the same site (http://www.cs.wisc.edu/wpis/papers/):   More
Program Generalization for Software Reuse: From C to C++ - Siff, Reps (1996)   (Correct)
Modular Pointer Analysis - Susan Horwitz And   (Correct)
Weighted Pushdown Systems and Weighted Transducers - Lal, Touili, Kidd, Reps   (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