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
Data flow analysis is model checking of abstract interpretations
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Data Flow Analysis as Model Checking
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
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
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
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
Reachability is decidable for weakly extended process rewrite systems
Information and Computation
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Reachability of hennessy-milner properties for weakly extended PRS
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
On computing reachability sets of process rewrite systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Symbolic reachability analysis of higher-order context-free processes
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |