#### Filter Results:

- Full text PDF available (106)

#### Publication Year

1983

2017

- This year (3)
- Last 5 years (34)
- Last 10 years (55)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Dale Miller, Gopalan Nadathur, Frank Pfenning, Andre Scedrov
- Ann. Pure Appl. Logic
- 1991

A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like programming languages is provided. This characterization is based on the principle that the declarative meaning of a logic program, provided by provability in a logical system, should coincide with its operational meaning, provided by interpreting logical… (More)

Using a multiset rewriting formalism with existen-tial quantiication, it is shown that protocol security remains undecidable even when rather severe restrictions are placed on protocols. In particular, even if data constructors, message depth, message width, number of distinct roles, role length, and depth of encryp-tion are bounded by constants, secrecy is… (More)

- Patrick Lincoln, John C. Mitchell, Andre Scedrov, Natarajan Shankar
- Ann. Pure Appl. Logic
- 1990

Linear logic, introduced by Girard, is a refinement of classical logic with a natural, intrinsic accounting of resources. We show that unlike most other propositional (quantifier-free) logics, full propositional linear logic is undecidable. Further, we prove that without the modal storage operator, which indicates unboundedness of resources , the decision… (More)

Most formal approaches to security protocol analysis are based on a set of assumptions commonly referred to as the " Dolev-Yao model. " In this paper, we use a multiset rewriting formalism, based on linear logic, to state the basic assumptions of this model. A characteristic of our formalism is the way that existential quantification provides a succinct way… (More)

- Val Tannen, Thierry Coquand, Carl A. Gunter, Andre Scedrov
- Inf. Comput.
- 1991

We present a method for providing semantic interpretations for languages with a type system featuring inheritance polymorphism. Our approach is illustrated on an extension of the language Fun of Cardelli and Wegner, which we interpret via a translation into an extended polymorphic lambda calculus. Our goal is to interpret inheritances in Fun via coercion… (More)

- Jean-Yves Girard, Andre Scedrov, Philip J. Scott
- Theor. Comput. Sci.
- 1992

- Luca Cardelli, Simone Martini, John C. Mitchell, Andre Scedrov
- Inf. Comput.
- 1991

System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F <: (pronounced ef-sub) that combines parametric polymorphism with subtyping. The main focus of the paper is the equational theory of F <: , which is related to PER models and the notion of… (More)

We report on a man-in-the-middle attack on PKINIT, the public key extension of the widely deployed Kerberos 5 authentication protocol. This flaw allows an attacker to impersonate Kerberos administrative principals (KDC) and end-servers to a client, hence breaching the authentication guarantees of Kerberos. It also gives the attacker the keys that the KDC… (More)

- John C. Mitchell, Andre Scedrov
- CSL
- 1992

This paper describes a semantics of typed lambda calculi based on relations. The main mathematical tool is a category-theoretic method of sconing, also called glueing or Freyd covers. Its correspondence to logical relations is also examined.

- Bruno Blanchet, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay
- ASIACCS
- 2008

We present a computationally sound mechanized analysis of Kerberos 5, both with and without its public-key extension PKINIT. We prove authentication and key secrecy properties using the prover CryptoVerif, which works directly in the computational model; these are the first mechanical proofs of a full industrial protocol at the computational level. We also… (More)