Abramsky, S., Gay, S., and Nagarajan, R. (1996) Specification structures and propositions-as-types for concurrency. Lecture Notes in Computer Science . pp. 5-40. ISSN 0302-9743 (doi:10.1007/3-540-60915-6_2)
Full text not currently available from Enlighten.
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 deadlock-freedom, and expressive enough to allow the treatment of some standard examples from the literature. This is illustrated using the classic Dining Philosophers problem.
|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|