Static and dynamic type systems have well-known strengths and weaknesses. In previous
work we developed a gradual type system for a functional calculus named λ^?_→. Gradual …

Process algebras can be enriched with localities that explicitly describe the distribution of
processes. Localities may represent physical machines, or more generally distribution units …

We describe a typing system for a distributed π-calculus which guarantees that distributed
agents cannot access the resources of a system without first being granted the capability to …

Our society's widespread dependence on networked information systems for everything from
personal finance to military communications makes it essential to improve the security of …

Type systems for programming languages help reasoning about program behavior and
early finding of bugs. Recent applications of type systems include analysis of various …

We need models of trust to facilitate cooperation in multi-agent systems, where agents,
human and artificial, do not know each other beforehand. This paper lists and proposes …

We methodically expand protocol narrations into terms of a process algebra in order to
specify some of the checks that need to be made in a protocol. We then apply static analysis …

Static and dynamic type systems have well-known strengths and weaknesses. Gradual
typing provides the benefits of both in a single language by giving the programmer control …

Subtyping in concurrency has been extensively studied since early 1990s as one of the most
interesting issues in type theory. The correctness of subtyping relations has been usually …

We describe a typing system for a distributed π-calculus which guarantees that distributed
agents cannot access the resources of a system without first being granted the capability to …