Kedar S. Namjoshi, Robert P. Kurshan  Home/Search
Context Related
Links: ACM DBLP | belllabs.com/who/..._abstraction.ps.gz 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: belllabs.com/who/...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present an algorithm that constructs a finite state "abstract " program from a given, possibly infinite state, "concrete" program by means of a syntactic program transformation. Starting with an initial set of predicates from a specification, the algorithm iteratively computes the predicates required for the abstraction relative to that specification. These predicates are represented by boolean variables in the abstract program. We show that the method is sound, in that the abstract... (Update)
Cited by: More
Abstraction Refinement for Termination - Ron Cook Andreas (2005) (Correct)
A Symbolic Approach to Predicate Abstraction - Shuvendu Lahiri Randal (2003) (Correct)
Making Predicate Abstraction Efficient: - How To Eliminate (Correct)
Active bibliography (related documents): More All
0.3: Combinations of Model Checking and Theorem Proving - Uribe (2000) (Correct)
0.2: Formal Verification of an Avionics Application.. - Bienmüller.. (Correct)
0.2: Verification of Automotive Control Units - Bienmüller, Bohn, Brinkmann.. (1999) (Correct)
Similar documents based on text: More All
0.9: Efficient Analysis of Cyclic Definitions - Namjoshi, Kurshan (1999) (Correct)
0.3: Autoabs: Syntax-Directed Program Abstraction - Nina Amla Robert (Correct)
0.3: Lifting Temporal Proofs Through Abstractions - Namjoshi (2003) (Correct)
Related documents from co-citation: More All
30: Construction of abstract state graphs with pvs - Graf, Saidi - 1997
19: Experience with predicate abstraction - Das, Dill et al. - 1999
16: Counterexample-guided abstraction refinement - Clarke, Grumberg et al. - 2000
BibTeX entry: (Update)
K.S. Namjoshi and R.P. Kurshan. Syntactic Program Transformations for Automatic Abstraction. In Proceedings of the 12th International Conference On Computer Aided Verication, volume 1855 of Lecture Notes in Computer Science, 2000. Springer Verlag. http://citeseer.ist.psu.edu/namjoshi00syntactic.html More
@inproceedings{ namjoshi00syntactic,
author = "Kedar S. Namjoshi and Robert P. Kurshan",
title = "Syntactic Program Transformations for Automatic Abstraction",
booktitle = "Computer Aided Verification",
pages = "435-449",
year = "2000",
url = "citeseer.ist.psu.edu/namjoshi00syntactic.html" }
Citations (may not include all citations):1097 Automatic verification of finite-state concurrent systems us.. (context) - Clarke, Emerson et al. - 1986
539 The temporal logic of programs (context) - Pnueli - 1977 ACM DBLP
502 Concurrency and automata on infinite sequences (context) - Park - 1981
397 Design and synthesis of synchronization skeletons using bran.. (context) - Clarke, Emerson - 1981
231 Model checking and abstraction - Clarke, Grumberg et al. - 1994 ACM DBLP
221 Specification and verification of concurrent systems in CESA.. (context) - Queille, Sifakis - 1982
206 Results on the propositional mu-calculus (context) - Kozen - 1983
200 Construction of abstract state graphs with PVS - Graf, Saidi - 1997 ACM DBLP
130 Efficient model checking in fragments of the propositional m.. (context) - Emerson, Lei - 1986
115 Exploiting symmetry in temporal logic model checking (context) - Clarke, Filkorn et al. - 1993 ACM DBLP
107 A new solution of Dijkstra's concurrent programming problem (context) - Lamport - 1974 ACM DBLP
106 An algebraic definition of simulation between programs (context) - Milner - 1971 ACM DBLP
102 Formal verification of parallel programs (context) - Keller - 1976
101 Better verification through symmetry - Ip, Dill - 1996 ACM DBLP
96 Expressing interesting properties of programs in proposition.. (context) - Wolper - 1986
90 Characterizing finite Kripke structures in Propositional Tem.. (context) - Browne, Clarke et al. - 1988 ACM DBLP
87 Reasoning about systems with many processes (context) - German, Sistla - 1992 ACM DBLP
77 Symmetry and model checking - Emerson, Sistla - 1993 ACM DBLP
73 Symbolic model checking with rich assertional languages - Kesten, Maler et al. - 1997
70 Computing abstractions of infinite state systems composition.. - Bensalem, Lakhnech et al. - 1998 ACM DBLP
66 revisited: On branching versus linear time temporal logic (context) - Emerson, Halpern et al. - 1986
66 Model checking and modular verification - Grumberg, Long - 1994 ACM DBLP
65 Computing simulations on finite and infinite graphs - Henzinger, Henzinger et al. - 1995 ACM DBLP
58 Online minimization of transition systems (context) - Lee, Yannakakis - 1992
55 and formal derivation of programs (context) - Dijkstra, nondeterminacy - 1975
55 Minimal model generation (context) - Bouajjani, Fernandez et al. ACM DBLP
48 Deciding equality formulas by small domains instantiations - Pnueli, Rodeh et al. - 1999 ACM DBLP
47 Generation of reduced models for checking fragments of CTL (context) - Dams, Gerth et al. - 1993 ACM DBLP
47 Bdd-based procedures for a theory of equality with uninterpr.. - Sajid, Goel et al. - 1998
38 Symbolic model checking of infinite state systems using Pres.. - Bultan, Gerber et al. - 1997 ACM DBLP
37 Automatic datapath abstraction of hardware systems (context) - Hojati, Brayton - 1995
27 A Semantic Study of Data Independence with Applications to M.. (context) - Lazi'c - 1999
26 Generating finite-state abstractions of reactive systems usi.. - Colon, Uribe - 1998 ACM DBLP
20 Combining constraint solving and symbolic model checking for.. - Chan, Anderson et al. - 1997
14 What if model checking must be truly symbolic - Hungar, Grumberg et al. - 1995 ACM DBLP
11 From asymmetry to full symmetry: New techniques for symmetry.. - Emerson, Trefler - 1999 DBLP
8 Formal Methods in System Design (context) - Sipma, Uribe et al.
7 First-orderCTL model checking - Bohn, Damm et al. - 1998
5 Verification by augmented finitary abstraction - Kesten, Pnueli ACM DBLP
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.bell-labs.com/who/kedar/publications.html): More
Model Checking Synchronous Timing Diagrams - Amla, Emerson, Kurshan, Namjoshi (2000) (Correct)
On Model Checking for Non-Deterministic Infinite-State Systems - Emerson, Namjoshi (1998) (Correct)
Reasoning about Rings - Emerson, Namjoshi (1995) (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