Simulation preorder over simple process algebras
Information and Computation
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds
FoSSaCS '02 Proceedings of the 5th 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
Equivalence-Checking with Infinite-State Systems: Techniques and Results
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Infinite Games and Verification (Extended Abstract of a Tutorial)
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Interface Compatibility Checking for Software Modules
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata
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
Automatic verification of recursive procedures with one integer parameter
Theoretical Computer Science - Mathematical foundations of computer science
Note on winning positions on pushdown games with ω-regular conditions
Information Processing Letters
Automata logics, and infinite games
DP Lower bounds for equivalence-checking and model-checking of one-counter automata
Information and Computation
Analysis of recursive state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A fixpoint calculus for local and global program flows
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Equivalence-checking on infinite-state systems: Techniques and results
Theory and Practice of Logic Programming
Modular strategies for recursive game graphs
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Games with winning conditions of high Borel complexity
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
On the positional determinacy of edge-labeled games
Theoretical Computer Science
On Effective Methods for Diagnosis of Retaining Faults in Circuits
Fundamenta Informaticae
Inverse monoids: Decidability and complexity of algebraic questions
Information and Computation
Reachability in recursive Markov decision processes
Information and Computation
Model Checking: From Tools to Theory
25 Years of Model Checking
Verifying liveness for asynchronous programs
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Games on Multi-stack Pushdown Systems
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
LTL with the freeze quantifier and register automata
ACM Transactions on Computational Logic (TOCL)
Analyzing recursive programs using a fixed-point calculus
Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
Games on Higher Order Multi-stack Pushdown Systems
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Methods for Quantitative Analysis of Probabilistic Pushdown Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Complete SAT-based model checking for context-free processes
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Information and Computation
Model checking FO(R) over one-counter processes and beyond
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
A CTL-based logic for program abstractions
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Extended computation tree logic
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
The complexity of request-response games
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Krivine machines and higher-order schemes
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Software model checking using languages of nested trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Trust metrics for the SPKI/SDSI authorisation framework
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Improved model checking of hierarchical systems
Information and Computation
Branching pushdown tree automata
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
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
Unsafe grammars and panic automata
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Visibly pushdown automata: from language equivalence to simulation and bisimulation
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Infinite state model-checking of propositional dynamic logics
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Church synthesis problem with parameters
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
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
Repair of boolean programs with an application to c
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Partially commutative inverse monoids
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Inverse monoids: decidability and complexity of algebraic questions
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
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
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Algorithmic verification of asynchronous programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Towards a model-checker for counter systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Borel ranks and wadge degrees of context free ω-languages
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Regularity problems for weak pushdown ω-automata and games
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
On Winning Conditions of High Borel Complexity in Pushdown Games
Fundamenta Informaticae
The Church problem for expansions of (N,
Information and Computation
Hierarchies of infinite structures generated by pushdown automata and recursion schemes
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
On the complexity of LTL model-checking of recursive state machines
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Hyperplane separation technique for multidimensional mean-payoff games
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
A constraint-based approach to solving games on infinite graphs
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Branching-time logics with path relativisation
Journal of Computer and System Sciences
| Hi-index | 0.00 |