Commutative grammars: the complexity of uniform word problems
Information and Control
The complexity of equivalence problems for commutative grammars
Information and Control - The MIT Press scientific computation series
Process algebra
String-rewriting systems
On the regular structure of prefix rewriting
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Petri nets, commutative context-free grammars, and basic parallel processes
Fundamenta Informaticae
Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation - Special issue on EXPRESS 1997
Context-sensitive synchronization-sensitive analysis is undecidable
ACM Transactions on Programming Languages and Systems (TOPLAS)
On optimal slicing of parallel programs
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
The Regular Viewpoint on PA-Processes
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Bisimulation Equivalence is Decidable for Basic Parallel Processes
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis
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
Efficient Algorithms for Model Checking Pushdown Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Automatic Verification of Parameterized Cache Coherence Protocols
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Analysis of Recursive State Machines
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Petri Nets and the Equivalence Problem
CSL '93 Selected Papers from the 7th Workshop on Computer Science Logic
On the Verification of Broadcast Protocols
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Optimal interprocedural program optimization: a new framework and its application
Optimal interprocedural program optimization: a new framework and its application
On Symbolic Verification of Weakly Extended PAD
Electronic Notes in Theoretical Computer Science (ENTCS)
Note: Petri nets are less expressive than state-extended PA
Theoretical Computer Science
Model-Checking Large Finite-State Systems and Beyond
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
On Decidability of LTL+Past Model Checking for Process Rewrite Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Refining the Undecidability Border of Weak Bisimilarity
Electronic Notes in Theoretical Computer Science (ENTCS)
Abstract Regular Tree Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |