N. Immerman, A. Rabinovich, T. Reps, M. Sagiv, G. Yorsh  Home/Search
Context Related
| cs.tau.ac.il/~msag...on_cav04_final.pdf Cached: 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.
PS.gz PS Image Update HelpFrom: cs.tau.ac.il/~msagiv/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Interpretation The abstract-interpretation technique [2] allows conservative automatic verification of partial correctness to be conducted by identifying sound over-approximations to loop invariants. An iterative computation is carried out to determine an appropriate abstract value for each program point. The result at each program point is an abstract value that summarizes the sets of reachable concrete states at that point. (Update)
Cited by: More
Simulating Reachability using First-Order Logic - With Applications To (Correct)
On Field Constraint Analysis - Wies, Kuncak, Lam, Podelski, Rinard (2006) (Correct)
The Boundary between Decidability and.. - Immerman.. (2004) (Correct)
Active bibliography (related documents): More All
0.6: Verification via Structure Simulation - Immerman, Rabinovich, Reps.. (2004) (Correct)
0.1: Boolean Algebra of Shape Analysis Constraints - Kuncak, Rinard (2004) (Correct)
0.1: Program Verification with Monadic Second-Order Logic & Languages.. - Møller (2002) (Correct)
Similar documents based on text: More All
0.2: Parametric Shape Analysis via 3-Valued Logic - Sagiv, Reps, Wilhelm (1999) (Correct)
0.2: Solving Shape-Analysis Problems in Languages with.. - Sagiv, Reps, Wilhelm (1996) (Correct)
0.2: Interprocedural DataflowAnalysis via Graph Reachability - Reps, Sagiv, Horwitz (1994) (Correct)
Related documents from co-citation: More All
3: Parametric shape analysis via 3valued logic - Sagiv, Reps et al. - 1999
2: The pointer assertion logic engine (context) - Moeller, Schwartzbach - 2001
2: Descriptive Complexity (context) - Immerman
BibTeX entry: (Update)
N. Immerman, A. Rabinovich, T. Reps, M. Sagiv, and G. Yorsh. Verification via structure simulation. To appear in CAV'04, 2004. http://citeseer.ist.psu.edu/article/immerman04verification.html More
@misc{ immerman04verification,
author = "N. Immerman and A. Rabinovich and T. Reps and M. Sagiv and G. Yorsh",
title = "Verification via structure simulation",
text = "N. Immerman, A. Rabinovich, T. Reps, M. Sagiv, and G. Yorsh. Verification
via structure simulation. To appear in CAV'04, 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/article/immerman04verification.html" }
Citations (may not include all citations):312 Systematic design of program analysis frameworks (context) - Cousot, Cousot - 1979 ACM DBLP
265 Proof of correctness of data representations (context) - Hoare - 1972 ACM DBLP
241 Decidability of second-order theories and automata on infini.. (context) - Rabin - 1969
200 Solving shape-analysis problems in languages with destructiv.. - Sagiv, Reps et al. - 1998 ACM DBLP
146 Parallelizing Programs with Recursive Data Structures (context) - Hendren - 1990 ACM DBLP
110 Descriptive Complexity (context) - Immerman - 1999
76 Mona: Monadic second-order logic in practice - Henriksen, Jensen et al. - 1995 DBLP
40 A decidable logic for describing linked data structures - Benedikt, Reps et al. - 1999 ACM DBLP
34 The pointer assertion logic engine (context) - Mller, Schwartzbach - 2001 ACM DBLP
26 Recursive data structures (context) - Hoare - 1975
21 Compile-time debugging of C programs working on trees - Elgaard, Mller et al. - 2000 ACM DBLP
18 Symbolically computing most-precise abstract operations for .. (context) - Yorsh, Reps et al. - 2004 DBLP
17 Symbolic implementation of the best transformer - Reps, Sagiv et al. - 2004 DBLP
3 The boundery between decidability and undecidability of tran.. (context) - Immerman, Rabinovich et al. - 2004
Documents on the same site (http://www.cs.tau.ac.il/~msagiv/):
Partially Disjunctive Heap Abstraction - Manevich, Sagiv, Ramalingam, Field (2004) (Correct)
The Boundary between Decidability and.. - Immerman.. (2004) (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