Using Generalized Model Checking Patrice Godefroid and Radha Jagadeesan Bell...  Home/Search
Context
Related
| depaul.edu/rjagadeesan/ftp/CAV02.ps From: depaul.edu/rjagadeesan/pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Generalized model checking is a framework for reasoning about partial state spaces of concurrent reactive systems. The state space of a system is only "partial" (partially known) when a full state-space exploration is not computationally tractable, or when abstraction techniques are used to simplify the system's representation. In the context of automatic abstraction, generalized model checking means checking whether there exists a concretization of an abstraction that satisfies a... (Update)
Similar documents (at the sentence level):
8.4%: Automatic Abstraction - Using Generalized Model (2002) (Correct)
7.3%: On The Expressiveness of 3-Valued Models - Godefroid, Jagadeesan (2003) (Correct)
Active bibliography (related documents): More All
0.2: A Game-Based Framework for CTL Counterexamples and.. - Shoham (Correct)
0.2: Three-Valued Abstractions of Games: Uncertainty, but.. - de Alfaro, Godefroid, .. (2004) (Correct)
0.2: Math. Struct. in Comp. Science (2004), vol. 14, pp.. - Cambridge University Press (Correct)
Similar documents based on text: More All
0.6: Abstraction-based Model Checking using Modal Transition.. - Godefroid, Huth.. (2001) (Correct)
0.3: Automatically Closing Open Reactive Programs - Colby, Godefroid, Jagadeesan (1998) (Correct)
0.3: Model Checking Without a Model: An Analysis of the.. - Godefroid, Hanmer.. (1998) (Correct)
BibTeX entry: (Update)
@misc{ model-automatic,
author = "Using Generalized Model",
title = "Automatic Abstraction",
url = "citeseer.ist.psu.edu/693377.html" }
Citations (may not include all citations):1180 The Temporal Logic of Reactive and Concurrent Systems: Speci.. (context) - Manna, Pnueli - 1992
397 Design and Synthesis of Synchronization Skeletons using Bran.. (context) - Clarke, Emerson - 1981
343 Introduction to Metamathematics (context) - Kleene - 1987
270 Bandera: Extracting Finite-State Models from Java Source Cod.. - Corbett, Dwyer et al. - 2000
206 Results on the Propositional Mu-Calculus (context) - Kozen - 1983
200 Construction of Abstract State Graphs with PVS - Graf, Saidi - 1997
181 Principles of Program Analysis (context) - Nielson, Nielson et al. - 1999
162 Automata-Theoretic Techniques for Modal Logics of Programs (context) - Vardi, Wolper - 1986
123 Model Checking for Programming Languages using VeriSoft - Godefroid - 1997
104 Model Checking Programs - Visser, Havelund et al. - 2000
88 Lazy Abstraction - Henzinger, Jhala et al. - 2002
86 An Automata-Theoretic Approach to Branching-Time Model Check.. - Kupferman, Vardi et al. - 2000
68 Why is Modal Logic So Robustly Decidable - Vardi - 1997
52 A Modal Process Logic (context) - Larsen, Thomsen - 1988
47 Abstract interpretation and partition refinement for model c.. (context) - Dams - 1996
47 A Practical Method for Verifying Event-Driven Software (context) - Holzmann, Smith - 1999
43 Syntactic Program Transformations for Automatic Abstraction - Namjoshi, Kurshan - 2000
41 Boolean and Cartesian Abstraction for Model Checking C Progr.. - Ball, Podelski et al. - 2001
40 Successive Approximation of Abstract Transition Relations (context) - Das, Dill - 2001
29 Generalized Model Checking: Reasoning about Partial State Sp.. - Bruns, Godefroid - 2000
29 Temporal Abstract Interpretation (context) - Cousot, Cousot - 2000
24 Modal Transition Systems: a Foundation for Three-Valued Prog.. - Huth, Jagadeesan et al. - 2001
24 The SLAM Toolkit (context) - Ball, Rajamani - 2001
22 Model Checking Partial State Spaces with 3-Valued Temporal L.. - Bruns, Godefroid - 1999
12 Abstraction-based Model Checking using Modal Transition Syst.. - Godefroid, Huth et al. - 2001
Documents on the same site (http://reed.cs.depaul.edu/rjagadeesan/pubs.html): More
A correction to the definition of hiding in tcc.. - Gupta, Jagadeesan.. (2002) (Correct)
µABC: A Minimal Aspect Calculus - Bruns, Jagadeesan, Jeffrey, Riely (2004) (Correct)
Weak Bisimulation is Sound and Complete for PCTL - Desharnais, Gupta.. (2002) (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