We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology 15(2):103–127, 2002) to a scenario where the adversary gets to see the encryption of a sequence of adaptively chosen symbolic expressions. The extension of the theorem of Abadi and Rogaway to such an adaptive scenario is nontri...

We illustrate the pragmatic aspects of the Theory of Contexts, recently proposed as a general approach for reasoning on languages with binders in Higher-Order Abstract Syntax, through two working examples: λ-calculus and Abadi and Cardelli’s impς-calculus.

We obtain a new formalism for concurrent object-oriented languages by extending Abadi and Cardelli’s imperative object calculus with operators for concurrency from the -calculus and operators for synchronisation based on mutexes. Our syntax of terms is extremely expressive; in a precise sense it unifies notions of expression, process, store, thread, and configuration. We present a chemical-styl...

We show that the Abadi-Rogaway logic of indistinguishability for cryptographic expressions is not complete by giving a natural example of a secure encryption function and a pair of expressions, such that the distributions associated to the two expressions are computationally indistinguishable, but equality cannot be proved within the logic. We then introduce a new property for encryption scheme...

Abadi and Cardelli have investigated several versions of the object calculus, a calculus for describing central features of object-oriented programs, with particular emphasis on various type systems. In this paper we study the properties of a denotational semantics due to Abadi and Cardelli vis-à-vis the notion of observational congruence for the calculus Ob1<:μ. In particular, we prove that th...

Abadi and Cardelli have recently investigated a calculus of objects [2]. The calculus supports a key feature of object-oriented languages: an object can be emulated by another object that has more re ned methods. Abadi and Cardelli presented four rst-order type systems for the calculus. The simplest one is based on nite types and no subtyping, and the most powerful one has both recursive types ...

Tools to evaluate Cryptographic Protocols (CPs) exploded into the literature after development of BAN Logic [BAN88,BAN90]. Many of these were created to repair weaknesses in BAN Logic. Unfortunately, these tools are all complex and difficult to implement individually, with little or no effort available to implement multiple tools in a workbench environment. We propose a framework that allows a ...

Abadi and Cardelli have recently investigated a calculus of objects 2]. The calculus supports a key feature of object-oriented languages: an object can be emulated by another object that has more reened methods. Abadi and Cardelli presented four rst-order type systems for the calculus. The simplest one is based on nite types and no subtyping, and the most powerful one has both recursive types a...

The object-calculus is an imperative and object-based programming language where every object comes equipped with its own method suite. Consequently, methods need to reside in the store (“higher-order store”) which complicates the semantics. Abadi and Leino defined a program logic for this language enriching object types by method specifications. We present a new soundness proof for their logic...