vardi Abstract. The ��-calculus can be viewed as essentially the "ultimate" program logic, as it expressively subsumes all propositional program logics, including dynamic logics, process logics, and temporal logics. It is known that the satisfiability problem for the ��-calculus is EXPTIMEcomplete. This upper bound, however, is known for a version of the logic that has only forward modalities, which express weakest preconditions, but not backward modalities, which express strongest postconditions. Our main result in this paper is an exponential time upper bound for the satisfiability problem of the ��-calculus with both forward and backward modalities. To get this result we develop a theory of two-way alternating automata on infinite trees. 1
|
387
|
Automata on infinite objects
– Thomas
- 1990
|
|
373
|
Symbolic model checking: 10 states and beyond
– Burch, Clarke, et al.
- 1992
|
|
294
|
Results on the propositional -calculus
– Kozen
- 1983
|
|
285
|
Propositional dynamic logic of regular programs
– Fischer, Ladner
- 1979
|
|
210
|
P.: An automata-theoretic approach to branching-time model checking
– Bernholtz, Vardi, et al.
- 1994
|
|
176
|
On the synthesis of a reactive module
– Rosner
|
|
164
|
Automata-theoretic techniques for modal logics of programs
– Vardi, Wolper
- 1986
|
|
155
|
Tree automata, mu-calculus and determinacy (Extended abstract
– Emerson, Jutla
- 1991
|
|
143
|
Sometimes” and “Not Never” revisited: on branching versus linear time temporal logic
– Emerson, Clarke
- 1986
|
|
125
|
The complexity of tree automata and logics of programs
– Emerson, Jutla
- 1988
|
|
119
|
Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends
– Pnueli
- 1986
|
|
115
|
The glory of the past
– Lichtenstein, Pnueli, et al.
- 1985
|
|
104
|
A linear-time model-checking algorithm for the alternation-free modal mu-calculus. CAV’91
– Cleaveland, Steffen
|
|
85
|
Characterizing correctness properties of parallel programs using fixpoints, International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 85
– Emerson, Clarke
- 1980
|
|
71
|
On the complexity of !-automata
– Safra
- 1988
|
|
71
|
A temporal fixpoint calculus
– Vardi
- 1988
|
|
67
|
On model-checking for fragments of -calculus
– Emerson, Jutla, et al.
- 1993
|
|
67
|
Modalities for model checking: branching time logic strikes back
– Emerson, Lei
- 1987
|
|
62
|
An automata theoretic decision procedure for the propositional mu-calculus
– Streett, Emerson
- 1989
|
|
60
|
Infinitary logic and inductive definability over finite structures
– Dawar, Lindell, et al.
- 1995
|
|
57
|
and P.E.Schupp. Alternating automata on infinite trees
– Muller
- 1987
|
|
49
|
In transition from global to modular temporal reasoning about programs,” Logics and models of concurrent systems
– Pnueli
- 1985
|
|
48
|
On the complexity of bounded-variable queries
– Vardi
- 1995
|
|
35
|
Concept language with number restrictions and fixpoints, and its relationship with mu-calculus
– Giacomo, Lenzerini
- 1994
|
|
34
|
Methodology and system for practical formal verification of reactive hardware
– Beer, Ben-David, et al.
|
|
33
|
A Temporal Logic for Reasoning about Partially Ordered Computations
– Pinter, Wolper
- 1984
|
|
32
|
From prehistoric to postmodern symbolic model checking
– Henzinger, Kupferman, et al.
- 1998
|
|
30
|
Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time
– Muller, Saoudi, et al.
- 1988
|
|
30
|
A note on model checking the modal -calculus
– Winskel
- 1989
|
|
29
|
Efficient local model-checking for fragments of the modal mu-calculus
– Bhat, Cleaveland
- 1996
|
|
29
|
Propositional Dynamic Logic of Looping and Converse
– Streett
- 1982
|
|
29
|
Improved upper and lower bounds for modal logics of programs
– Vardi, Stockmeyer
- 1985
|
|
27
|
Weak alternating automata and tree automata emptiness
– Kupferman, Vardi
- 1998
|
|
22
|
Yet another process logic
– Vardi, Wolper
- 1983
|
|
21
|
A finite model theorem for the propositional -calculus
– Kozen
- 1988
|
|
19
|
Description logics with inverse roles, functional restrictions, and n-ary relations
– Giacomo, Lenzerini
- 1994
|
|
19
|
Tableaux and algorithms for propositional dynamic logic with converse
– Giacomo, Massacci
- 1996
|
|
15
|
Once and for all
– Kupferman, Pnueli
|
|
15
|
Alternating tree automata
– Slutzki
- 1985
|
|
14
|
Exponential determinization for !-automata with strong-fairness acceptance condition
– Safra
- 1992
|
|
14
|
The taming of converse: Reasoning about two-way computations
– Vardi
- 1985
|
|
12
|
Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics
– Vardi
- 1997
|
|
10
|
A decision procedure for the propositional -calculus
– Kozen, Parikh
- 1984
|
|
8
|
On the expressive power of variable-confined logics
– Kolaitis, Vardi
- 1996
|
|
8
|
What makes modal logic so robustly decidable
– Vardi
- 1997
|
|
5
|
Finiteness is ��-ineffable
– Park
- 1976
|
|
4
|
Determinization and memoryless winning strategies
– Jutla
- 1997
|
|
3
|
The decision problem for 2-variable first-order logic
– Kolaitis, Vardi
- 1997
|
|
2
|
Undecidability results for two-variable logics. Unpublished manuscript
– Gradel, Otto, et al.
- 1996
|
|
2
|
A decidable -calculus: Preliminary report
– Pratt
- 1982
|
|
