Datalog LITE: a deductive query language with linear time model checking
ACM Transactions on Computational Logic (TOCL)
An infinite hierarchy of temporal logics over branching time
Information and Computation
Back and forth between guarded and modal logics
ACM Transactions on Computational Logic (TOCL)
Monadic second-order logic on tree-like structures
Theoretical Computer Science
Guarded fixed point logics and the monadic theory of countable trees
Theoretical Computer Science - Complexity and logic
Why so Many Temporal Logics Climb up the Trees?
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Expressive Power of Temporal Logics
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Local Model Checking Games for Fixed Point Logic with Chop
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Model Checking Fixed Point Logic with Chop
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Generalising Automaticity to Modal Properties of Finite Structures
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
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
On Hybrid Systems and the Modal µ-calculus
Hybrid Systems V
From Programs to Games: Invariance and Safety for Bisimulation
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Inflationary Fixed Points in Modal Logic
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Encoding two-valued nonclassical logics in classical logic
Handbook of automated reasoning
Handbook of automated reasoning
Back and Forth between Guarded and Modal Logics
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
On temporal logic versus datalog
Theoretical Computer Science - Logic and complexity in computer science
Counting on CTL: on the expressive power of monadic path logic
Information and Computation
Automata logics, and infinite games
Proof systems for π-calculus logics
Logic for concurrency and synchronisation
Bisimulation and language equivalence
Logic for concurrency and synchronisation
Inflationary fixed points in modal logic
ACM Transactions on Computational Logic (TOCL)
Towards the hierarchical verification of reactive systems
Theoretical Computer Science - Logic, semantics and theory of programming
A classification of symbolic transition systems
ACM Transactions on Computational Logic (TOCL)
An axiomatization of bisimulation quantifiers via the µ-calculus
Theoretical Computer Science
A fixpoint calculus for local and global program flows
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the universal and existential fragments of the μ-calculus
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Automata and fixed point logic: a coalgebraic perspective
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
The monadic theory of finite representations of infinite words
Information Processing Letters
Generalising automaticity to modal properties of finite structures
Theoretical Computer Science
Uniform Interpolation, Bisimulation Quantifiers, and Fixed Points
Logic, Language, and Computation
Model Checking: From Tools to Theory
25 Years of Model Checking
Formal Methods in System Design
Expressiveness of concept expressions in first-order description logics
Artificial Intelligence
Compositional Properties of Sequential Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Automata and fixed point logic: A coalgebraic perspective
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Eliminating recursion in the µ-calculus
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the universal and existential fragments of the µ-calculus
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
On hierarchically developing reactive systems
Information and Computation
Enriching EL-Concepts with Greatest Fixpoints
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Frame definability for classes of trees in the µ-calculus
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Bisimilarity of one-counter processes is PSPACE-complete
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Connection between logical and algebraic approaches to concurrent systems†
Mathematical Structures in Computer Science
The transitive µ-calculus is Büchi definable
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Graph-transformation verification using monadic second-order logic
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
The modal µ-calculus caught off guard
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Logic and games on automatic structures: playing with quantifiers and decompositions
Logic and games on automatic structures: playing with quantifiers and decompositions
Characterizing EF over infinite trees and modal logic on transitive graphs
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Expressive Completeness for LTL With Modulo Counting and Group Quantifiers
Electronic Notes in Theoretical Computer Science (ENTCS)
Branching pushdown tree automata
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
A structural/temporal query language for Business Processes
Journal of Computer and System Sciences
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Weak automata for the linear time µ-calculus
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
The complexity of model checking higher order fixpoint logic
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Sahlqvist theorem for modal fixed point logic
Theoretical Computer Science
On the bisimulation invariant fragment of monadic Σ1 in the finite
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Compositionality of fixpoint logic with chop
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Automata on directed graphs: edge versus vertex marking
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Regular languages of nested words: fixed points, automata, and synchronization
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
A comparison of succinctly represented finite-state systems
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Bisimulation equivalence and regularity for real-time one-counter automata
Journal of Computer and System Sciences
A Characterization Theorem for the Alternation-Free Fragment of the Modal µ-Calculus
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Bisimilarity of Pushdown Automata is Nonelementary
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |