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.
Chapter PDF
References
Abadi, M., Flanagan, C., Freund, S.N.: Types for safe locking: Static race detection for java. ACM Transactions on Programming Languages and Systems 28(2), 207–255 (2006)
Boyapati, C., Lee, R., Rinard, M.: Ownership types for safe programming: Preventing data races and deadlocks. In: Proceedings of the 2002 ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages and Applications (OOPSLA 2002). SIGPLAN Notices, vol. 37, pp. 211–230. ACM Press, New York (2002)
Chatterjee, K., et al.: Stack size analysis for interrupt-driven programs. Information and Computation 194(2), 144–174 (2004)
Flanagan, C., Abadi, M.: Types for safe locking. In: Swierstra, S.D. (ed.) ESOP 1999 and ETAPS 1999. LNCS, vol. 1576, pp. 91–108. Springer, Heidelberg (1999)
Gosling, J., et al.: The Java Language Specification, 3rd edn. Addison-Wesley Professional, Reading (2005)
Jones, S.P., Gordon, A., Finne, S.: Concurrent haskell. In: Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 1996), pp. 295–308. ACM Press, New York (1996)
Kobayashi, N.: Type-based information flow analysis for the pi-calculus. Acta Informatica 42(4-5), 291–347 (2005)
Kobayashi, N.: A new type system for deadlock-free processes. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 233–247. Springer, Heidelberg (2006)
Kobayashi, N., Saito, S., Sumii, E.: An implicitly-typed deadlock-free process calculus. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 489–503. Springer, Heidelberg (2000)
Marlow, S., Jones, S.P., Moran, A.: Asynchronous exceptions in haskell. In: Proceedings of ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation (PLDI 2001), ACM Press, New York (2001)
Matsuba, H., Ishikawa, Y.: Single IP address cluster for internet servers. In: Proceedings of 21st IEEE International Parallel and Distributed Processing Symposium (IPDPS2007), IEEE Computer Society Press, Los Alamitos (2007)
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1995)
Milner, R.: Communicating and Mobile Systems: the Pi-Calculus. Cambridge University Press, Cambridge (1999)
Palsberg, J., Ma, D.: A typed interrupt calculus. In: Damm, W., Olderog, E.-R. (eds.) FTRTFT 2002. LNCS, vol. 2469, pp. 291–310. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Suenaga, K., Kobayashi, N. (2007). Type-Based Analysis of Deadlock for a Concurrent Calculus with Interrupts. In: De Nicola, R. (eds) Programming Languages and Systems. ESOP 2007. Lecture Notes in Computer Science, vol 4421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71316-6_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-71316-6_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71314-2
Online ISBN: 978-3-540-71316-6
eBook Packages: Computer ScienceComputer Science (R0)