Thomas Wies, Viktor Kuncak, Patrick Lam, Andreas Podelski, Martin Rinard  Home/Search
Context Related
| mit.edu/~vkuncak/p...straintAnalysis.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 From: mit.edu/~vkuncak/papers/index (more) Homepages: V.Kuncak |
Rate this article:      (best)Comment on this article |
Abstract: We introduce field constraint analysis, a new technique for verifying data structure invariants. A field constraint for a field is a formula specifying a set of objects to which the field can point. Field constraints enable the application of decidable logics to data structures which were originally beyond the scope of these logics, by verifying the backbone of the data structure and then verifying constraints on fields that cross-cut the backbone in arbitrary ways. Previously, such... (Update)
Cited by: More
A Better Logic and Decision Procedure for Predicate.. - Rakamaric, Bingham, Hu (2006) (Correct)
An Overview of the Jahob Analysis System - Project Goals and.. - Kuncak, Rinard (Correct)
Active bibliography (related documents): More All
1.4: On Decision Procedures for Set-Valued Fields - Kuncak, Rinard (2004) (Correct)
1.2: Implications of a Data Structure Consistency Checking System - Kuncak, Lam, Zee, Rinard (2005) (Correct)
1.0: A Logic and Decision Procedure for Predicate Abstraction of .. - Bingham, Rakamaric (2005) (Correct)
Similar documents based on text:
6.0: Unknown - (Correct)
Related documents from co-citation: More All
3: A logic and decision procedure for predicate abstraction of heapmanipulating pro.. - Bingham, Rakamaric - 2005
2: Predicate abstraction for software verification (context) - Flanagan, Qadeer - 2002
2: A decidable logic for pointer programs manipulating linked lists (context) - Ranise, Zarba - 2005
BibTeX entry: (Update)
T. Wies, V. Kuncak, P. Lam, A. Podelski, and M. Rinard. Field constraint analysis. In Proc. Int. Conf. Verification, Model Checking, and Abstract Interpratation, 2006. http://citeseer.ist.psu.edu/wies06field.html More
@inproceedings{ wies06field,
author = "T. Wies and V. Kuncak and P. Lam and A. Podelski and M. Rinard",
title = "On field constraint analysis",
booktitle = "Proc. Int. Conf. Verification, Model Checking, and Abstract
Interpretation, 2006.",
year = "2006",
url = "citeseer.ist.psu.edu/wies06field.html" }
Citations (may not include all citations):312 Systematic design of program analysis frameworks (context) - Cousot, Cousot - 1979
182 Skip lists: A probabilistic alternative to balanced trees - Pugh - 1990
150 Parametric shape analysis via 3-valued logic - Sagiv, Reps et al. - 2002
110 Descriptive Complexity (context) - Immerman - 1998
88 Lazy abstraction - Henzinger, Jhala et al. - 2002
69 IsabelleHOL Proof Assistant Higher Order Logic (context) - Paulson, HOL et al. - 2002
68 Program Flow Analysis: Theory and Applications (context) - Muchnick, Jones - 1981
46 Graph types - Klarlund, Schwartzbach - 1993
36 Automatic verification of pointer programs using monadic sec.. - Jensen, Jrgensen et al. - 1997
35 MONA implementation secrets - Klarlund, Mller et al. - 2000
35 Role analysis - Kuncak, Lam et al. - 2002
34 The Pointer Assertion Logic Engine (context) - Mller, Schwartzbach - 2001
23 or a cyclic graph (context) - Ghiya, Hendren et al. - 1996
20 Verifying reachability invariants of linked structures (context) - Nelson - 1983
20 Refinement Calculus (context) - Back, von Wright - 1998
18 Symbolically computing most-precise abstract operations for .. (context) - Yorsh, Reps et al. - 2004
17 Putting static analysis to work for verification: A case stu.. (context) - Lev-Ami, Reps et al. - 2000
16 Logical characterizations of heap abstractions (context) - Yorsh, Reps et al. - 2005
15 Boolean algebra of shape analysis constraints - Kuncak, Rinard - 2004
10 Finite differencing of logical formulas for static analysis - Reps, Sagiv et al. - 2003
10 Shape analysis through predicate abstraction and model check.. - Dams, Namjoshi - 2003
7 Shape analysis by predicate abstraction (context) - Balaban, Pnueli et al. - 2005
7 On our experience with modular pluggable analyses - Lam, Kuncak et al. - 2004
7 The boundary between decidability and undecidability for tra.. - Immerman, Rabinovich et al. - 2004
7 Generalized typestate checking for data structure consistenc.. (context) - Lam, Kuncak et al. - 2005
5 Shape types (context) - Fradet, Metayer - 1997
5 The Hob project web page (context) - Lam, Kuncak et al. - 2004
4 Data structure specifications via local equality axioms (context) - McPeak, Necula - 2005
4 Verifying properties of well-founded linked lists (context) - Lahiri, Qadeer - 2006
4 Automatic verification of pointer programs using grammar-bas.. (context) - Lee, Yang et al. - 2005
3 Hob: A tool for verifying data structure consistency - Lam, Kuncak et al. - 2005
3 Verification via structure simulation - Immerman, Rabinovich et al. - 2004
3 Simulating reachability using first-order logic with applica.. (context) - Lev-Ami, Immerman et al. - 2005
2 Universitat des Saarlandes (context) - Wies, analysis - 2004
2 Decision procedures for set-valued fields - Kuncak, Rinard - 2005
2 Decidable fragments of first-order and fixed-point logic (context) - Gradel - 2003
2 Boolean heaps (context) - Podelski, Wies - 2005
1 Implications of a data structure consistency checking system - Kuncak, Lam et al. - 2005
Documents on the same site (http://www.mit.edu/~vkuncak/papers/index.html): More
Combining Theorem Proving with Static Analysis for Data.. - Zee, Lam, Kuncak, Rinard (2004) (Correct)
On Role Logic - Kuncak, Rinard (2003) (Correct)
Roles Are Really Great! - Kuncak, Lam, Rinard (2001) (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