A type-theoretic approach to deadlock-freedom of asynchronous systems
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 295-320
- https://doi.org/10.1007/bfb0014557
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A partially deadlock-free typed process calculusPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A typed calculus of synchronous processesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Linearity and the pi-calculusPublished by Association for Computing Machinery (ACM) ,1996
- Specification Structures and propositions-as-types for concurrencyPublished by Springer Nature ,1996
- Deliverables: a categorical approach to program development in type theoryPublished by Springer Nature ,1993
- 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 ProcessesPublished by Springer Nature ,1985
- Deadlock absence proofs for networks of communicating processesInformation Processing Letters, 1979