On the complexity of bounded-variable queries (extended abstract)
PODS '95 Proceedings of the fourteenth 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
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
On the Relationship Between BDI Logics and Standard Logics of Concurrency
Autonomous Agents and Multi-Agent Systems
A linear time special case for MC Games
Fundamenta Informaticae
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Is Your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Local Parallel Model Checking for the Alternation-Free µ-Calculus
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
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
Symbolic Strategy Synthesis for Games on Pushdown Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Symbolic Model Checking for Rectangular Hybrid Systems
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Model Checking: A Tutorial Overview
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
A Discrete Subexponential Algorithm for Parity Games
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Small Progress Measures for Solving Parity Games
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A Classification of Symbolic Transition Systems
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Symbolic Algorithms for Infinite-State Games
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Probabilistic Temporal Logics via the Modal Mu-Calculus
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
CTL+ is Exponentially more Succinct than CTL
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
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
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Efficient Model Checking Via Büchi Tableau Automata
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Infinite Games and Verification (Extended Abstract of a Tutorial)
CAV '02 Proceedings of the 14th 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
On the Relationship Between BDI Logics and Standard Logics of Concurrency
ATAL '98 Proceedings of the 5th International Workshop on Intelligent Agents V, Agent Theories, Architectures, and Languages
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
An Approximation Semantics for the Propositional Mu-Calculus
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Model checking: a tutorial overview
Modeling and verification of parallel processes
Handbook of automated reasoning
A Modal Mu-Calculus for Durational Transition Systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Incremental Verification of Architecture Specification Language for Real-Time Systems
WORDS '97 Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
A gap property of deterministic tree languages
Theoretical Computer Science - Logic and complexity in computer science
Automata logics, and infinite games
Memoryless determinacy of parity and mean payoff games: a simple proof
Theoretical Computer Science
Quantitative stochastic parity games
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A classification of symbolic transition systems
ACM Transactions on Computational Logic (TOCL)
Combining supervisor synthesis and model checking
ACM Transactions on Embedded Computing Systems (TECS)
Reduced Models for Efficient CCS Verification
Formal Methods in System Design
A deterministic subexponential algorithm for solving parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the universal and existential fragments of the μ-calculus
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
The expressivity of XPath with transitive closure
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
Discrete Applied Mathematics
When not losing is better than winning: Abstraction and refinement for the full μ-calculus
Information and Computation
Modeling and Model Checking Software Product Lines
FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
A CSP-Based Approach for Solving Parity Game
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Algorithms for Solving Infinite Games
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Model checking communicative agent-based systems
Knowledge-Based Systems
Facets of Synthesis: Revisiting Church's Problem
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Model Checking Communicative Agent-Based Systems
Proceedings of the 2007 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the sixth SoMeT_07
Hard problems in max-algebra, control theory, hypergraphs and other areas
Information Processing Letters
A Tableau System for the Modal μ-Calculus
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Linear Complementarity Algorithms for Infinite Games
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Deciding Nondeterministic Hierarchy of Deterministic Tree Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Obtaining Memory-Efficient Solutions to Boolean Equation Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Representing and verifying temporal epistemic properties in multi-agent systems
CLIMA VII'06 Proceedings of the 7th international conference on Computational logic in multi-agent systems
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Discounting the future in systems theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
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
An accelerated algorithm for 3-color parity games with an application to timed games
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Solving parity games in big steps
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
An automata-theoretic approach to infinite-state systems
Time for verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Energy and mean-payoff games with imperfect information
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Non-oblivious strategy improvement
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Model checking in the modal µ-calculus and generic solutions
Journal of Symbolic Computation
Faster algorithms for mean-payoff games
Formal Methods in System Design
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
Proceedings of the forty-third annual ACM symposium on Theory of computing
The complexity of integer bound propagation
Journal of Artificial Intelligence Research
Parity games on graphs with medium tree-width
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Extracting winning strategies in update games
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Verifying real-time temporal, cooperation and epistemic properties for uncertain agents
MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
Rational behaviour and strategy construction in infinite multiplayer games
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
On the µ-calculus augmented with sabotage
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Parity games played on transition graphs of one-counter processes
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Solving games without determinization
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
A subexponential lower bound for the random facet algorithm for parity games
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Solving alternating boolean equation systems in answer set programming
INAP'04/WLP'04 Proceedings of the 15th international conference on Applications of Declarative Programming and Knowledge Management, and 18th international conference on Workshop on Logic Programming
Time and parallelizability results for parity games with bounded treewidth
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
A Linear Time Special Case for MC Games
Fundamenta Informaticae
Theoretical Computer Science
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
A formal approach to software product families
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Deciding monotone duality and identifying frequent itemsets in quadratic logspace
Proceedings of the 32nd symposium on Principles of database systems
A superpolynomial lower bound for strategy iteration based on snare memorization
Discrete Applied Mathematics
Passive code in synchronous programs
ACM Transactions on Embedded Computing Systems (TECS) - Special Section ESFH'12, ESTIMedia'11 and Regular Papers
Alternating traps in Muller and parity games
Theoretical Computer Science
A note on the approximation of mean-payoff games
Information Processing Letters
| Hi-index | 0.01 |