STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A general result on infinite trees and its applications
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Undecidability of a multi-agent logic
Fundamenta Informaticae - Concurrency specification and programming
Decidability and undecidability in stand-alone feature logics
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
TARK '90 Proceedings of the 3rd conference on Theoretical aspects of reasoning about knowledge
Reasoning about real-time statecharts in the presence of semantic variations
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Iteration-free PDL with Intersection: a Complete Axiomatization
Fundamenta Informaticae
Highly Undecidable Problems about Recognizability by Tiling Systems
Fundamenta Informaticae - Machines, Computations and Universality, Part II
$\mathcal{CL}$: An Action-Based Logic for Reasoning about Contracts
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
A universally defined undecidable unimodal logic
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Standing on the shoulders of a giant: one persons experience of turings impact
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Highly Undecidable Problems about Recognizability by Tiling Systems
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Iteration-free PDL with Intersection: a Complete Axiomatization
Fundamenta Informaticae
| Hi-index | 0.00 |