POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compositional reachability analysis using process algebra
TAV4 Proceedings of the symposium on Testing, analysis, and verification
Journal of the ACM (JACM)
A concurrency analysis tool suite for Ada programs: rationale, design, and preliminary experience
ACM Transactions on Software Engineering and Methodology (TOSEM)
Graph models for reachability analysis of concurrent programs
ACM Transactions on Software Engineering and Methodology (TOSEM)
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
On the computational complexity of bisimulation, redux
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
The compression structure of a process
Information Processing Letters
Divide and Congruence Applied to η-Bisimulation
Electronic Notes in Theoretical Computer Science (ENTCS)
On the computational complexity of bisimulation, redux
Information and Computation
The compression structure of a process
Information Processing Letters
A generic on-the-fly solver for alternation-free boolean equation systems
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Sigref: a symbolic bisimulation tool box
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Information and Computation
A COMPLETE AXIOMATIZATION FOR PREFIX ITERATION IN BRANCHING BISIMULATION
Fundamenta Informaticae
| Hi-index | 0.00 |