Algebraic theory of processes
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
Trust and partial typing in open systems of mobile agents
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Behavioral equivalence in the polymorphic pi-calculus
Journal of the ACM (JACM)
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
Resource access control in systems of mobile agents
Information and Computation
Communication and Concurrency
Information and Computation
Typing the Use of Resources in a Concurrent Calculus (Extended Abstract)
ASIAN '97 Proceedings of the Third Asian Computing Science Conference on Advances in Computing Science
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
A Hierarchy of Equivalences for Asynchronous Calculi
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
On Asynchronous Communication Semantics
ECOOP '91 Proceedings of the Workshop on Object-Based Concurrent Computing
Static Analysis of Communication for Asynchronous Concurrent Programming Languages
SAS '95 Proceedings of the Second International Symposium on Static Analysis
The Concurrency Factory: A Development Environment for Concurrent Systems
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
A Partially Deadlock-free Typed Process Calculus
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Bisimulation in Name-Passing Calculi without Matching
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
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
A theory of system behaviour in the presence of node and link failures
CONCUR 2005 - Concurrency Theory
Typed polyadic pi-calculus in bigraphs
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Towards an algebraic theory of typed mobile processes
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
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
Controlling information release in the π-calculus
Information and Computation
Theoretical Computer Science
A theory of system behaviour in the presence of node and link failure
Information and Computation
Security types for dynamic web data
Theoretical Computer Science
Counting the Cost in the Picalculus (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Static vs dynamic typing for access control in pi-calculus
ASIAN'07 Proceedings of the 12th Asian computing science conference on Advances in computer science: computer and network security
Complete lattices and up-to techniques
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Secrecy and authenticity types for secure distributed messaging
ARSPA-WITS'10 Proceedings of the 2010 joint conference on Automated reasoning for security protocol analysis and issues in the theory of security
A theory of noninterference for the π-calculus
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Typed processes in untyped contexts
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
A theory for observational fault tolerance
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Globally governed session semantics
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
We study typed behavioural equivalences for the $\pi$-calculus in which the type system allows a form of subtyping. This enables processes to distribute different capabilities selectively on communication channels. The equivalences considered include typed versions of testing equivalences and barbed bisimulation equivalences.We show that each of these equivalences can be characterised via standard techniques applied to a novel labelled transition system of configurations. These consist of a process term together with two related type environments; one constraining the process and the other its computing environment.