#### Filter Results:

- Full text PDF available (423)

#### Publication Year

1979

2017

- This year (21)
- Last 5 years (162)
- Last 10 years (302)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Organism

Learn More

- Tomás Feder, Moshe Y. Vardi
- SIAM J. Comput.
- 1998

This paper starts with the project of finding a large subclass of NP which exhibits a dichotomy. The approach is to find this subclass via syntactic prescriptions. While, the paper does not achieve this goal, it does isolate a class (of problems specified by) “Monotone Monadic SNP without inequality” which may exhibit this dichotomy. We justify the placing… (More)

- Moshe Y. Vardi
- STOC
- 1982

Two complexity measures for query languages are proposed. <italic>Data complexity</italic> is the complexity of evaluating a query in the language as a function of the size of the database, and <italic>expression complexity</italic> is the complexity of evaluating a query in the language as a function of the size of the expression defining the query. We… (More)

- Moshe Y. Vardi, Pierre Wolper
- LICS
- 1986

- Rob Gerth, Doron A. Peled, Moshe Y. Vardi, Pierre Wolper
- PSTV
- 1995

We present a tableau-based construction for obtaining an automaton from a temporal logic formula in an “on-the-fly” fashion. That is, the automaton can be constructed simultaneously with, and guided by, the generation of the model. In particular, it is possible to detect that a property does not hold by only constructing part of the model and of the… (More)

- Moshe Y. Vardi, Pierre Wolper
- Inf. Comput.
- 1994

- Orna Kupferman, Moshe Y. Vardi, Pierre Wolper
- J. ACM
- 2000

Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing linear-time model-checking, and for obtaining many extensions and improvements to this verification method. On the other hand, for branching temporal logic, automata-theoretic techniques have long been thought to introduce an exponential penalty,… (More)

- Moshe Y. Vardi
- Banff Higher Order Workshop
- 1995

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… (More)

- Rajeev Alur, Thomas A. Henzinger, Moshe Y. Vardi
- STOC
- 1993

Traditional approaches to the algorithmic veri cation of real-time systems are limited to checking program correctness with respect to concrete timing properties (e.g., \message delivery within 10 milliseconds"). We address the more realistic and more ambitious problem of deriving symbolic constraints on the timing properties required of real-time systems… (More)

- Orna Kupferman, Moshe Y. Vardi
- Formal Methods in System Design
- 1999

Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. Proof rules for the verification of safety properties have been developed in the proof-based approach to verification, making verification of safety properties simpler than verification of general properties. In this paper… (More)