A New Type System for Deadlock-Free Processes
- 1 January 2006
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 233-247
- https://doi.org/10.1007/11817949_16
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Ensuring Termination by TypabilityPublished by Springer Science and Business Media LLC ,2006
- Type-based information flow analysis for the π-calculusActa Informatica, 2005
- Functions as processesPublished by Springer Science and Business Media LLC ,2005
- Abstract interpretation of mobile systemsThe Journal of Logic and Algebraic Programming, 2004
- Typing and subtyping for mobile processesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A Type System for Lock-Free ProcessesInformation and Computation, 2002
- A uniform type structure for secure information flowPublished by Association for Computing Machinery (ACM) ,2002
- An Implicitly-Typed Deadlock-Free Process CalculusLecture Notes in Computer Science, 2000
- Linearity and the pi-calculusACM Transactions on Programming Languages and Systems, 1999
- A partially deadlock-free typed process calculusACM Transactions on Programming Languages and Systems, 1998