Expressiveness of structured document query languages based on attribute grammars
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Weak alternating automata and tree automata emptiness
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Existential second-order logic over strings
Journal of the ACM (JACM)
Expressive and efficient pattern languages for tree-structured data (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
MSO definable string transductions and two-way finite-state transducers
ACM Transactions on Computational Logic (TOCL)
A Web Odyssey: from Codd to XML
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Extended path expressions of XML
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML with data values: typechecking revisited
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Constraints in computational logics
Efficient minimization of deterministic weak &ohgr;-automata
Information Processing Letters
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Expressiveness of structured document query languages based on attribute grammars
Journal of the ACM (JACM)
Monadic datalog and the expressive power of languages for web information extraction
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Monadic second-order logic on tree-like structures
Theoretical Computer Science
Query automata over finite trees
Theoretical Computer Science
The evaluation of first-order substitution is monadic second-order compatible
Theoretical Computer Science
A formal model for an expressive fragment of XSLT
Information Systems - Databases: Creation, management and utilization
Complexity of weak acceptance conditions in tree automata
Information Processing Letters
A linear time special case for MC Games
Fundamenta Informaticae
On infinite transition graphs having a decidable monadic theory
Theoretical Computer Science
Uniform and nonuniform recognizability
Theoretical Computer Science
On Capturing First-Order Topological Properties of Planar Spatial Databases
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Towards Regular Languages over Infinite Alphabets
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On Infinite Terms Having a Decidable Monadic Theory
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Automata and Games for Synthesis
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Two-Way Finite State Transducers and Monadic Second-Order Logic
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
On Deciding if Deterministic Rabin Language Is in Büchi Class
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Two-Way Alternating Automata and Finite Models
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On Families of Graphs Having a Decidable First Order Theory with Reachability
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Complete and Tractable Local Linear Time Temporal Logics over Traces
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On the Power of Tree-Walking Automata
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Model Checking: A Tutorial Overview
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Weak Alternating Automata in Isabelle/HOL
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Axiomatising Tree-Interpretable Structures
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Timed Control Synthesis for External Specifications
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Open Systems in Reactive Environments: Control and Synthesis
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Expressive Power of Temporal Logics
CONCUR '02 Proceedings of the 13th 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
Higher-Order Pushdown Trees Are Easy
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Optimal Bounds for Transformations of omega-Automata
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Beyond Message Sequence Graphs
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Dynamic Message Sequence Charts
FST TCS '02 Proceedings of the 22nd Conference Kanpur 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
Verification of Sets of Infinite State Processes Using Program Transformation
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Calendars, Time Granularities, and Automata
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Implementation of a Strategy Improvement Algorithm for Finite-State Parity Games
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
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
A Formal Model for an Expressive Fragment of XSLT
CL '00 Proceedings of the First International Conference on Computational Logic
A Theory of Restrictions for Logics and Automata
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Model Checking LTL Properties of High-Level Petri Nets with Fairness Constraints
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Infinite Games and Verification (Extended Abstract of a Tutorial)
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A Short Introduction to Infinite Automata
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Decision Procedure for an Extension of WS1S
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Trading Probability for Fairness
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Solving Pushdown Games with a Sigma3 Winning Condition
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
Extensions of Attribute Grammars for Structured Document Queries
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
Synthesizing Distributed Finite-State Systems from MSCs
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Model checking: a tutorial overview
Modeling and verification of parallel processes
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
Typechecking XML views of relational databases
ACM Transactions on Computational Logic (TOCL)
Learning power and language expressiveness
Theoretical Computer Science - Australasian computer science
Handbook of automated reasoning
Borel hierarchy and omega context free languages
Theoretical Computer Science
Towards a language theory for infinite N-free pomsets
Theoretical Computer Science
A Complete Axiomatization of Interval Temporal Logic with Infinite Time
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
On the power of tree-walking automata
Information and Computation - Special issue: ICC '99
XML with data values: typechecking revisited
Journal of Computer and System Sciences - Special issu on PODS 2001
Games for synthesis of controllers with partial observation
Theoretical Computer Science - Logic and complexity in computer science
A gap property of deterministic tree languages
Theoretical Computer Science - Logic and complexity in computer science
Definable relations and first-order query languages over strings
Journal of the ACM (JACM)
UML for real
Journal of Automata, Languages and Combinatorics
Note: a descriptive complexity approach to the linear hierarchy
Theoretical Computer Science
Automata logics, and infinite games
Monadic datalog and the expressive power of languages for Web information extraction
Journal of the ACM (JACM)
Theoretical Computer Science
Quantitative stochastic parity games
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
Logic-based web information extraction
ACM SIGMOD Record
On the logical definability of centrain graph and poset languages
Journal of Automata, Languages and Combinatorics
The Lixto data extraction project: back and forth between theory and practice
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A characterization of first-order topological properties of planar spatial data
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Attribute grammars for unranked trees as a query language for structured documents
Journal of Computer and System Sciences
Relativizations for the Logic-Automata Connection
Higher-Order and Symbolic Computation
Two-player nonzero-sum ω-regular games
CONCUR 2005 - Concurrency Theory
The complexity of quantitative concurrent parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A theory of regular MSC languages
Information and Computation
A compositional trace logic for behavioural interface specifications
Nordic Journal of Computing
A characterization of first-order topological properties of planar spatial data
Journal of the ACM (JACM)
Modular strategies for recursive game graphs
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
On the expressive power of monadic least fixed point logic
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Message-passing automata are expressively equivalent to EMSO logic
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Ambiguous classes in µ-calculi hierarchies
Theoretical Computer Science - Foundations of software science and computation structures
Experiments with deterministic ω-automata for formulas of linear temporal logic
Theoretical Computer Science - Implementation and application of automata
Observations on determinization of Büchi automata
Theoretical Computer Science - Implementation and application of automata
Journal of Computer and System Sciences
Infinity problems and countability problems for ω-automata
Information Processing Letters
On decidability properties of local sentences
Theoretical Computer Science - Logic, language, information and computation
Theoretical Computer Science - Components and objects
A Logic Framework for Verification of Timed Algorithms
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Logical definability and query languages over ranked and unranked trees
ACM Transactions on Computational Logic (TOCL)
Compact and tractable automaton-based representations of time granularities
Theoretical Computer Science
A framework for decentralized access control
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Classifying regular languages by a split game
Theoretical Computer Science
Generalising automaticity to modal properties of finite structures
Theoretical Computer Science
Weighted automata and weighted logics
Theoretical Computer Science
Tight lower bounds for query processing on streaming and external memory data
Theoretical Computer Science
On deciding well-definedness for query languages on trees
Journal of the ACM (JACM)
A crash course on database queries
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Concurrent games with tail objectives
Theoretical Computer Science
Reduction of stochastic parity to stochastic mean-payoff games
Information Processing Letters
Journal of Computer and System Sciences
Continuous Separation of Game Languages
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Effective characterizations of tree logics
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Complexity of Topological Properties of Regular ω-Languages
Fundamenta Informaticae
Muller message-passing automata and logics
Information and Computation
A note on partially ordered tree automata
Information Processing Letters
An Incremental Technique for Automata-Based Decision Procedures
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Controller Synthesis with Budget Constraints
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Trading Infinite Memory for Uniform Randomness in Timed Games
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
25 Years of Model Checking
Complexity of Aperiodicity for Topological Properties of Regular ω-Languages
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Positional Strategies for Higher-Order Pushdown Parity Games
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Strategy Construction for Parity Games with Imperfect Information
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
An Infinite Automaton Characterization of Double Exponential Time
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Timed Parity Games: Complexity and Robustness
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Complexity of Topological Properties of Regular ω-Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
The Compositional Method and Regular Reachability
Electronic Notes in Theoretical Computer Science (ENTCS)
Types and higher-order recursion schemes for verification of higher-order programs
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Probabilistic Acceptors for Languages over Infinite Words
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Games on Multi-stack Pushdown Systems
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
A Kleene Theorem for Forest Languages
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Linear delay enumeration and monadic second-order logic
Discrete Applied Mathematics
Pomset Languages of Finite Step Transition Systems
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
A Survey of Stochastic Games with Limsup and Liminf Objectives
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Note: Existential MSO over two successors is strictly weaker than over linear orders
Theoretical Computer Science
The Effect of Tossing Coins in Omega-Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Finitary winning in ω-regular games
ACM Transactions on Computational Logic (TOCL)
Games on Higher Order Multi-stack Pushdown Systems
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Weighted automata and weighted logics with discounting
Theoretical Computer Science
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Artificial Intelligence
On Recognizable Tree Languages Beyond the Borel Hierarchy
Fundamenta Informaticae
On Decidability Properties of Local Sentences
Electronic Notes in Theoretical Computer Science (ENTCS)
Fragments of Monadic Second-Order Logics Over Word Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
Deciding Nondeterministic Hierarchy of Deterministic Tree Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Locality of Queries and Transformations
Electronic Notes in Theoretical Computer Science (ENTCS)
Rewriting-Based Navigation of Web Sites: Looking for Models and Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
A theory of regular MSC languages
Information and Computation
Deciding monadic theories of hyperalgebraic trees
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Ambiguous classes in the games µ-calculus hierarchy
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Higher order pushdown automata, the Caucal hierarchy of graphs and parity games
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On equivalent representations of infinite structures
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Monadic second-order logics with cardinalities
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Optimal strategy synthesis in stochastic Müller games
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Symbolic synthesis of finite-state controllers for request-response specifications
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Existential heap abstraction entailment is undecidable
SAS'03 Proceedings of the 10th international conference on Static analysis
Combining logic programs and monadic second order logics by program transformation
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
A temporal approach to specification and verification of pointer data-structures
FASE'03 Proceedings of the 6th international conference on Fundamental approaches to software engineering
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Eliminating recursion in the µ-calculus
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Modular strategies for recursive game graphs
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Cardinality constraints in disjunctive deductive databases
Proceedings of the 2nd international conference on Semantics in databases
On first-order fragments for words and Mazurkiewicz traces: a survey
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Recognizable tree series with discounting
Acta Cybernetica
On-the-fly stuttering in the construction of deterministic ω-automata
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Weighted automata and weighted logics with discounting
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Logic programming approach to automata-based decision procedures
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Stochastic Müller games are PSPACE-complete
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Model-checking ω-regular properties of interval Markov chains
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
On the Borel Complexity of MSO Definable Sets of Branches
Fundamenta Informaticae - Bridging Logic and Computer Science: to Johann A. Makowsky for his 60th birthday
Information and Computation
ACM Transactions on Computational Logic (TOCL)
Craig interpolation for linear temporal languages
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Logic and rational languages of words indexed by linear orderings
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Monadic datalog over finite structures of bounded treewidth
ACM Transactions on Computational Logic (TOCL)
Strategy construction for parity games with imperfect information
Information and Computation
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Qualitative analysis of partially-observable Markov decision processes
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Describing average- and longtime-behavior by weighted MSO logics
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Probabilistic XML via Markov Chains
Proceedings of the VLDB Endowment
The complexity of partial-observation parity games
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
On the satisfiability of two-variable logic over data words
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
On model checking techniques for randomized distributed systems
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Theoretical Computer Science
Value joins are expensive over (probabilistic) XML
Proceedings of the 4th International Workshop on Logic in Databases
Synthesis of memory-efficient "real-time" controllers for safety objectives
Proceedings of the 14th international conference on Hybrid systems: computation and control
Decidable expansions of labelled linear orderings
Fields of logic and computation
The model checking problem for prefix classes of second-order logic: a survey
Fields of logic and computation
On Monadic theories of monadic predicates
Fields of logic and computation
Relational transducers for declarative networking
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Weighted muller tree automata and weighted logics
Journal of Automata, Languages and Combinatorics
Łukasiewicz logic and weighted logics over MV-semirings
Journal of Automata, Languages and Combinatorics
MSO logics for weighted timed automata
Formal Methods in System Design
Synthesis for regular specifications over unbounded domains
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Shared-memory systems and charts
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Green's relations and their use in automata theory
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
The complexity of request-response games
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Regular languages of words over countable linear orderings
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Logic and games on automatic structures: playing with quantifiers and decompositions
Logic and games on automatic structures: playing with quantifiers and decompositions
Languages vs. ω-languages in regular infinite games
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Symbolic algorithms for qualitative analysis of Markov decision processes with Buchi objectives
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Compositional failure detection in structured transition systems
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Energy and mean-payoff parity markov decision processes
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Weak cost monadic logic over infinite trees
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
On memoryless quantitative objectives
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Efficient decision procedures for heaps using STRAND
SAS'11 Proceedings of the 18th international conference on Static analysis
Efficient computation of queries on feature streams
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Minimum attention controller synthesis for omega-regular objectives
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Branching pushdown tree automata
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
An O(n2) time algorithm for alternating Büchi games
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Nested pebbles and transitive closure
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Strategy improvement and randomized subexponential algorithms for stochastic parity games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Propositional dynamic logic with recursive programs
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
The complexity of enriched µ-calculi
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Lower bounds for complementation of ω-automata via the full automata technique
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Logics for unranked trees: an overview
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Weighted automata and weighted logics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The complexity of stochastic rabin and streett games
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Unsafe grammars and panic automata
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Journal of the ACM (JACM)
Regular sets over extended tree structures
Theoretical Computer Science
Model-checking hierarchical structures
Journal of Computer and System Sciences
A survey of stochastic ω-regular games
Journal of Computer and System Sciences
Concurrent games with tail objectives
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Nash equilibrium for upward-closed objectives
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Algorithms for omega-regular games with imperfect information
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
An algebraic point of view on the crane beach property
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Decidable theories of the ordering of natural numbers with unary predicates
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Composition of services with nondeterministic observable behavior
ICSOC'05 Proceedings of the Third international conference on Service-Oriented Computing
A formal comparison of visual web wrapper generators
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Spatio-temporal model checking for mobile real-time systems
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
The language theory of bounded context-switching
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The complexity of stochastic Müller games
Information and Computation
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Truly on-the-fly LTL model checking
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
An algorithm for deciding BAPA: boolean algebra with presburger arithmetic
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
On deciding topological classes of deterministic tree languages
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Asynchronous automata-theoretic characterization of aperiodic trace languages
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Decidability of MSO theories of tree structures
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Strategy improvement for stochastic rabin and streett games
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Equivalence and inclusion problem for strongly unambiguous büchi automata
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Chomsky-Schützenberger-type characterization of multiple context-free languages
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Weighted automata and weighted logics on infinite words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Weighted tree automata over valuation monoids and their characterization by weighted logics
Algebraic Foundations in Computer Science
Experiments with deterministic ω-automata for formulas of linear temporal logic
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Observations on determinization of büchi automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Finitary winning in ω-regular games
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Games and markov decision processes with mean-payoff parity and energy parity objectives
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Synthesizing protocols for digital contract signing
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Foundations of XML based on logic and automata: a snapshot
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Feasible automata for two-variable logic with successor on data words
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Patterns with bounded treewidth
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Deciding twig-definability of node selecting tree automata
Proceedings of the 15th International Conference on Database Theory
On topological completeness of regular tree languages
Logic and Program Semantics
Steedman's temporality proposal and finite automata
AC'11 Proceedings of the 18th Amsterdam colloquim conference on Logic, Language and Meaning
Partial-Observation Stochastic Games: How to Win When Belief Fails
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Decidable Problems for Probabilistic Automata on Infinite Words
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
An Automata Model for Trees with Ordered Data Values
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
On the Generative Power of ω-Grammars and ω-Automata
Fundamenta Informaticae
On Recognizable Tree Languages Beyond the Borel Hierarchy
Fundamenta Informaticae
Complexity of Topological Properties of Regular ω-Languages
Fundamenta Informaticae
Multi-Valued MSO Logics OverWords and Trees
Fundamenta Informaticae
Word automaticity of tree automatic scattered linear orderings is decidable
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Continuous Separation of Game Languages
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Locality and the complexity of minimalist derivation tree languages
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Model checking stochastic branching processes
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
A Logic Framework for Verification of Timed Algorithms
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
A Linear Time Special Case for MC Games
Fundamenta Informaticae
Fundamenta Informaticae
Theoretical Computer Science
Factorisation forests for infinite words application to countable scattered linear orderings
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Logical refinements of Church's problem
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
MSO on the infinite binary tree: choice and order
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Boundedness of monadic FO over acyclic structures
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Regular languages of nested words: fixed points, automata, and synchronization
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
A combinatorial theorem for trees applications to monadic logic and infinite structures
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Weighted automata and weighted MSO logics for average and long-time behaviors
Information and Computation
Strategy synthesis for multi-dimensional quantitative objectives
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Quantified CTL: expressiveness and model checking
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Equivalence of games with probabilistic uncertainty and partial-observation games
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Walk logic as a framework for path query languages on graph databases
Proceedings of the 16th International Conference on Database Theory
Subshifts as models for MSO logic
Information and Computation
Model Checking Higher-Order Programs
Journal of the ACM (JACM)
Verified decision procedures for MSO on words based on derivatives of regular expressions
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Programming macro tree transducers
Proceedings of the 9th ACM SIGPLAN workshop on Generic programming
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
Formal Methods in System Design
Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems
Information and Computation
Complexity of two-variable logic on finite trees
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Algebras, automata and logic for languages of labeled birooted trees
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Faster algorithms for markov decision processes with low treewidth
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Minimization of symbolic automata
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Linear temporal logic and linear dynamic logic on finite traces
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Automated grading of DFA constructions
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Extending two-variable logic on data trees with order on data values and its automata
ACM Transactions on Computational Logic (TOCL)
Theory of Computing Systems
Theory of Computing Systems
A survey of partial-observation stochastic parity games
Formal Methods in System Design
Forcing MSO on Infinite Words in Weak MSO
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Quantitative Monadic Second-Order Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.02 |