Deciding the First Level of the µ-Calculus Alternation Hierarchy
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
From Programs to Games: Invariance and Safety for Bisimulation
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Automata logics, and infinite games
Mu-depth 3 is more than 2: a game-theoretic proof
Mathematical Structures in Computer Science
The alternation hierarchy in fixpoint logic with chop is strict too
Information and Computation
Automatic verification of sequential infinite-state processes
Automatic verification of sequential infinite-state processes
Fo(fd): Extending classical logic with rule-based fixpoint definitions
Theory and Practice of Logic Programming
Weak automata for the linear time µ-calculus
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Hi-index | 0.00 |