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
Strategic directions in concurrency research
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Weak alternating automata and tree automata emptiness
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Model checking of hierarchical state machines
SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
Formal verification in hardware design: a survey
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Constraints and constraint solving: an introduction
Constraints in computational logics
Constraints in computational logics
Model checking of hierarchical state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Constructing automata from temporal logic formulas: a tutorial
Lectures on formal methods and performance analysis
Nondeterminism and succinctly representable regular languages
SAICSIT '02 Proceedings of the 2002 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology
Deciding LTL over Mazurkiewicz traces
Data & Knowledge Engineering - Special issue: Temporal representation and reasoning
Model and Algorithm for Efficient Verification of High-Assurance Properties of Real-Time Systems
IEEE Transactions on Knowledge and Data Engineering
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
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 '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
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
On the Construction of Automata from Linear Arithmetic Constraints
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 Modal Transition Systems Using Kripke Structures
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Generalized Model Checking: Reasoning about Partial State Spaces
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Alternating-Time Temporal Logic
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
CTL+ is Exponentially more Succinct than CTL
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
Finite automata on timed ω-trees
Theoretical Computer Science
Efficient model checking via the equational /spl mu/-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Relating word and tree automata
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Partial-Order Methods for Model Checking: From Linear Time to Branching Time
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Modal Mu-Calculus for Durational Transition Systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
On feasible cases of checking multi-agent systems behavior
Theoretical Computer Science - Logic and complexity in computer science
The description logic handbook
Automata logics, and infinite games
An Incremental Technique for Automata-Based Decision Procedures
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Model checking communicative agent-based systems
Knowledge-Based Systems
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
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
From Discrete Duration Calculus to Symbolic Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
The weakness of self-complementation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Logic programming approach to automata-based decision procedures
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Model checking freeze LTL over one-counter automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Temporal property verification as a program analysis task
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
On the µ-calculus augmented with sabotage
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Survey: Linear Temporal Logic Symbolic Model Checking
Computer Science Review
Temporal property verification as a program analysis task
Formal Methods in System Design
Improving Partial Order Reductions for Universal Branching Time Properties
Fundamenta Informaticae
Reasoning about nondeterminism in programs
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
| Hi-index | 0.00 |