#### Filter Results:

- Full text PDF available (105)

#### Publication Year

1978

2017

- This year (1)
- Last 5 years (24)
- Last 10 years (51)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Luca Cardelli, Andrew D. Gordon
- Theor. Comput. Sci.
- 1997

We introduce a calculus describing the movement of processes and devices, including movement through administrative domains. c © 2000 Elsevier Science B.V. All rights reserved.

- Martín Abadi, Andrew D. Gordon
- ACM Conference on Computer and Communications…
- 1997

We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) su ces for some abstract protocols; the spi calculus enables us to consider cryptographic issues in… (More)

Some applications are most easily expressed in a programming language that supports concurrency, notably interactive and distributed systems. We propose extensions to the purely-functional language Haskell that allow it to express explicitly concurrent applications; we call the resulting language Concurrent Haskell. The resulting system appears to be both… (More)

- Andrew D. Gordon
- Electr. Notes Theor. Comput. Sci.
- 1995

Morris style contextual equivalence invariance of termination under any context of ground type is the usual notion of operational equivalence for deterministic functional languages such as FPC PCF plus sums products and recursive types Contextual equivalence is hard to establish directly Instead we de ne a labelled transition system for call by name FPC and… (More)

- Luca Cardelli, Andrew D. Gordon
- POPL
- 2000

The Ambient Calculus is a process calculus where processes may reside within a hierarchy of locations and modify it. The purpose of the calculus is to study mobility, which is seen as the change of spatial configurations over time. In order to describe properties of mobile computations we devise a modal logic that can talk about space as well as time, and… (More)

- Jesper Bengtson, Karthikeyan Bhargavan, Cédric Fournet, Andrew D. Gordon, Sergio Maffeis
- 2008 21st IEEE Computer Security Foundations…
- 2008

We present the design and implementation of a typechecker for verifying security properties of the source code of cryptographic protocols and access control mechanisms. The underlying type theory is a λ-calculus equipped with refinement types for expressing pre- and post-conditions within first-order logic. We derive formal cryptographic primitives and… (More)

- Moritz Y. Becker, Cédric Fournet, Andrew D. Gordon
- 20th IEEE Computer Security Foundations Symposium…
- 2007

We present a declarative authorization language that strikes a careful balance between syntactic and semantic simplicity, policy expressiveness, and execution efficiency. The syntax is close to natural language, and the semantics consists of just three deduction rules. The language can express many common policy idioms using constraints, controlled… (More)

- Andrew D. Gordon, Alan Jeffrey
- CSFW
- 2001

We propose a new method to check authenticity properties of cryptographic protocols. First, code up the protocol in the spi-calculus of Abadi and Gordon. Second, specify authenticity properties by annotating the code with correspondence assertions in the style of Woo and Lam. Third, figure out types for the keys, nonces, and messages of the protocol.… (More)

- Luca Cardelli, Andrew D. Gordon
- POPL
- 1999

Java has demonstrated the utility of type systems for mobile code, and in particular their use and implications for security. Security properties rest on the fact that a well-typed Java program (or the corresponding verified bytecode) cannot cause certain kinds of damage.In this paper we provide a type system for mobile computation, that is, for computation… (More)

- Moritz Y. Becker, Cédric Fournet, Andrew D. Gordon
- Journal of Computer Security
- 2010

We present a declarative authorization language. Policies and credentials are expressed using predicates defined by logical clauses, in the style of constraint logic programming. Access requests are mapped to logical authorization queries, consisting of predicates and constraints combined by conjunctions, disjunctions, and negations. Access is granted if… (More)