An automata-theoretical characterization of the OI-hierarchy
Information and Control
Decidability of bisimulation equivalence for process generating context-free languages
Journal of the ACM (JACM)
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM (JACM)
Journal of the ACM (JACM)
L(A) = L(B)? decidability results from complete formal systems
Theoretical Computer Science
Modal and temporal properties of processes
Modal and temporal properties of processes
L(A)=L(B)? a simplified decidability proof
Theoretical Computer Science
On Infinite Terms Having a Decidable Monadic Theory
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Deciding DPDA Equivalence Is Primitive Recursive
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Decidability of All Minimal Models
TYPES '95 Selected papers from the International Workshop on Types for Proofs and Programs
Linear Interpolation for the Higher-Order Matching Problem
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Higher-Order Pushdown Trees Are Easy
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Higher-Order Matching and Tree Automata
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Decidability of fourth-order matching
Mathematical Structures in Computer Science
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Encoding of the halting problem into the monster type and applications
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
A game-theoretic approach to deciding higher-order matching
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Safety is not a restriction at level 2 for string languages
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
We consider the transfer of verification techniques to structures with binding.