Abstract
Type systems for programming languages help reasoning about program behavior and early finding of bugs. Recent applications of type systems include analysis of various program behaviors such as side effects, resource usage, security properties, and concurrency. This paper is a tutorial of one of such applications: type systems for analyzing behavior of concurrent processes. We start with a simple type system and extend it step by step to obtain more expressive type systems to reason about deadlock-freedom, safe usage of locks, etc. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Kobayashi, N. (2003). Type systems for concurrent programs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2757, 439–453. https://doi.org/10.1007/978-3-540-40007-3_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
