Moshe Y. Vardi  Home/Search
Context
Related
| rice.edu/~vardi/papers/vmcai07.ps.gz From: rice.edu/~vardi/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In automata-theoretic model checking we compose the design under verification with a Buchi automaton that accepts traces violating the specification. (Update)
Similar documents (at the sentence level): More
10.6%: Automated Verification: Graphs, Logic, and Automata - Moshe Vardi Rice (Correct)
8.3%: On the Unusual Effectiveness of Logic in Computer Science - Halpern, Harper.. (2000) (Correct)
6.0%: Branching vs. Linear Time: Final Showdown - Moshe Vardi Rice (2001) (Correct)
Active bibliography (related documents): More All
2.2: On-the-fly Emptiness Checks for Generalized Büchi Automata - Couvreur, Duret-Lutz.. (2005) (Correct)
1.5: Deterministic Dynamic Monitors for Linear-Time Assertions - Armoni, Korchemny.. (2006) (Correct)
1.0: Shortest Counterexamples for Symbolic Model Checking of LTL.. - Schuppan, Biere (2005) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ vardi-automatatheoretic,
author = "Moshe Y. Vardi",
title = "Automata-Theoretic Model Checking Revisited",
url = "citeseer.ist.psu.edu/765908.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
1726 Graph-based algorithms for boolean-function manipulation - Bryant - 1986
1097 Automatic verification of finite-state concurrent systems us.. (context) - Clarke, Emerson et al. - 1986
828 Model Checking - Clarke, Grumberg et al. - 1999
779 Symbolic model checking: 10 20 states and beyond - Burch, Clarke et al. - 1992
603 Kluwer Academic Publishers (context) - McMillan, Checking - 1993
539 The temporal logic of programs (context) - Pnueli - 1977
434 An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
267 Computer Aided Verification of Coordinating Processes (context) - Kurshan - 1994
244 Symbolic model checking without BDDs - Biere, Cimatti et al. - 1999
227 Formal methods: State of the art and future directions - Clarke, Wing - 1996
221 Specification and verification of concurrent systems in Cesa.. (context) - Queille, Sifakis - 1981
177 Temporal logic can be more expressive (context) - Wolper - 1983
176 a decision method in restricted second order arithmetic (context) - Buchi - 1962
142 Simple on-the-fly automatic verification of linear temporal .. - Gerth, Peled et al. - 1995
139 Reasoning about infinite computations - Vardi, Wolper - 1994
130 Efficient model checking in fragments of the propositional -.. (context) - Emerson, Lei - 1986
128 An automata-theoretic approach to linear temporal logic - Vardi - 1996
112 Memory efficient algorithms for the verification of temporal.. - Courcoubetis, Vardi et al. - 1992
96 Finite automata and their decision problems (context) - Rabin, Scott - 1959
85 Special issue on Formal Methods in Software Practice (context) - Holzmann, checker et al. - 1997
84 Another look at ltl model checking - Clarke, Grumberg et al. - 1997
84 Another look at LTL model checking - Clarke, Grumberg et al. - 1994
81 The complementation problem for Buchi automata with applicat.. (context) - Sistla, Vardi et al. - 1987
81 The tableau method for temporal logic: An overview (context) - Wolper - 1985
71 Reasoning about infinite computation paths (context) - Wolper, Vardi et al. - 1983
58 Model checking of safety properties - Kupferman, Vardi - 2001
58 Characterizing correctness properties of parallel programs u.. (context) - Emerson, Clarke - 1980
56 Computer aided verification (context) - Clarke, Kurshan - 1986
42 Nusmv 2: An opensource tool for symbolic model checking - Cimatti, Clarke et al. - 2002
42 tapes: A simplified approach (context) - Choueka, automata - 1974
39 Weak alternating automata are not that weak - Kupferman, Vardi - 2001
38 On nested depth-first search - Holzmann, Peled et al. - 1996
34 Improved automata generation for linear temporal logic - Daniele, Guinchiglia et al. - 1999
29 Benefits of bounded model checking at an industrial setting (context) - Copty, Fix et al. - 2001
28 the verification of temporal properties - Godefroid, Holzmann - 1993
26 Formal verification in a commercial setting - Kurshan - 1997
26 linear time: Final showdown (context) - Vardi - 2001
25 Fast LTL to buchi automata translation (context) - Gastin, Oddoux - 2001
24 Efficient Buchi automata from LTL formulae (context) - Somenzi, Bloem - 2000
21 A new heuristic for bad cycle detection using BDDs - Hardin, Kurshan et al. - 2001
21 Optimizing Buchi automata - Etessami, Holzmann - 2000
18 Nontraditional applications of automata theory - Vardi - 1994
17 An algorithm for strongly connected component analysis in n .. - Bloem, Gabow et al. - 2000
17 Efficient decision procedures for model checking of linear t.. - Bloem, Ravi et al. - 1999
17 Is there a best symbolic cycledetection algorithm - Fisler, Fraer et al. - 2001
15 Complementation is more difficult with automata on infinite .. (context) - Michel - 1988
12 The quest for efficient Boolean satisfiability solvers (context) - Zhang, Malik - 2002
12 Liveness checking as safety checking - Biere, Artho et al. - 2002
11 From states to transitions: Improving translation of LTL for.. - Giannakopoulou, Lerda - 2002
10 more deterministic (context) - Sebastiani, Tonetta - 2003
10 fly verification of linear temporal logic (context) - Couvreur - 1999
9 Fair simulation minimization - Gurumurthy, Bloem et al. - 2002
7 On complementing nondeterministic Buchi automata - Gurumurthy, Kupferman et al. - 2003
7 Constructing Buchi automata from linear temporal logic using.. (context) - Fritz - 2003
6 The complexity of graph problems for succinctly represented .. (context) - Balcazar, Lozano - 1989
5 Computing strongly connected components in a linear number o.. - Gentilini, Piazza et al. - 2003
4 Optimal bounds for the transformation of omega-automata (context) - Loding - 1999
4 Buchi complementation made tighter (context) - Friedgut, Kupferman et al. - 2006
4 Simple and efficient translation from LTL formulas to Buchi .. (context) - Thirioux - 2002
3 Property specification language reference manual (context) - Albin
3 Simple is better: Efficient bounded model checking for past .. (context) - Latvala, Biere et al. - 2005
3 explicit properties: on hybrid approaches for LTL symbolic m.. (context) - Sebastiani, Tonetta et al. - 2005
2 Efficient LTL compilation for SAT-based model checking (context) - Armoni, Egorov et al. - 2005
2 The Weizmann Institute of Science (context) - Bustan, Fisman et al. - 2005
2 Analysis of symbolic scc hull algorithms (context) - Somenzi, Ravi et al. - 2002
2 Spot: An extensible model checking library using transition-.. (context) - Duret-Lutz, Poitrenaud - 2004
2 Bounded verification of past ltl (context) - Cimatti, Roveri et al. - 2004
2 From complementation to certification - Kupferman, Vardi - 2005
2 A note on on-the-fly verification algorithms (context) - Schwoon, Esparza - 2005
2 Nested emptiness search for generalized Buchi automata (context) - Tauriainen - 2006
2 Tarjan's algorithm makes on-the-fly LTL verification more ef.. (context) - Geldenhuys, Valmari - 2004
2 Concepts of automata construction from LTL (context) - Fritz - 2005
1 From psl to nba: A modular symbolic encoding (context) - Cimatti, Roveri et al. - 2006
1 Cluster-based LTL model checking of large systems (context) - Barnat, Brim et al. - 2006
1 fly emptiness checks for generalized Buchi automata (context) - Couvreur, Duret-Lutz et al. - 2005
1 From linear time to branching time (context) - Kupferman, Vardi - 2005
1 Psl model checking and run-time verification via testers (context) - Pnueli, Zaks - 2006
1 Deterministic dynamic monitors for linear-time assertions - Armoni, Korchemny et al. - 2006
1 Lower bounds for complementation of #-automata via the full .. (context) - Yan - 2006
Documents on the same site (http://www.cs.rice.edu/~vardi/papers/): More
An Operational Semantics for Knowledge Bases - Fagin, Halpern, al. (1994) (Correct)
Nontraditional Applications of Automata Theory - Vardi (1994) (Correct)
Synthesis with Incomplete Information - Kupferman, Vardi (1997) (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