Decidable optimization problems for database logic programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Weak alternating automata and tree automata emptiness
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
An automata-theoretic approach to modular model checking
ACM Transactions on Programming Languages and Systems (TOPLAS)
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
Towards static type checking for XSLT
DocEng '01 Proceedings of the 2001 ACM Symposium on Document engineering
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Two-Way Alternating Automata and Finite Models
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Extended Temporal Logic Revisited
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
The Finite Graph Problem for Two-Way Alternating Automata
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Alternating Automata and Logics over Infinite Words
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Fast LTL to Büchi Automata Translation
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Language Containment Checking with Nondeterministic BDDs
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
From bidirectionality to alternation
Theoretical Computer Science - Mathematical foundations of computer science
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A gap property of deterministic tree languages
Theoretical Computer Science - Logic and complexity in computer science
The description logic handbook
Automata logics, and infinite games
From linear time to branching time
ACM Transactions on Computational Logic (TOCL)
Decidability of infinite-state timed CCP processes and first-order LTL
Theoretical Computer Science - Expressiveness in concurrency
Distributive laws for the coinductive solution of recursive equations
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Complexity results on branching-time pushdown model checking
Theoretical Computer Science
Alternation Elimination by Complementation (Extended Abstract)
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Reasoning in expressive description logics with fixpoints based on automata on infinite trees
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Language-Emptiness Checking of Alternating Tree Automata Using Symbolic Reachability Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
Distributive laws for the coinductive solution of recursive equations
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
PDL with intersection and converse is 2EXP-complete
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
The Büchi complementation saga
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
The weakness of self-complementation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the alternation-free horn µ-calculus
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
The complexity of CTL* + linear past
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Information and Computation
Complementation of coalgebra automata
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
An automata-theoretic approach to infinite-state systems
Time for verification
Alternation removal in büchi automata
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Graded computation tree logic with binary coding
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Relentful strategic reasoning in alternating-time temporal logic
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
The transitive µ-calculus is Büchi definable
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Alternation elimination for automata over nested words
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Improved model checking of hierarchical systems
Information and Computation
The complexity of enriched µ-calculi
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Semi-automatic distributed synthesis
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Reasoning about Co-Büchi tree automata
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Infinite state model-checking of propositional dynamic logics
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Regular linear temporal logic with past
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Model checking for database theoreticians
ICDT'05 Proceedings of the 10th international conference on Database Theory
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Complementation constructions for nondeterministic automata on infinite words
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Complexity results on branching-time pushdown model checking
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
The monadic second order theory of trees given by arbitrary level-two recursion schemes is decidable
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Journal of Computer and System Sciences
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Groups, graphs, languages, automata, games and second-order monadic logic
European Journal of Combinatorics
ACM Transactions on Computational Logic (TOCL)
Model Checking Temporal-Epistemic Logic Using Alternating Tree Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Alternating automata and a temporal fixpoint calculus for visibly pushdown languages
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
How to translate efficiently extensions of temporal logics into alternating automata
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Quantified CTL: expressiveness and model checking
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
What makes ATL* decidable? a decidable fragment of strategy logic
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Propositional dynamic logic with converse and repeat for message-passing systems
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Pushdown module checking with imperfect information
Information and Computation
A type-directed abstraction refinement approach to higher-order model checking
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Synthesis of hierarchical systems
Science of Computer Programming
| Hi-index | 5.23 |