INF-DATALOG, MODAL LOGIC AND COMPLEXITIES

INF-DATALOG, MODAL LOGIC AND COMPLEXITIES (1999)

by Eugénie Foustoucos , Irène Guessarian

Venue:

THEORETICAL INFORMATICS AND APPLICATIONS

1387	Automatic verification of finite-state concurrent systems using temporal logic specifications - Clarke, Emerson, et al. - 1986
1309	Temporal and Modal Logics - Emerson - 1990
249	Efficient model checking in fragments of the propositional mu-calculus - Emerson, Lei - 1986
72	Games for the µ-calculus. - Niwinski, Walukiewicz - 1996
70	An improved algorithm for the evaluation of fixpoint expressions - Browne, Clarke, et al. - 1997
18	Fixpoint alternation: Arithmetic, transition systems, and the binary tree. RAIRO–Theoretical Informatics and Applications, - Bradfield - 1999
10	Datalog LITE: temporal versus deductive reasoning in verification - Gottlob, Grädel, et al.
7	A Linear Time Model Checking Algorithm for the Alternation{Free Modal {Calculus - Cleaveland, Steen - 1993
7	Model checking and the Mu-calculus,” in Descriptive Complexity and Finite Models, ser - Emerson - 1997
3	2004), The Mec 5 modelchecker - Griffault, Vincent
2	Complexity of Monadic inf-datalog. Application to Temporal Logic, Extended abstract - Foustoucos, Guessarian
2	Monadic Datalog and the Expressive - Gottlob, Koch
1	A Linear Algorithm to Solve Fixed-Point - Arnold, Crubillé - 1988