Michael Benedikt, Thomas Reps, Mooly Sagiv  Home/Search
Context Related
Links: ACM DBLP | wisc.edu/wpis/papers/esop99.ps math.tau.ac.il/~sagiv/esop99.ps belllabs.com/~benedikt/paper...esop.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF Problem Downloading? From: 128.105.7.11/wpis/html/ (more) From: math.tau.ac.il/~sagiv/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . This paper aims to provide a better formalism for describing properties of linked data structures (e.g., lists, trees, graphs), as well as the intermediate states that arise when such structures are destructively updated. The paper defines a new logic that is suitable for these purposes (called Lr , for "logic of reachability expressions"). We show that Lr is decidable, and explain how Lr relates to two previously defined structuredescription formalisms ("path matrices" and "static shape... (Update)
Cited by: More
Simulating Reachability using First-Order Logic - With Applications To (Correct)
Unknown - (Correct)
A Better Logic and Decision Procedure for Predicate.. - Rakamaric, Bingham, Hu (2006) (Correct)
Similar documents (at the sentence level):
55.6%: A Decidable Logic - For Describing Linked (Correct)
Active bibliography (related documents): More All
0.6: Parametric Shape Analysis via 3-Valued Logic - Sagiv, Reps, Wilhelm (1999) (Correct)
0.4: Checking Cleanness in Linked Lists - Dor, Rodeh, Sagiv (2000) (Correct)
0.3: Interprocedural Shape Analysis - Rinetzky (Correct)
Similar documents based on text: More All
0.4: Symbolic Implementation of the Best Transformer - Reps, Sagiv, Yorsh (2004) (Correct)
0.2: Solving Shape-Analysis Problems in Languages with.. - Sagiv, Reps, Wilhelm (1996) (Correct)
0.2: Proceedings of the MSPLS Spring '98 Workshop - Baumgartner, Läufer (1998) (Correct)
Related documents from co-citation: More All
16: Intuitionistic reasoning about shared mutable data structure - Reynolds - 2000
15: Solving shape-analysis problems in languages with destructive updating - Sagiv, Reps et al. - 1996
14: Parametric shape analysis via 3valued logic - Sagiv, Reps et al. - 1999
BibTeX entry: (Update)
Benedikt, M., Reps, T., and Sagiv, M. 1999. A decidable logic for describing linked data structures. In Proceedings of the 1999 European Symposium On Programming. 2--19. http://citeseer.ist.psu.edu/benedikt99decidable.html More
@inproceedings{ benedikt99decidable,
author = "Michael Benedikt and Thomas W. Reps and Shmuel Sagiv",
title = "A Decidable Logic for Describing Linked Data Structures",
booktitle = "European Symposium on Programming",
pages = "2-19",
year = "1999",
url = "citeseer.ist.psu.edu/benedikt99decidable.html" }
Citations (may not include all citations):252 Analysis of pointers and structures (context) - Chase, Wegman et al. - 1990 ACM DBLP
207 Flow analysis and optimization of Lisp-like structures (context) - Jones, Muchnick - 1981 ACM DBLP
200 Solving shape-analysis problems in languages with destructiv.. - Sagiv, Reps et al. - 1998 ACM DBLP
150 Parametric shape analysis via 3valued logic - Sagiv, Reps et al. - 1999
146 Parallelizing programs with recursive data structures (context) - Hendren, Nicolau - 1990 ACM DBLP
146 Parallelizing Programs with Recursive Data Structures (context) - Hendren - 1990 ACM DBLP
132 Detecting conflicts between structure accesses (context) - Larus, Hilfinger - 1988 ACM DBLP
131 Interprocedural may-alias analysis for pointers: Beyond k-li.. - Deutsch - 1994
104 Compiler-based prefetching for recursive data structures - Luk, Mowry - 1996 ACM DBLP
99 Dependence analysis for pointer variables (context) - Horwitz, Pfeiffer et al. - 1989 ACM DBLP
92 A flexible approach to interprocedural data flow analysis an.. (context) - Jones, Muchnick - 1982 ACM DBLP
79 Abstractions for recursive pointer data structures: Improvin.. - Hendren, Hummel et al. - 1992
72 Putting pointer analysis to work - Ghiya, Hendren - 1998 ACM DBLP
63 A storeless model for aliasing and its abstractions using fi.. (context) - Deutsch - 1992
51 Fast algorithms for solving path problems (context) - Tarjan - 1981 ACM DBLP
51 Connection analysis: A practical interprocedural heap analys.. - Ghiya, Hendren - 1995 DBLP
46 Graph types - Klarlund, Schwartzbach - 1993 ACM DBLP
39 A unified approach to path problems (context) - Tarjan - 1981 ACM DBLP
37 Shape types - Fradet, Le Metayer - 1997 ACM DBLP
36 Automatic verification of pointer programs using monadic sec.. - Jensen, Joergensen et al. - 1997 ACM DBLP
31 Analysis of dynamic structures for efficient parallel execut.. - Plevyak, Chien et al. - 1993 ACM DBLP
31 Generalized finite automata with an application to a decisio.. (context) - Thatcher, Wright - 1968
19 A lattice for abstract interpretation of dynamic (context) - Stransky - 1992
13 Interprocedural heap analysis for parallelizing imperative p.. (context) - Assmann, Weinhardt - 1993
11 Analysis of Recursive Types in an Imperative Language - Wang - 1994 ACM
4 The Classical Decision Problem (context) - Boerger, Graedel et al. - 1996
3 http://www.cs.wisc.edu/wpis/papers/parametric.ps (context) - Sagiv, Reps et al. - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://128.105.7.11/wpis/html/): More
Parametric Shape Analysis via 3-Valued Logic - Sagiv, Reps, Wilhelm (1999) (Correct)
Precise Interprocedural Dataflow Analysis with.. - Sagiv, Reps, Horwitz (1995) (Correct)
Interprocedural Path Profiling - Melski, Reps (1998) (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