“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Improved upper and lower bounds for modal logics of programs
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
A branching time logic with past operators
Journal of Computer and System Sciences
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Expressing interesting properties of programs in propositional temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Extended Temporal Logic Revisited
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Expressive Power of Temporal Logics
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Efficient model checking via the equational /spl mu/-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Arity hierarchy for temporal logics
Theoretical Computer Science
25 Years of Model Checking
From Philosophical to Industrial Logics
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
On the expressive power of QLTL
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Propositional projection temporal logic, Büchi automata and ω-regular expressions
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Pillars of computer science
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
Expressiveness of propositional projection temporal logic with star
Theoretical Computer Science
State/Event software verification for branching-time specifications
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
Hi-index | 0.00 |