A specification structure for deadlock-freedom of synchronous processes

Abramsky, S., Gay, S. and Nagarajan, R. (1999) A specification structure for deadlock-freedom of synchronous processes. Theoretical Computer Science, 222(1-2), pp. 1-53. (doi: 10.1016/S0304-3975(98)00189-3)

Full text not currently available from Enlighten.

Publisher's URL: http://dx.doi.org/10.1016/S0304-3975(98)00189-3


Many different notions of “program property”, and many different methods of verifying such properties, arise naturally in programming. We present a general framework of Specification Structures for combining different notions and methods in a coherent fashion. We then apply the idea of specification structures to concurrency in the setting of Interaction Categories. As a specific example, a certain specification structure defined over the interaction category <i><font size="3"><b><sup>GP</sup></b></font>roc</i> yields a new category <i><font size="3"><b><sup>GP</sup></b></font>roc<sub>D</sub></i> in which morphisms are deadlock-free concurrent processes and composition is process interaction. <i><font size="3"><b><sup>GP</sup></b></font>roc<sub>D</sub></i> is obtained from <i><font size="3"><b><sup>GP</sup></b></font>roc</i> by adding specification information to the objects which is strong enough to guarantee deadlock-freedom. The main technical contribution is to show that this can be done in a way which is preserved by composition. The methods used to achieve this can be seen as a semantic analogue of those used to prove strong normalization in classical linear logic.

Item Type:Articles
Glasgow Author(s) Enlighten ID:Gay, Professor Simon
Authors: Abramsky, S., Gay, S., and Nagarajan, R.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Theoretical Computer Science
Published Online:17 August 1999

University Staff: Request a correction | Enlighten Editors: Update this record