Type-based analysis of deadlock for a concurrent calculus with interrupts

Authors:
Kohei Suenaga;Naoki Kobayashi
Affiliations:
University of Tokyo;Tohoku University
Venue:
ESOP'07 Proceedings of the 16th European conference on Programming
Year:
2007

Citing 11
Cited 5

Communication and concurrency

Communication and concurrency
Concurrent Haskell

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Asynchronous exceptions in Haskell

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Ownership types for safe programming: preventing data races and deadlocks

OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
A Typed Interrupt Calculus

FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Java(TM) Language Specification, The (3rd Edition) (Java (Addison-Wesley))

Java(TM) Language Specification, The (3rd Edition) (Java (Addison-Wesley))
Type-based information flow analysis for the π-calculus

Acta Informatica - Special issue: Types in concurrency. Part II , Guest Editor: R. De Nicola, D. Sangiorgi
Types for safe locking: Static race detection for Java

ACM Transactions on Programming Languages and Systems (TOPLAS)
Stack size analysis for interrupt-driven programs

Information and Computation
A new type system for deadlock-free processes

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory

Certifying low-level programs with hardware interrupts and preemptive threads

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Type-Based Deadlock-Freedom Verification for Non-Block-Structured Lock Primitives and Mutable References

APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
Certifying Low-Level Programs with Hardware Interrupts and Preemptive Threads

Journal of Automated Reasoning
A hybrid type system for lock-freedom of mobile processes

ACM Transactions on Programming Languages and Systems (TOPLAS)
Correct-by-Construction Concurrency: Using Dependent Types to Verify Implementations of Effectful Resource Usage Protocols

Fundamenta Informaticae - Dependently Typed Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The goal of our research project is to establish a type-based method for verification of certain critical properties (such as deadlock-and 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.