(Enter summary)
Abstract: One of the continuing challenges in abstract interpretation is the creation
of abstractions that yield analyses that are both tractable and precise enough
to prove interesting properties about real-world programs. One source of difficulty
is the need to handle programs with different behaviors along different execution
paths. Disjunctive (powerset) abstractions capture such distinctions in a
natural way. However, in general, powerset abstractions increase space and time
costs by an... (Update)
Cited by: More
Automated Verification of the Deutsch-Schorr-Waite - Tree-Traversal Algorithm Alexey
(Correct)
A Framework for Numeric Analysis of Array Operations - Denis Gopan Gopan
(Correct)
On Spatial Conjunction as Second-Order Logic - Kuncak, Rinard (2004)
(Correct)
Similar documents (at the sentence level):
5.3%: Partially Disjunctive Heap Abstraction - Manevich, Sagiv, Ramalingam, Field (2004)
(Correct)
Active bibliography (related documents): More All
0.2: Data Structures and Algorithms for Efficient Shape Analysis - Manevich (2003)
(Correct)
0.2: Compactly Representing First-Order Structures for.. - Manevich.. (2002)
(Correct)
0.2: Solving Shape-Analysis Problems in Languages with.. - Sagiv, Reps, Wilhelm (1996)
(Correct)
Similar documents based on text: More All
0.4: Predicate Abstraction and Canonical Abstraction - For Singly-Linked Lists
(Correct)
0.2: PSE: Explaining Program Failures via Postmortem.. - Manevich, Sridharan, .. (2004)
(Correct)
0.2: Proceedings of the MSPLS Spring '98 Workshop - Baumgartner, Läufer (1998)
(Correct)
Related documents from co-citation: More All
4: Parametric shape analysis via 3valued logic
- Sagiv, Reps et al. - 1999
2: BI as an assertion language for mutable data structures
- Ishtiaq, O'Hearn - 2000
2: Separation logic: a logic for shared mutable data structures
- Reynolds - 2002
BibTeX entry: (Update)
R. Manevich, M. Sagiv, G. Ramalingam, and J. Field. Partially disjunctive heap abstraction. In R. Giacobazzi, editor, Proceedings of the 11th International Symposium, SAS 2004, volume 3148 of Lecture Notes in Computer Science, pages 265--279. Springer, aug 2004. Available at http://www.cs.tau.ac.il/#rumster/sas04.pdf. http://citeseer.ist.psu.edu/article/manevich04partially.html More
@misc{ manevich04partially,
author = "R. Manevich and M. Sagiv and G. Ramalingam and J. Field",
title = "Partially disjunctive heap abstraction",
text = "R. Manevich, M. Sagiv, G. Ramalingam, and J. Field. Partially disjunctive
heap abstraction. In R. Giacobazzi, editor, Proceedings of the 11th International
Symposium, SAS 2004, volume 3148 of Lecture Notes in Computer Science, pages
265--279. Springer, aug 2004. Available at http://www.cs.tau.ac.il/#rumster/sas04.pdf.",
year = "2004",
url = "citeseer.ist.psu.edu/article/manevich04partially.html" }
Citations (may not include all citations):
815
Abstract interpretation: A unified lattice model for static .. (context) - Cousot, Cousot - 1977
252
Analysis of pointers and structures (context) - Chase, Wegman et al. - 1990
207
Flow analysis and optimization of Lisp-like structures (context) - Jones, Muchnick - 1981
200
Solving shape-analysis problems in languages with destructiv..
- Sagiv, Reps et al. - 1998
150
Parametric shape analysis via 3-valued logic
- Sagiv, Reps et al. - 2002
132
Detecting conflicts between structure accesses (context) - Larus, Hilfinger - 1988
131
Interprocedural may-alias analysis for pointers: Beyond k-li..
- Deutsch - 1994
51
Esp: Path-sensitive program verification in polynomial time
- Das, Lerner et al. - 2002
26
Restructuring Symbolic Programs for Concurrent Execution on .. (context) - Larus - 1989
23
Soot - a java optimization framework (context) - ee-Rai, Hendren et al. - 1999
20
Deriving specialized program analyses for certifying compone..
- Ramalingam, Warshavsky et al. - 2002
19
A lattice for abstract interpretation of dynamic (context) - Stransky - 1992
10
Automated verification of concurrent linked lists with count.. (context) - Yavuz-Kahveci, Bultan - 2002
9
Scanning list structures without stacks or tag bits (context) - Lindstrom - 1973
9
Verifying safety properties using separation and heterogeneo.. (context) - Yahav, Ramalingam - 2004
7
Optimal domains for disjunctive abstract interpretation (context) - Giacobazzi, Ranzato - 1998
7
Widening operators for powerset domains
- Bagnara, Hill et al. - 2003
5
University of Washington and Microsoft Research Summer Insti.. (context) - Reps, Sagiv et al. - 2001
3
TVLA: A framework for implementing static analyses (context) - Lev-Ami, Sagiv - 2000
Documents on the same site (http://www.research.ibm.com/people/r/rama/publications.html): More
Deriving Specialized Program Analyses for.. - Ramalingam.. (2002)
(Correct)
A Member Lookup Algorithm for C++ - Ramalingam And Harini (1997)
(Correct)
Compactly Representing First-Order Structures for.. - Manevich.. (2002)
(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