Abstract. The goal of our research project is to establish a type-based method for verification of certain critical properties (such as deadlockand race-freedom) of operating system kernels. As operating system kernels make heavy use of threads and interrupts, it is important that the method can properly deal with both of the two features. As a first step towards the goal, we formalize a concurrent calculus equipped with primitives for threads and interrupts handling. We also propose a type system that guarantees deadlock-freedom in the presence of interrupts. To our knowledge, ours is the first type system for deadlock-freedom that can deal with both thread and interrupt primitives.
In our previous work REF , we have proposed a type-based deadlock-freedom analysis for concurrent programs with block-structured lock primitives, references and interrupts.
Type-Based Analysis of Deadlock for a Concurrent Calculus with Interrupts
In ESOP
Computer Science