Combinatory representation of mobile processes
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A partially deadlock-free typed process calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Behavioral equivalence in the polymorphic pi-calculus
Journal of the ACM (JACM)
Bisimulation congruences in safe ambients
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A uniform type structure for secure information flow
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimulations in the join-calculus
Theoretical Computer Science
From rewrite rules to bisimulation congruences
Theoretical Computer Science
Information and Computation
Secure implementation of channel abstractions
Information and Computation
Mobile objects as mobile processes
Information and Computation - IFIP TCS2000
Understanding the mismatch combinator in Chi calculus
Theoretical Computer Science
Secure Information Flow as Typed Process Behaviour
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Mobile Processes: A Commented Bibliography
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Suptyping and Locality in Distributed Higher Order Processes (extended abstract)
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
On Barbed Equivalences in pi-Calculus
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Communication Interference in Mobile Boxed Ambients
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Local pi-Calculus at Work: Mobile Objects as Mobile Processes
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
The Join Calculus: A Language for Distributed Mobile Programming
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Mobile processes: a commented bibliography
Modeling and verification of parallel processes
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
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Deriving bisimulation congruences using 2-categories
Nordic Journal of Computing
Channel dependent types for higher-order mobile processes
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
On the expressiveness of pure safe ambients
Mathematical Structures in Computer Science
Elementary structures in process theory (1): Sets with renaming
Mathematical Structures in Computer Science
Strong normalisation in the π-calculus
Information and Computation
Towards a theory of bisimulation for the higher-order process calculi
Journal of Computer Science and Technology
On asynchrony in name-passing calculi
Mathematical Structures in Computer Science
Towards a behavioural theory of access and mobility control in distributed systems
Theoretical Computer Science - Special issue: Foundations of wide area network computing
A theory of bisimulation for a fragment of concurrent ML with local names
Theoretical Computer Science
Formalising Java RMI with explicit code mobility
OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Information and Computation
A theory of system behaviour in the presence of node and link failures
CONCUR 2005 - Concurrency Theory
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
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)
Role-based access control for a distributed calculus
Journal of Computer Security - Special issue on CSFW17
P-congruences as non-interference for the pi-calculus
Proceedings of the fourth ACM workshop on Formal methods in security
Secure implementations of typed channel abstractions
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science - Applied semantics: Selected topics
Theoretical Computer Science - Mathematical foundations of computer science 2000
Space-aware ambients and processes
Theoretical Computer Science
An Observational Theory for Mobile Ad Hoc Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Extensionality of Spatial Observations in Distributed Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
A uniform type structure for secure information flow
ACM Transactions on Programming Languages and Systems (TOPLAS)
Basic observables for a calculus for global computing
Information and Computation
Information and Computation
Theoretical Computer Science
Formalising Java RMI with explicit code mobility
Theoretical Computer Science
Full abstraction for polymorphic π-calculus
Theoretical Computer Science
A theory of system behaviour in the presence of node and link failure
Information and Computation
Comparing communication primitives via their relative expressive power
Information and Computation
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
On Affine Usages in Signal-Based Communication
APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
An Observational Theory for Mobile Ad Hoc Networks (full version)
Information and Computation
Reactive Systems, Barbed Semantics, and the Mobile Ambients
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
On Convergence-sensitive Bisimulation and the Embedding of CCS in Timed CCS
Electronic Notes in Theoretical Computer Science (ENTCS)
Security Abstractions and Intruder Models (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Making the Unobservable, Unobservable
Electronic Notes in Theoretical Computer Science (ENTCS)
A Process-Model for Linear Programs
Types for Proofs and Programs
On Observing Dynamic Prioritised Actions in SOC
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
A Logical Interpretation of the λ-Calculus into the η-Calculus, Preserving Spine Reduction and Types
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Contextual Labelled Semantics for Higher-order Process Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Typed Event Structures and the π-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Communication and mobility control in boxed ambients
Information and Computation
Information and Computation
Channel abstractions for network security†
Mathematical Structures in Computer Science
Typed event structures and the linear π-calculus
Theoretical Computer Science
Bisimulation proof methods for mobile ambients
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Semantic barbs and biorthogonality
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
A fault tolerance bisimulation proof for consensus
ESOP'07 Proceedings of the 16th European conference on Programming
An exact correspondence between a typed pi-calculus and polarised proof-nets
Theoretical Computer Science
Complete lattices and up-to techniques
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Environmental bisimulations for higher-order languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the expressiveness and decidability of higher-order process calculi
Information and Computation
Saturated LTSs for adhesive rewriting systems
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Concurrency can't be observed, asynchronously
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Sound bisimulations for higher-order distributed process calculus
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Deriving labels and bisimilarity for concurrent constraint programming
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Linear lambda calculus and deep inference
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
On asynchronous session semantics
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Behavioral theory for session-oriented calculi
Rigorous software engineering for service-oriented systems
Basic observables for a calculus for global computing
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On the bisimulation congruence in χ-calculus
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Congruence for structural congruences
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Full abstraction for polymorphic pi-calculus
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Welcome to the jungle: a subjective guide to mobile process calculi
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Theoretical Computer Science
First-order reasoning for higher-order concurrency
Computer Languages, Systems and Structures
A Higher-Order Distributed Calculus with Name Creation
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Open bisimulation for quantum processes
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
On the semantics of Markov automata
Information and Computation
Globally governed session semantics
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
An epistemic Halpern-Shoham logic
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Name-Passing Calculi: From Fusions to Preorders and Types
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.01 |