R. P. Kurshan. Computer-aided veri cation of coordinating processes: the automata-theoretic approach. Princeton University Press, 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Model Reduction Based on Value Dependency - Peng, Mokhtari, Tahar (2001) (Correct)
....remove the redundant control structure and generate a reduced model for Java code. In [2] Clarke et al. proposed an abstract interpretation based approach to aggregate the values of variables into an equivalence class, then a counter example is used to adjust the size of the equivalence class. In [7], Kurshan proposed cone of in uence (COI) reduction to reduce the redundant state variables. Our approach is similar with the above approaches based on the fact that we all remove the redundant state variables and aggregate the value domains, then construct a reduced model preserving the original ....
R. P. Kurshan. Computer-aided veri cation of coordinating processes. Princeton University Press, 1994.
Integrated State Space Reduction for Model Checking Executable.. - Xie, Browne (2002) (Correct)
....abstract xUML model can be constructed by extending the mapping to states and transitions. Since the state space of the abstract model is often smaller, it is frequently easier to check properties on the abstract model. Localization Reduction Given a model and a property, localization reduction [9], also known as cone of in uence reduction [4] eliminates variables in the model that do not in uence the variables in the property. The checked property is preserved, but the size of the model to be checked is smaller. Symmetry Reduction Symmetry reduction can often reduce the number of queries ....
Kurshan, R.P.: Computer-Aided Veri cation of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press (1994)
Weak Muller Acceptance Conditions for Tree Automata - Torre, Murano, Napoli (2002) (Correct)
....of project Metodi Formali per la Sicurezza (MEFISTO) Automata on in nite words and trees turned out to be very useful for those areas of computer science where nonterminating computations are studied. They give a unifying paradigm to specify, verify, and synthesize nonterminating systems [7, 15, 16]. A system speci cation can be translated to an automaton, and thus, questions about systems and their speci cations are reduced to decision problems in the automata theory. For example, the satis ability of a speci cation and the correctness of a system with respect to its speci cation can ....
R.P. Kurshan. Computer-aided Veri cation of Coordinating Processes: the automata-theoretic approach. Princeton University Press, 1994.
Predicate Abstraction with Minimum Predicates - Chaki, Clarke, Groce, Strichman (2003) (2 citations) (Correct)
....the amount of memory required are signi cantly reduced. Related work. Predicate abstraction was introduced by Graf and Saidi in [16] It was subsequently used with considerable success in both hardware and software veri cation [2, 12, 13] The notion of CEGAR was originally introduced by Kurshan [14] (originally termed localization) for model checking of nite state models. Both the abstraction and re nement techniques for such systems, as applied in his and consequent works, are essentially di erent than the predicate abstraction approach we follow. For example, abstraction in localization ....
R. P. Kurshan. Computer-Aided Veri cation of Coordinating Processes: The AutomataTheoretic Approach. Princeton University Press, 1995.
Lazy Symbolic Model Checking - Yang, Tiemeyer (2000) (Correct)
....diagrams (BDD s) 3] In 1987, McMillan [12] implemented a BDD based algorithm SMV for CTL model checking [6] Since then many techniques [7] have been proposed to improve the performance and capacityof the algorithm. One very w ell kno wn technique is the cone of in uence (COI) reduction [9, 5, 7]. The basic idea is to build a dependency graph for a circuit model such that v ariablev depends on variable w if w appears in the next state function of v. Given a speci cation, an abstraction of the model is built that only consists of the next state functions for the variables in the ....
....upon the reduction technique by starting from a small portion of the dependency closure. When model checking fails to produce a satisfactory answer, they extend the abstract model by adding more variables from the closure. This process is repeated until a de nite yes no answer is produced [1, 9, 10, 11]. While the rst drawback has been addressed by these algorithms, the second drawback remains unresolved. In this paper, w e presentalazy model checking approach that simultaneously solves the tw o problems by closely tying the abstraction of a model to each pre image computation in the model ....
R. Kurshan. Computer-Aided Veri cation of Coordinating Processes: The Automata-Theoretic Approach, pages 170-172. Princeton University Press, 1994.
On Model Checking Safety Properties - Latvala (2002) (Correct)
....concurrent software systems are still debugged mostly using traditional methods. The problems related to scaling in model checking are referred to as the state explosion problem [60] In this work we focus on ecient model checking of safety properties, using the automata theoretical approach [62, 34, 63]. Safety properties describe properties of the system which have nite counterexamples or, more informally, properties requiring that nothing bad happens . A typical safety property requires e.g. that the value of x always is greater than three. Many common properties such as invariants are safety ....
....only observe nite executions, it is only possible to validate safety properties. This is why safety properties are very interesting from the testing perspective. Before proceeding to the details of model checking safety properties, let us review how the traditional automata theoretic approach [34, 63] to model checking works. The system under inspection is modelled as a Kripke model M and the speci cation is given as an LTL formula . The Kripke model M can be see as an automaton accepting the language L(M ) It is also possible to create an automaton on in nite words A which exactly accepts ....
[Article contains additional citation context not shown here]
R.P. Kurshan. Computer-Aided Veri cation of Coordinating Processes: The Automata-Theoretic Approach. Princeon University Press, Princeton, New Jersey, 1994.
Ecient Veri - Cation Of Sequential (Correct)
No context found.
R. P. Kurshan. Computer-aided veri cation of coordinating processes: the automata-theoretic approach. Princeton University Press, 1994.
On Checking Temporal Properties of Software with Boolean Programs - Martin (2000) (Correct)
No context found.
R.P. Kurshan. Computer-aided Veri cation of Coordinating Processes. Princeton University Press, 1994.
Relating Word and Tree Automata - Kupferman, Safra, Vardi (2004) (3 citations) (Correct)
No context found.
R.P. Kurshan. Computer Aided Veri cation of Coordinating Processes. Princeton Univ. Press, 1994.
Model Checking at IBM - Ben-David, Eisner, Geist, Wolfsthal (2002) (Correct)
No context found.
R. Kurshan. Computer-Aided Veri cation of Coordinating Processes. Princeton University Press, 1994.
Büchi Complementation Made Tighter - Friedgut, Kupferman, Vardi (2004) (Correct)
No context found.
R.P. Kurshan. Computer Aided Veri cation of Coordinating Processes. Princeton Univ. Press, 1994.
The Complexity of Temporal Logic Model Checking - Schnoebelen (2003) (2 citations) (Correct)
No context found.
R. P. Kurshan. Computer-Aided Veri cation of Coordinating Processes. Princeton Univ. Press, 1995.
Automated Compositional Abstraction Refinement for.. - Chaki, Ouaknine.. (2003) (Correct)
No context found.
R. P. Kurshan. Computer-aided veri cation of coordinating processes: the automata-theoretic approach. Princeton University Press, 1994.
State/Event-based Software Model Checking - Edmund (2004) (Correct)
No context found.
R. P. Kurshan. Computer-aided veri cation of coordinating processes: the automata-theoretic approach. Princeton University Press, 1994.
Abstraction-based Satisfiability Solving of.. - Kroening, Ouaknine, .. (2004) (Correct)
No context found.
R. Kurshan. Computer-Aided Veri cation of Coordinating Processes. Princeton University Press, 1994.
Abstraction-based Satisfiability Solving of.. - Kroening, Ouaknine, .. (2004) (Correct)
No context found.
R. Kurshan. Computer-Aided Veri cation of Coordinating Processes. Princeton University Press, 1994.
Abstraction-based Satisfiability Solving of Presburger.. - Kroening, Seshia.. (2004) (Correct)
No context found.
R. Kurshan. Computer-Aided Veri cation of Coordinating Processes. Princeton University Press, 1994.
Using Symbolic CTL Model Checking to Verify the Railway Stations.. - Eisner (Correct)
No context found.
R. Kurshan. Computer-Aided Veri cation of Coordinating Processes. Princeton University Press, 1994.
On Checking Temporal Properties of Software with Boolean Programs - Martin (2000) (Correct)
No context found.
R.P. Kurshan. Computer-aided Veri cation of Coordinating Processes. Princeton University Press, 1994.
Efficient Verification of Sequential and Concurrent C.. - Chaki, Clarke, Groce, .. (2003) (1 citation) (Correct)
No context found.
R. P. Kurshan. Computer-aided veri cation of coordinating processes: the automata-theoretic approach. Princeton University Press, 1994.
Fair Equivalence Relations - Orna Kupferman And (Correct)
No context found.
R. Kurshan. Computer Aided Veri cation of Coordinating Processes. Princeton Univ. Press, 1994.
Symbolic Simulation Using Automatic Abstraction of Internal Node.. - Wilson (2001) (Correct)
No context found.
R. P. Kurshan. Computer-Aided Veri cation of Coordinating Processes. Princeton University Press, 1994.
Search Techniques and Automata for Symbolic Model Checking - Bloem (2001) (Correct)
No context found.
R. P. Kurshan. Computer-Aided Veri cation of Coordinating Processes. Princeton University Press, Princeton, NJ, 1994.
Relative Completeness of Abstraction Refinement for.. - Ball, Podelski, Rajamani (2002) (12 citations) (Correct)
No context found.
R. Kurshan. Computer-aided Veri cation of Coordinating Processes. Princeton University Press, 1994.
Syntactic Model Reduction - Peng, Mokhtari, Tahar (2001) (Correct)
No context found.
R. P. Kurshan. Computer Aided veri cation of coordinating processes. Princeton University Press, 1994.
First 50 documents Next 50
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