A partially deadlock-free typed process calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Controlling interference in ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimulations in the join-calculus
Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the Benefits of Using the Up-To Techniques for Bisimulation Verification
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Suptyping and Locality in Distributed Higher Order Processes (extended abstract)
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Reasoning About Concurrent Systems Using Types
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
On Synchronous and Asynchronous Mobile Processes
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
The Receptive Distributed pi-Calculus (Extended Abstract)
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
On message deliverability and non-uniform receptivity
Fundamenta Informaticae
The receptive distributed π-calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Uniform confluence in concurrent computation
Journal of Functional Programming
Strong normalisation in the π-calculus
Information and Computation
Types and full abstraction for polyadic π-calculus
Information and Computation
Types for Active Objects with Static Deadlock Prevention
Fundamenta Informaticae
Types and full abstraction for polyadic π-calculus
Information and Computation
Sequentiality and the π-calculus
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Structured communication-centred programming for web services
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
State inference for dynamically changing interfaces
Computer Languages
On message deliverability and non-uniform receptivity
Fundamenta Informaticae
Types for Active Objects with Static Deadlock Prevention
Fundamenta Informaticae
Hi-index | 0.00 |