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

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

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

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

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

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

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