## A Type System for Lock-Free Processes (2002)

by
Naoki Kobayashi

Citations: | 39 - 7 self |

### BibTeX

@MISC{Kobayashi02atype,

author = {Naoki Kobayashi},

title = {A Type System for Lock-Free Processes},

year = {2002}

}

### Years of Citing Articles

### OpenURL

### Abstract

Interpretation. An alternative way to analyze the behavior of a concurrent program would be to use abstract interpretation [4, 5]. Actually, from a very general viewpoint, our type-based analysis of locks can be seen as a kind of abstract interpretation. We can read a type judgment # P as "# is an abstraction of a concrete process P ." (The relation "#" corresponds to a pair of abstraction /concretization functions.) Indeed, we can regard a type environment as an abstract process: we have defined reductions of type environments in Section 3.7.