Shuvendu K. Lahiri, Randal E. Bryant  Home/Search
Context Related
| cmu.edu/%7Eshuvendu/papers/cav04a.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: cmu.edu/~shuvendu/ (more) Homepages: S.Lahiri |
Rate this article:      (best)Comment on this article |
Abstract: Predicate abstraction has been proven effective for verifying several infinite-state systems. In predicate abstraction, an abstract system is automatically constructed given a set of predicates. Predicate abstraction coupled with automatic predicate discovery provides for a completely automatic verification scheme. For systems with unbounded integer state variables (e.g. software), counterexample guided predicate discovery has been successful in identifying the neccessay predicates. For... (Update)
Cited by: More
A Framework for Numeric Analysis of Array Operations - Denis Gopan Gopan (Correct)
An Overview of the Jahob Analysis System - Project Goals and.. - Kuncak, Rinard (Correct)
Active bibliography (related documents): More All
2.6: Indexed Predicate Discovery for Unbounded System Verification - Lahiri, Bryant (2004) (Correct)
0.7: Constructing Quantified Invariants via Predicate Abstraction - Lahiri, Bryant (2004) (Correct)
0.3: Counterexample Guided Abstraction Refinement via Program.. - Kroening, Groce, Clarke (2004) (Correct)
Similar documents based on text: More All
1.6: Cv - Lahiri (Correct)
0.6: Deductive Verification of Advanced Out-of-Order Microprocessors - Lahiri, Bryant (2003) (Correct)
0.5: A Symbolic Approach to Predicate Abstraction - Lahiri, Bryant, Cook (2003) (Correct)
Related documents from co-citation: More All
2: Predicate abstraction for software verification (context) - Flanagan, Qadeer - 2002
2: Symbolically computing mostprecise abstract operations for shape analysis (context) - Yorsh, Reps et al. - 2003
2: Parametric shape analysis via 3valued logic - Sagiv, Reps et al. - 1999
BibTeX entry: (Update)
S. K. Lahiri and R. E. Bryant. Indexed predicate discovery for unbounded system verification. In CAV'04, 2004. http://citeseer.ist.psu.edu/lahiri04indexed.html More
@misc{ lahiri04indexed,
author = "S. Lahiri and R. Bryant",
title = "Indexed predicate discovery for unbounded system verification",
text = "S. K. Lahiri and R. E. Bryant. Indexed predicate discovery for unbounded
system verification. In CAV'04, 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/lahiri04indexed.html" }
Citations (may not include all citations):815 Abstract interpretation : A Unified Lattice Model for the St.. (context) - Cousot, Cousot - 1977
267 Computer-Aided Verification of Coordinating Processes: The A.. (context) - Kurshan - 1995
200 Construction of abstract state graphs with PVS - Graf, Saidi - 1997
107 A new solution of Dijkstra's concurrent programming problem (context) - Lamport - 1974
107 Automatic predicate abstraction of C programs - Ball, Majumdar et al. - 2001
94 Counterexample-guided abstraction refinement - Clarke, Grumberg et al. - 2000
88 Lazy Abstraction - Henzinger, Jhala et al. - 2002
77 nondeterminacy and formal derivation of programs (context) - Dijkstra - 1975
73 Symbolic model checking with rich assertional languages - Kesten, Maler et al. - 1997
46 Verification of an implementation of Tomasulo's algorithm by.. (context) - McMillan - 1998
45 Regular model checking - Bouajjani, Jonsson et al. - 2000
43 Syntactic program transformations for automatic abstraction - Namjoshi, Kurshan - 2000
42 Modeling and Verifying Systems using a Logic of Counter Arit.. - Bryant, Lahiri et al. - 2002
37 Modular Verification of Software Components in C - Chaki, Clarke et al. - 2003
16 A symbolic approach to predicate abstraction - Lahiri, Bryant et al. - 2003
16 Predicate abstraction for software verification (context) - Flanagan, Qadeer - 2002
16 Personal communication (context) - German
13 The decision problem for standard classes (context) - Gurevich - 1976
12 Counter-example based predicate discovery in predicate abstr.. - Das, Dill - 2002
12 Incremental verification by abstraction - Lakhnech, Bensalem et al. - 2001
10 Automatic deductive verification with invisible invariants - Pnueli, Ruah et al. - 2001
9 Modeling and verification of out-of-order microprocessors in.. - Lahiri, Seshia et al. - 2002
8 Induction in compositional model checking - McMillan, Qadeer et al. - 2000
7 Parameterized verification with automatically computed induc.. - Arons, Pnueli et al. - 2001
4 Parameterized Verification of a Cache Coherence Protocol: Sa.. (context) - Baukus, Lakhnech et al. - 2002
4 Predicate Abstraction of ANSI-C Programs using SAT - Clarke, Kroening et al. - 2003
2 Exact and efficient verification of parameterized cache cohe.. (context) - Emerson, Kahlon - 2003
2 Constructing Quantified Invariants via Predicate Abstraction - Lahiri, Bryant - 2004
Documents on the same site (http://www.ece.cmu.edu/~shuvendu/): More
An Efficient Decision Procedure for the Logic of Counter.. - Lahiri (2001) (Correct)
Comparing Techniques for Out-of-Order Processor.. - Lahiri, Seshia, Bryant (Correct)
Deductive Verification of Advanced Out-of-Order Microprocessors - Lahiri, Bryant (2003) (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