Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
This paper isolates a class (of problems specified by) "monotone monadic SNP without inequality" which may exhibit a dichotomy, and explains the placing of all these restrictions by showing, essentially using Ladner's theorem, that classes obtained by using only two of the above three restrictions do not show this dichotomy.
The complexity of relational query languages (Extended Abstract)
- Moshe Y. Vardi
- Computer ScienceSTOC '82
- 5 May 1982
The pattern which will be shown is that the expression complexity of the investigated languages is one exponential higher then their data complexity, and for both types of complexity the authors show completeness in some complexity class.
Simple on-the-fly automatic verification of linear temporal logic
A tableau-based algorithm for obtaining an automaton from a temporal logic formula that can be constructed simultaneously with, and guided by, the generation of the model, and which can be used in model checking in an “on-the-fly” fashion.
An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report)
Parametric real-time reasoning
This work addresses the more realistic and more ambitious problem of deriving symbolic constraints on the timing properties required of real-time systems by introducing parametric timed automata whose transitions are constrained with parametric timing requirements.
An automata-theoretic approach to branching-time model checking
It is shown that alternating tree automata are the key to a comprehensive automata-theoretic framework for branching temporal logics, and can be used to obtain optimal decision procedures and make it possible to derive optimal model-checking algorithms.
Reasoning about The Past with Two-Way Automata
- Moshe Y. Vardi
- Computer Science, PhilosophyICALP
- 13 July 1998
The main result in this paper is an exponential time upper bound for the satisfiability problem of the Μ-calculus with both forward and backward modalities, developed a theory of two-way alternating automata on infinite trees.
Linear Temporal Logic and Linear Dynamic Logic on Finite Traces
This paper shows that LTLf, i.e., LTL under this assumption, is less expressive than what might appear at first sight, and proposes a logic, LDLf for Linear Dynamic Logic over finite traces, which borrows the syntax from Propositional Dynamic Logic (PDL), but is interpreted over finite trace.
Reasoning About Infinite Computations
This work investigates extensions of temporal logic by connectives defined by finite automata on infinite words and shows that they do not increase the expressive power of the logic or the complexity of the decision problem.
An Automata-Theoretic Approach to Linear Temporal Logic
- Moshe Y. Vardi
- Computer ScienceBanff Higher Order Workshop
- 1 April 1996
The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis and considers the relationships between programs and their specifications as relationships between languages.