Indexed Predicate Discovery for Unbounded System Verification

Indexed Predicate Discovery for Unbounded System Verification (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Shuvendu K. Lahiri , Randal E. Bryant

Venue:	IN CAV’04
Citations:	42 - 7 self

BibTeX

@INPROCEEDINGS{Lahiri04indexedpredicate,
    author = {Shuvendu K. Lahiri and Randal E. Bryant},
    title = {Indexed Predicate Discovery for Unbounded System Verification},
    booktitle = {IN CAV’04},
    year = {2004},
    pages = {135--147},
    publisher = {Springer}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Predicate abstraction has been proved 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 necessary predicates. For

Citations

1635	Abstract Interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints - COUSOT, COUSOT - 1977
520	H.: Construction of abstract state graphs with PVS - Graf, Saïdi - 1997
482	Counterexample-Guided Abstraction Refinement for Symbolic Model Checking - Clarke, Grumberg, et al. - 2003
393	Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach - Kurshan - 1994
378	G.: Lazy abstraction - Henzinger, Jhala, et al. - 2002
363	Guarded commands, nondeterminacy and formal derivation of programs - Dijkstra - 1975
348	S.K.: Automatic predicate abstraction of C programs 36(5 - Ball, Majumdar, et al. - 2001
191	A New Solution of Dijkstra's Concurrent Programming Problem - Lamport - 1974
121	Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions - Bryant, Lahiri, et al.
102	T.: Regular model checking - Bouajjani, Jonsson, et al. - 2000
88	Verification of an Implementation of Tomasulo’s Algorithm by Compositional Model Checking - McMillan - 1427
85	Predicate abstraction for software verification - Flanagan, Qadeer - 2002
82	E.: Symbolic model checking with rich assertional languages. Theor. Comput. Sci - Kesten, Maler, et al. - 2001
61	Syntactic program transformations for automatic abstraction - Namjoshi, Kurshan - 2000
56	Automatic deductive verification with invisible invariants - Pnueli, Ruah, et al. - 2001
55	Parameterized Verification with Automatically Computed Inductive Assertions - Arons, Pnueli, et al.
53	A symbolic approach to predicate abstraction - Lahiri, Bryant, et al. - 2003
48	Counter-example Based Predicate Discovery - Das, Dill - 2002
38	Modeling and verification of out-of-order microprocessors - Lahiri, Seshia, et al.
28	Constructing Quantified Invariants via Predicate Abstraction - Lahiri, Bryant
28	S.: Incremental verification by abstraction - Lakhnech, Bensalem, et al.
26	Yorav K. : Predicate abstraction of ANSI-C Programs using SAT - Clarke, Kroening, et al.
24	Induction in compositional model checking - MCMILLAN, QADEER, et al. - 2000
21	Exact and Efficient Verification of Parameterized Cache Coherence Protocols. Correct Hardware Design and Verification Methods - Emerson, Kahlon
16	The Decision Problem for Standard Classes - Gurevich - 1976
14	Parameterized verification of a cache coherence protocol: Safety and liveness - Baukus, Lakhnech, et al.