Moshe Y. Vardi  Home/Search
Context Related
| rice.edu/~vardi/paper...banff94rj.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: rice.edu/CS/Verification/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis. Both programs and specifications are in essence descriptions of computations. These computations can be viewed as words over some alphabet. Thus,programs and specificationscan be viewed as descriptions of languagesover some alphabet. The automata-theoretic perspective considers the relationships betweenprograms and their... (Update)
Cited by: More
Deterministic Dynamic Monitors for Linear-Time Assertions - Armoni, Korchemny.. (2006) (Correct)
Automata-Theoretic Model Checking Revisited - Vardi (Correct)
Establishing Qualitative Properties for - Probabilistic Lossy Channel (Correct)
Similar documents (at the sentence level):
9.6%: Alternating Automata and Program Verification - Vardi (1995) (Correct)
8.1%: Alternating Automata: Checking Truth and Validity for Temporal.. - Vardi (1997) (Correct)
5.6%: Nontraditional Applications of Automata Theory - Vardi (1994) (Correct)
Active bibliography (related documents): More All
0.5: Weak Alternating Automata and Tree Automata Emptiness - Kupferman, Vardi (1998) (Correct)
0.4: An Automata-Theoretic Approach to Fair Realizability and Synthesis - Vardi (1995) (Correct)
0.4: Automata-Theoretic Techniques for Temporal Reasoning - Vardi (2006) (Correct)
Similar documents based on text: More All
0.5: Finite-state Automata on Infinite Inputs - Mukund (1996) (Correct)
0.3: Providing Assistance for Proofs in the Teaching of.. - Padmanabhan Krishnan.. (Correct)
0.2: An Automata-Theoretic Approach to Reasoning about.. - Kupferman, Vardi (2000) (Correct)
Related documents from co-citation: More All
38: An automata-theoretic approach to automatic program verification (context) - Vardi, Wolper - 1986
35: The Temporal Logic of Reactive and Concurrent Systems (context) - Manna, Pnueli - 1992
34: Reasoning about infinite computations - Vardi, Wolper - 1994
BibTeX entry: (Update)
M. Vardi. An automata-theoretic approach to linear temporal logic. In F. Moller and G. Birtwistle, editors, Logics for Concurrency, pages 238--266. Springer Verlag, 1996. http://citeseer.ist.psu.edu/vardi96automatatheoretic.html More
@inproceedings{ vardi95automatatheoretic,
author = "Moshe Y. Vardi",
title = "An Automata-Theoretic Approach to Linear Temporal Logic",
booktitle = "Banff Higher Order Workshop",
pages = "238-266",
year = "1995",
url = "citeseer.ist.psu.edu/vardi96automatatheoretic.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-co.. (context) - Garey, Johnson - 1979
3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
1180 The Temporal Logic of Reactive and Concurrent Systems: Speci.. (context) - Manna, Pnueli - 1992
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: The A.. (context) - Kurshan - 1994
241 Decidability of second order theories and automata on infini.. (context) - Rabin - 1969
230 Checking that finite state concurrent programs satisfy their.. (context) - Lichtenstein, Pnueli - 1985
222 The complexity of propositional linear temporal logic (context) - Sistla, Clarke - 1985
198 Trace theory for automatic hierarchical verification of spee.. (context) - Dill - 1989
194 the development of reactive systems (context) - Harel, Pnueli - 1985
163 the temporal analysis of fairness (context) - Gabbay, Pnueli et al. - 1980
139 Reasoning about infinite computations - Vardi, Wolper - 1994
132 Relationship between nondeterministic and deterministic tape.. (context) - Savitch - 1970
131 The complexity of tree automata and logics of programs (context) - Emerson, Jutla - 1988
116 Synthesis of Communicating Processes from Temporal Logic Spe.. (context) - Wolper - 1982
116 Synthesis of communicating processes from temporal logic spe.. (context) - Manna, Wolper - 1984
112 Memory efficient algorithms for the verification of temporal.. - Courcoubetis, Vardi et al. - 1992
110 the synthesis of a reactive module (context) - Pnueli, Rosner - 1989
104 Proving liveness properties of concurrent programs (context) - Owicki, Lamport - 1982
103 The glory of the past (context) - Lichtenstein, Pnueli et al. - 1985
96 Finite automata and their decision problems (context) - Rabin, Scott - 1959
81 Handbook of theoretical computer science (context) - Thomas, infinite - 1990
81 The complementation problem for Buchi automata with applicat.. (context) - Sistla, Vardi et al. - 1987
75 Modalities for model checking: Branching time logic strikes .. (context) - Emerson, Lei - 1985
71 Reasoning about infinite computation paths (context) - Wolper, Vardi et al. - 1983
64 The equivalence problem for regular expressions with squarin.. (context) - Meyer, Stockmeyer - 1972
58 Alternating automata on infinite trees (context) - Muller, Schupp - 1987
54 Space-bounded reducibility among combinatorial problems (context) - Jones - 1975
53 Testing and generating infinite sequences by a finite automa.. (context) - McNaughton - 1966
53 Sometimes and not never revisited: On branching versus linea.. (context) - Emerson, Halpern - 1986
51 Descriptive Set Theory (context) - Moschovakis - 1980
49 Solving sequential conditions by finite-state strategies (context) - Buchi, HG - 1969
46 Journal of the Association for Computing Machinery (context) - Chandra, Kozen et al. - 1981
42 Theoretical Computer Science (context) - Brzozowski, Leiss et al. - 1980
42 Automata on infinite objects and Church's problem (context) - Rabin - 1972
40 Improved upper and lower bounds for modal logics of programs (context) - Vardi, Stockmeyer - 1985
37 the temporal logic of programs (context) - Lamport, sometimes et al. - 1980
26 Realizable and unrealizable concurrent program specification.. (context) - Abadi, Lamport et al. - 1989
26 Using branching time logic to synthesize synchronization ske.. (context) - Emerson, Clarke - 1982
26 Weak alternating automata give a simple explanation of why m.. (context) - Muller, Saoudi et al. - 1988
25 Protocol engineering (context) - Liu - 1989
25 Temporal model checking under generalized fairness constrain.. (context) - Emerson, Lei - 1985
25 and temporal logics (context) - Emerson, tableaux - 1985
24 Economy of description by automata (context) - Meyer, Fischer - 1971
24 Theoretical Computer Science (context) - Miyano, Hayashi et al. - 1984
20 the complexity of omega-automata (context) - Safra - 1988
18 Nontraditional applications of automata theory - Vardi - 1994
15 Complementation is more difficult with automata on infinite .. (context) - Michel - 1988
14 Network protocols and tools to help produce them (context) - Rudin - 1987
13 On simultaneously determinizing and complementing (context) - Emerson, Jutla - 1989
7 Is the interesting part of process logic uninteresting: a tr.. (context) - Sherman, Pnueli et al. - 1984
6 The emptiness problem for automata on infinite trees (context) - Hossley, Rackoff - 1972
6 Computer and System Sciences (context) - Choueka, automata et al. - 1974
5 Theoretical issues in the design and analysis of distributed.. (context) - Sistla - 1983
5 regular languages and propositional temporal logic (context) - Peikert - 1985
3 Infinite games of perfect information (context) - andF, Stewart - 1953
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.rice.edu/CS/Verification/): More
An Automata-Theoretic Approach to Branching-Time Model.. - Kupferman, Vardi, Wolper (1998) (Correct)
Computational Model Theory: An Overview - Vardi (1998) (Correct)
Bisimulation Minimization in an Automata-Theoretic.. - Fisler, Vardi (1998) (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