Quantitative program logic and expected time bounds in probabilistic distributed algorithms
Theoretical Computer Science
Model Checking Games for the Alternation-Free µ-Calculus and Alternating Automata
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Games, Probability, and the Quantitative µ-Calculus qMµ
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Small Progress Measures for Solving Parity Games
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On the Power of Labels in Transition Systems
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Undecidability of Weak Bisimilarity for Pushdown Processes
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
On Expressive and Model Checking Power of Propositional Program Logics
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
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 computational complexity of bisimulation, redux
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
Automata logics, and infinite games
Complexity of weak bisimilarity and regularity for BPA and BPP
Mathematical Structures in Computer Science
Towards the hierarchical verification of reactive systems
Theoretical Computer Science - Logic, semantics and theory of programming
Results on the quantitative μ-calculus qMμ
ACM Transactions on Computational Logic (TOCL)
When not losing is better than winning: Abstraction and refinement for the full μ-calculus
Information and Computation
Undecidability of bisimilarity by defender's forcing
Journal of the ACM (JACM)
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
Game Characterizations of Process Equivalences
APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
Solving μ-Calculus Parity Games by Symbolic Planning
Model Checking and Artificial Intelligence
On determinism in modal transition systems
Theoretical Computer Science
Model-Checking Games for Fixpoint Logics with Partial Order Models
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Model Checking for Hybrid Logic
Journal of Logic, Language and Information
Solving Parity Games in Practice
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Teaching Concurrency: Theory in Practice
TFM '09 Proceedings of the 2nd International Conference on Teaching Formal Methods
Model Checking Games for a Fair Branching-Time Temporal Epistemic Logic
AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
Linear Complementarity Algorithms for Infinite Games
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
A Novel Stochastic Game Via the Quantitative μ-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Undecidability of weak bisimilarity for PA-processes
DLT'02 Proceedings of the 6th international conference on Developments in language theory
A Solver for Modal Fixpoint Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Model-checking games for fixpoint logics with partial order models
Information and Computation
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
Proceedings of the forty-third annual ACM symposium on Theory of computing
Parity games on graphs with medium tree-width
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Undecidability results for bisimilarity on prefix rewrite systems
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Multi-valued model checking games
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Multi-valued model checking games
Journal of Computer and System Sciences
Solving parity games by a reduction to SAT
Journal of Computer and System Sciences
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
A subexponential lower bound for the random facet algorithm for parity games
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On sampled semantics of timed systems
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
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 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
Concurrent small progress measures
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
A superpolynomial lower bound for strategy iteration based on snare memorization
Discrete Applied Mathematics
Deciding bisimilarities on distributions
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Hi-index | 0.00 |