Full text not currently available from Enlighten.
Publisher's URL: http://dx.doi.org/10.1007/BFb0014557
We present a type-based technique for the verification of deadlock-freedom in asynchronous concurrent systems. Our general approach is to start with a simple interaction category, in which objects are types containing safety specifications and morphisms are processes. We then use a specification structure to add information to the types so that they specify stronger properties. In this paper the starting point is the category ASProc and the extra type information concerns deadlock-freedom. In the resulting category ASPrOC D , combining well-typed processes preserves deadlock-freedom. It is also possible to accommodate non-compositional methods within the same framework. The systems we consider are asynchronous, hence issues of divergence become significant; our approach incorporates an elegant treatment of both divergence and successful termination. As an example, we use our methods to verify the deadlock-freedom of an implementation of the alternating-bit protocol.
|Glasgow Author(s) Enlighten ID:||Gay, Dr 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:||Lecture Notes in Computer Science|