The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verification of an audio control protocol within real time process algebra
FMSP '98 Proceedings of the second workshop on Formal methods in software practice
ACM Transactions on Programming Languages and Systems (TOPLAS)
Nomadic pict: correct communication infrastructure for mobile computation
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimulation congruences in safe ambients
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimulations in the join-calculus
Theoretical Computer Science
Secure implementation of channel abstractions
Information and Computation
Mobile objects as mobile processes
Information and Computation - IFIP TCS2000
Unique Fixed Point Induction for McCarthy's Amb
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Proof-Checking Protocols Using Bisimulations
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
A pi-calculus Process Semantics of Concurrent Idealised ALGOL
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
Locality and Polyadicity in Asynchronous Name-Passing Calculi
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
A Top-Down Look at a Secure Message
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Communication Interference in Mobile Boxed Ambients
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
The Join Calculus: A Language for Distributed Mobile Programming
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
On the expressive power of polyadic synchronisation in π-calculus
Nordic Journal of Computing
A bisimulation for dynamic sealing
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Mathematical Structures in Computer Science
On the bisimulation proof method
Mathematical Structures in Computer Science
A process-algebraic approach for the analysis of probabilistic noninterference
Journal of Computer Security
Bisimulation on speed: worst-case efficiency
Information and Computation
On asynchrony in name-passing calculi
Mathematical Structures in Computer Science
A bisimulation for type abstraction and recursion
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A theory of bisimulation for a fragment of concurrent ML with local names
Theoretical Computer Science
On the representation of McCarthy's amb in the π-calculus
Theoretical Computer Science - Expressiveness in concurrency
Bisimulations up-to for the linear time branching time spectrum
CONCUR 2005 - Concurrency Theory
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
Small bisimulations for reasoning about higher-order imperative programs
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communication and mobility control in boxed ambients
Information and Computation
A bisimulation-based semantic theory of Safe Ambients
ACM Transactions on Programming Languages and Systems (TOPLAS)
Safe ambients: abstract machine and distributed implementation
Science of Computer Programming
Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
Mathematical Structures in Computer Science
Theoretical Computer Science - Applied semantics: Selected topics
Classification of security properties in a Linda-like process algebra
Science of Computer Programming - Special issue on security issues in coordination models, languages, and systems
Space-aware ambients and processes
Theoretical Computer Science
A bisimulation for dynamic sealing
Theoretical Computer Science
New up-to techniques for weak bisimulation
Theoretical Computer Science
Synchrony vs Asynchrony in Communication Primitives
Electronic Notes in Theoretical Computer Science (ENTCS)
Priority and abstraction in process algebra
Information and Computation
Types for ambient and process mobility†
Mathematical Structures in Computer Science
XPi: A typed process calculus for XML messaging
Science of Computer Programming
Using bisimulation proof techniques for the analysis of distributed abstract machines
Theoretical Computer Science
(Bi)simulations up-to characterise process semantics
Information and Computation
A ground-complete axiomatisation of finite-state processes in a generic process algebra
Mathematical Structures in Computer Science
The Calculus of Handshake Configurations
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Expressing first-order π-calculus in higher-order calculus of communicating systems
Journal of Computer Science and Technology
The Higher-Order, Call-by-Value Applied Pi-Calculus
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
From Active Names to π-calculus Rewriting Rules
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Observational Theory of the CPS-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Communication and mobility control in boxed ambients
Information and Computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Interactive Markov chains: and the quest for quantified quality
Interactive Markov chains: and the quest for quantified quality
Bisimulation proof methods for mobile ambients
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On bisimulation proofs for the analysis of distributed abstract machines
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Complete lattices and up-to techniques
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Subtyping, declaratively: an exercise in mixed induction and coinduction
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Theoretical Computer Science
Characterizing contextual equivalence in calculi with passivation
Information and Computation
Beyond bisimulation: the "up-to" techniques
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Up-to techniques for weak bisimulation
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Proof methodologies for behavioural equivalence in DPI
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Weak bisimulation up to elaboration
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
The bisimulation proof method: enhancements and open problems
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Bisimulations for untyped imperative objects
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Operational semantics using the partiality monad
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.01 |