A type-theoretic approach to deadlock-freedom of asynchronous systems
Authors:
- 1 January 1997
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 295-320
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Linearity and the pi-calculus1996
- Specification Structures and propositions-as-types for concurrency1996
- Relational parametricity and local variables1993
- Deliverables: a categorical approach to program development in type theory1993
- Termination, deadlock, and divergenceJournal of the ACM, 1992
- *-Autonomous categories and linear logicMathematical Structures in Computer Science, 1991
- Linear logicTheoretical Computer Science, 1987
- Deadlock Analysis in Networks of Communicating Processes1985
- Deadlock absence proofs for networks of communicating processesInformation Processing Letters, 1979
- Verifying properties of parallel programsCommunications of the ACM, 1976