Shuvendu K. Lahiri, Randal E. Bryant, and Byron Cook Carnegie Mellon...  Home/Search
Context Related
| foment.net/byron/papers/cav03.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: microsoft.com/~bycook/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Predicate abstraction is a useful form of abstraction for the veri cation of transition systems with large or in nite state spaces. One of the main bottlenecks of this approach is the extremely large number of decision procedures calls that are required to construct the abstract state space. In this paper we propose the use of a symbolic decision procedure and its application for predicate abstraction. The advantage of the approach is that it reduces the number of calls to the decision... (Update)
Cited by: More
Zapato: Automatic theorem proving for - Predicate Ion Refinement (Correct)
Using Stålmarck's algorithm to prove inequalities - Cook, Gonthier (Correct)
Refining Approximations in Software Predicate Abstraction - Ball, Cook, Das, Rajamani (2004) (Correct)
Active bibliography (related documents): More All
2.6: A Symbolic Approach to Predicate Abstraction - Lahiri, Bryant, Cook (2003) (Correct)
0.7: Modeling and Verification of Out-of-Order Microprocessors.. - Lahiri, Seshia, Bryant (2002) (Correct)
0.4: Revisiting Positive Equality - Lahiri, Bryant, Goel, Talupur (2004) (Correct)
Similar documents based on text:
3.0: Unknown - (Correct)
Related documents from co-citation: More All
12: Automatic predicate abstraction of c programs - Ball, Majumdar et al. - 2001
8: Construction of abstract state graphs with pvs - Graf, Saidi - 1997
8: Modeling and verifying systems using a logic of counter arithmetic with lambda e.. - Bryant, Lahiri et al.
BibTeX entry: (Update)
Shuvendu K. Lahiri, Randal E. Bryant, and Byron Cook. A symbolic approach to predicate abstraction. In Proceedings of the International Conference on Computer-Aided Verification (CAV'03), 2003. To appear. http://citeseer.ist.psu.edu/lahiri03symbolic.html More
@misc{ lahiri03symbolic,
author = "S. Lahiri and R. Bryant and B. Cook",
title = "A symbolic approach to predicate abstraction",
text = "Shuvendu K. Lahiri, Randal E. Bryant, and Byron Cook. A symbolic approach
to predicate abstraction. In Proceedings of the International Conference
on Computer-Aided Verification (CAV'03), 2003. To appear.",
year = "2003",
url = "citeseer.ist.psu.edu/lahiri03symbolic.html" }
Citations (may not include all citations):1726 Graph-based algorithms for Boolean function manipulation - Bryant - 1986
200 Construction of abstract state graphs with PVS - Graf, Saidi - 1997
193 Abstract interpretation : a uni ed lattice model for the sta.. (context) - Cousot, Cousot - 1977
107 Automatic predicate abstraction of C programs - Ball, Majumdar et al. - 2001
94 Validity checking for combinations of theories with equality - Barrett, Dill et al. - 1996
78 Experience with predicate abstraction - Das, Dill et al. - 1999
57 Engineering an ecient SAT solver (context) - Moskewicz, Madigan et al. - 2001
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
40 Successive approximation of abstract transition relations (context) - Das, Dill - 2001
38 Abstract and Model Check while you Prove (context) - Saidi, Shankar - 1999
36 Exploiting positive equality in a logic of equality with uni.. - Bryant, German et al. - 1999
24 Applying SAT Methods in Unbounded Symbolic Model Checking (context) - McMillan - 2002
21 Deciding separation formulas with sat - Strichmann, Seshia et al. - 2002
18 NuSMV: a new Symbolic Model Veri er (context) - Cimatti, Clarke et al. - 1999
11 Ecient model checking by automated ordering of transition re.. (context) - Geist, Beer - 1994
10 Automated veri cation of pipelined microprocessor control (context) - Burch, Dill - 1994
10 Automatic deductive veri cation with invisible invariants - Pnueli, Ruah et al. - 2001
8 Checking satis ability of rst-order formulas by incremental .. (context) - Barrett, Dill et al. - 2002
6 Predicate abstraction for software veri cation (context) - Flanagan, Qadeer - 2002
5 Formal Veri cation of Superscalar Microprocessors with Multi.. (context) - Velev, Bryant - 2000
4 Modeling and veri cation of out-oforder microprocessors in U.. (context) - Lahiri, Seshia et al. - 2002
3 Experience with term level modeling and veri cation of the M.. (context) - Lahiri, Pixley et al. - 2001
2 Fixpoint computation for circuits using Symbolic Simulation .. (context) - Clarke, Kroening et al. - 2003
2 On solving Presburger and linear arithmetic with SAT (context) - Strichmann - 2002
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://research.microsoft.com/~bycook/papers.htm): More
Cogent: Accurate theorem proving for program verification - Cook, Kroening, Sharygina (2005) (Correct)
Interprocedural Shape Analysis with Separated Heap.. - Gotsman, Berdine, Cook (Correct)
Refining Approximations in Software Predicate Abstraction - Ball, Cook, Das, Rajamani (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