Conference

# International Symposium on Theoretical Aspects of Computer Software

About: International Symposium on Theoretical Aspects of Computer Software is an academic conference. The conference publishes majorly in the area(s): Operational semantics & Lambda calculus. Over the lifetime, 95 publication(s) have been published by the conference receiving 2792 citation(s).

Topics: Operational semantics, Lambda calculus, Typed lambda calculus, Decidability, Process calculus

##### Papers

More filters

••

[...]

TL;DR: Nominal Logic is introduced, a version of first-order many-sorted logic with equality containing primitives for renaming via name-swapping, for freshness of names, and for name-binding, and its axioms express properties of these constructs satisfied by the FM-sets model of syntax involving binding.

Abstract: This paper formalises within first-order logic some common practices in computer science to do with representing and reasoning about syntactical structures involving lexically scoped binding constructs. It introduces Nominal Logic, a version of first-order many-sorted logic with equality containing primitives for renaming via name-swapping, for freshness of names, and for name-binding. Its axioms express properties of these constructs satisfied by the FM-sets model of syntax involving binding, which was recently introduced by the author and M.J. Gabbay and makes use of the Fraenkel-Mostowski permutation model of set theory. Nominal Logic serves as a vehicle for making two general points. First, name-swapping has much nicer logical properties than more general, non-bijective forms of renaming while at the same time providing a sufficient foundation for a theory of structural induction/recursion for syntax modulo α-equivalence. Secondly, it is useful for the practice of operational semantics to make explicit the equivariance property of assertions about syntax - namely that their validity is invariant under name-swapping.

410 citations

••

[...]

Microsoft

^{1}TL;DR: A logic that can express properties of freshness, secrecy, structure, and behavior of concurrent systems is presented, which includes spatial operations corresponding to composition, local name restriction, and a primitive fresh name quantifier.

Abstract: We present a logic that can express properties of freshness, secrecy, structure, and behavior of concurrent systems. In addition to standard logical and temporal operators, our logic includes spatial operations corresponding to composition, local name restriction, and a primitive fresh name quantifier. Properties can also be defined by recursion; a central aim of this paper is then the combination of a logical notion of freshness with inductive and coinductive definitions of properties.

267 citations

••

[...]

TL;DR: This paper considers LTL with regular valuations: the set of configurations satisfying an atomic proposition can be an arbitrary regular language and claims that the model-checking algorithms provide a general, unifying and efficient framework for solving them.

Abstract: Recent works have proposed pushdown systems as a tool for analyzing programs with (recursive) procedures, and the model-checking problem for LTL has received special attention. However, all these works impose a strong restriction on the possible valuations of atomic propositions: whether a configuration of the pushdown system satisfies an atomic proposition or not can only depend on the current control state of the pushdown automaton and on its topmost stack symbol. In this paper we consider LTL with regular valuations: the set of configurations satisfying an atomic proposition can be an arbitrary regular language. The model-checking problem is solved via two different techniques, with an eye on efficiency. The resulting algorithms are polynomial in certain measures of the problem which are usually small, but can be exponential in the size of the problem instance. However, we show that this exponential blowup is inevitable. The extension to regular valuations allows to model problems in different areas; for instance, we show an application to the analysis of systems with checkpoints. We claim that our model-checking algorithms provide a general, unifying and efficient framework for solving them.

171 citations

••

[...]

29 Oct 2001

TL;DR: This work compares two views of symmetric cryptographic primitives in the context of the systems that use them and establishes the soundness of the formal definition of equivalence of systems with respect to eavesdroppers.

Abstract: We compare two views of symmetric cryptographic primitives in the context of the systems that use them. We express those systems in a simple programming language; each of the views yields a semantics for the language. One of the semantics treats cryptographic operations formally (that is, symbolically). The other semantics is more detailed and computational; it treats cryptographic operations as functions on bitstrings. Each semantics leads to a definition of equivalence of systems with respect to eavesdroppers. We establish the soundness of the formal definition with respect to the computational one. This result provides a precise computational justification for formal reasoning about security against eavesdroppers.

161 citations

•

[...]

29 Oct 2001

TL;DR: Boxed Ambients are a variant of Mobile Ambients that result from dropping the open capability and providing new primitives for ambient communication while retaining the constructs in and out for mobility.

Abstract: Boxed Ambients are a variant of Mobile Ambients that result from (i) dropping the open capability and (ii) providing new primitives for ambient communication while retaining the constructs in and out for mobility. The new model of communication is faithful to the principles of distribution and location-awareness of Mobile Ambients, and complements the constructs for Mobile Ambient mobility with finer-grained mechanisms for ambient interaction.

136 citations