Moshe Y. Vardi  Home/Search
Context Related
| rice.edu/~vardi/papers/tacs94.ps.gz Cached: 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.
PS.gz PS Image Update HelpFrom: rice.edu/~vardi/papers/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Finite automata have two traditional applications in computer science: modeling of finite-state systems and description of regular set of finite words. In the last few years, several new applications for finite-state automata have emerged, e.g., optimization of logic programs and specification and verification of protocols. These applications use finite-state automata to describe regular sets of infinite words and trees. I will describe such applications and will argue that we need change the... (Update)
Similar documents based on text: More All
0.4: Expressive Power and Data Complexity of Nonrecursive - Query Languages For (Correct)
0.2: An Automata-Theoretic Approach to Reasoning about.. - Kupferman, Vardi (2000) (Correct)
0.1: Vacuity Detection in Temporal Model Checking - Kupferman, Vardi (1999) (Correct)
Related documents from co-citation: More All
12: Reasoning about infinite computations - Vardi, Wolper - 1994
9: Weak alternating automata give a simple explanation of why most temporal and dyn.. (context) - Muller, Saoudi et al. - 1988
9: An automata-theoretic approach to automatic program verification (context) - Vardi, Wolper - 1986
BibTeX entry: (Update)
M. Vardi. Nontraditional applications of automata theory. In Proceedings of International Symposium on the Theoretical Aspects of Computer Software, volume 789 of LNCS, pages 575--597. Springer-Verlag, 1994. http://citeseer.ist.psu.edu/vardi94nontraditional.html More
@inproceedings{ vardi94nontraditional,
author = "Moshe Y. Vardi",
title = "Nontraditional Applications of Automata Theory",
booktitle = "Theoretical Aspects of Computer Software",
pages = "575-597",
year = "1994",
url = "citeseer.ist.psu.edu/vardi94nontraditional.html" }
Citations (may not include all citations):1180 The temporal logic of reactive and concurrent systems (context) - Manna, Pnueli - 1992
1097 Automatic verification of finitestate concurrent systems usi.. (context) - Clarke, Emerson et al. - 1986
981 Principles of database and knowledge base systems (context) - Ullman - 1989
981 Principles of database and knowledge base systems (context) - Ullman - 1988
434 An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
379 The complexity of relational query languages (context) - Vardi - 1982
374 Automata on infinite objects (context) - Thomas - 1990
245 Relational queries computable in polynomial time - Immerman - 1986
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
189 Computable queries for relational databases - Chandra, Harel - 1980
177 Temporal logic can be more expressive (context) - Wolper - 1983
170 Nondeterministic space is closed under complementation - Immerman - 1988
163 Universality of data retrieval languages (context) - Aho, Ullman - 1979
147 An amateur's introduction to recursive query processing stra.. (context) - Bancilhon, Ramakrishnan - 1986
140 Tense logic and the theory of linear order (context) - Kamp - 1968
121 and machines (context) - Eilenberg - 1974
120 Elementary induction on abstract structures (context) - Moschovakis - 1974
113 Akademiai Kiado (context) - Gecseg, Steinby - 1984
112 Memory Efficient Algorithms for the Verification of Temporal.. - Courcoubetis, Vardi et al. - 1992
104 Proving liveness properties of concurrent programs (context) - Owicki, Lamport - 1982
103 Tree acceptors and some of their applications (context) - Doner - 1971
90 Horn-clause queries and generalizations (context) - Chandra, Harel - 1985
81 Generalized finite automata theory with an application to a .. (context) - Thatcher, Wright - 1968
81 The complementation problem for Buchi automata with applicat.. (context) - Sistla, Vardi et al. - 1987
70 Verification of concurrent programs: the temporal framework (context) - Manna, Pnueli - 1981
64 Optimizing Datalog programs (context) - Sagiv - 1988
61 Logic and databases (context) - Gallaire, Minker - 1978
59 Modalities for model checking: branching time strikes back (context) - Emerson, Lei - 1985
53 Decidability and expressiveness aspects of logic queries (context) - Shmueli - 1987
45 Fixpoint extensions of first-order logic and Datalog-like la.. (context) - Abiteboul, Vianu - 1989
42 Theoretical Computer Science (context) - Brzozowski, Leiss - 1980
42 Finite automata: behavior and synthesis (context) - Trakhtenbrot, Barzdin - 1973
40 Real-time programming and asynchronous message passing (context) - Koymans, Vytopil et al. - 1983
36 the foundations of the universal relation model (context) - Maier, Ullman et al. - 1984
34 is sometimes (context) - Lamport - 1980
33 Deciding equivalence of finite tree automata (context) - Seidl - 1990
32 Programming primitives for database languages (context) - Chandra - 1981
29 Limits for automatic verification of finite-state concurrent.. (context) - Apt, Kozen - 1986
28 Fairness and related properties in transition systems (context) - Queille, Sifakis - 1982
26 Efficient evaluation of right (context) - Naughton, Ramakrishnan et al. - 1989
26 Weak alternating automata give a simple explanation of why m.. (context) - Muller, Saoudi et al. - 1988
25 Temporal model checking under generalized fairness constrain.. (context) - Emerson, Lei - 1985
24 Research on automatic verification of finite-state concurren.. (context) - Clarke, Grumberg - 1987
24 Theoretical Computer Science (context) - Miyano, Hayashi - 1984
24 Data independent recursion in deductive databases (context) - Naughton - 1989
24 on Foundations of Computer Science (context) - Pnueli - 1977
23 Automata theory for database theoreticians (context) - Vardi - 1992
20 Succinct representation of regular languages by boolean auto.. (context) - Leiss - 1981
19 on Foundation of Computer Science (context) - Safra - 1988
19 Embedded implicational dependencies and their inference prob.. (context) - Chandra, Lewis et al. - 1981
17 Parallel evaluation of recursive rule queries (context) - Cosmadakis, Kanellakis - 1986
17 Modular verification of computer communication protocols (context) - Hailpern, Owicki - 1983
12 Lecture Notes in Computer Science (context) - Lichtenstein, Pnueli et al. - 1985
11 Computer and Systems Sciences (context) - Chandra, Harel et al. - 1982
9 Query-by-Example: operations on the transitive closure (context) - Zloof - 1976
7 on Principles of Database Systems (context) - Mumick, Pirahesh - 1991
6 Computer and System Sciences (context) - Choueka, Theories et al. - 1974
6 Minimizing function-free recursive definitions (context) - Naughton - 1989
6 Logical query optimization by proof-tree transformation (context) - Ramakrishnan, Sagiv et al. - 1993
6 A temporal logic specification method supporting hierarchica.. (context) - Barringer, Kuiper - 1984
6 on Principles of Programming Languages (context) - Gabbay, Pnueli et al. - 1980
5 Theoretical issues in the design and analysis of distributed.. (context) - Sistla - 1983
5 regular languages and propositional temporal logic (context) - Peikert - 1985
4 to appear in Information and Computation (context) - Vardi, Wolper - 1994
3 A Medvedev characterization of sets recognized by generalize.. (context) - Costich - 1972
2 linear time temporal logic (context) - Emerson, Halpern - 1986
1 Finite automata on infinite objects (context) - Hayashi - 1985
1 Recursively definite databases (context) - van der Meyden - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.rice.edu/~vardi/papers/index.html): More
An Operational Semantics for Knowledge Bases - Fagin, Halpern, al. (1994) (Correct)
Synthesis with Incomplete Information - Kupferman, Vardi (1997) (Correct)
A New Heuristic for Bad Cycle Detection Using BDDs - Hardin, Kurshan, Shukla, 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