Summary: Specification Structures and PropositionsasTypes for
Samson Abramsky Simon Gay Rajagopal Nagarajan
Department of Computing,
Imperial College of Science, Technology and Medicine, London, UK.
Many different notions of ``property of interest'' and methods of verifying such
properties arise naturally in programming. A general framework of ``Specification
Structures'' is presented for combining different notions and methods in a coherent
fashion. This is then applied to concurrency in the setting of Interaction Categories.
As an example, we present a type system for concurrent processes strong enough to
guarantee deadlockfreedom, and expressive enough to allow the treatment of some
standard examples from the literature. This is illustrated using the classic Dining
This paper appears in Logics for Concurrency: Structure vs. Automata---Proceedings of the
VIIIth Banff Higher Order Workshop (F. Moller and G. Birtwistle, eds), SpringerVerlag
Lecture Notes in Computer Science, 1995.
Type Inference and Verification are two main paradigms for constraining the behaviour