“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Reasoning about fair concurrent programs
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Improved upper and lower bounds for modal logics of programs
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Efficient temporal reasoning (extended abstract)
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the complexity of bounded-variable queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Complexity of weak acceptance conditions in tree automata
Information Processing Letters
Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Handbook of automated reasoning
Relating word and tree automata
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Memoryless determinacy of parity and mean payoff games: a simple proof
Theoretical Computer Science
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Tighter Bounds for the Determinisation of Büchi Automata
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Model checking-based genetic programming with an application to mutual exclusion
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
An automata-theoretic approach to infinite-state systems
Time for verification
Reasoning about finite-state switched systems
HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing
The modal µ-calculus caught off guard
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Safraless compositional synthesis
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Automatic verification of parameterized data structures
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On the complexity of parity games
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
| Hi-index | 0.00 |