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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4421 LNCS, Issue , 2007, Pages 490-504

  Suenaga, Kohei ^a   Kobayashi, Naoki ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER OPERATING SYSTEMS; DIFFERENTIAL AMPLIFIERS; FEATURE EXTRACTION; KNOWLEDGE BASED SYSTEMS; PROBLEM SOLVING;

CONCURRENT CALCULUS; OPERATING SYSTEM KERNELS; RESEARCH PROJECTS; TYPE-BASED ANALYSIS;

CONCURRENT ENGINEERING;

EID: 37149040823     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71316-6_33     Document Type: Conference Paper

References (14)

1. Martín Abadi, Cormac Flanagan, and Stephen N. Freund. Types for safe locking: Static race detection for java. ACM Transactions on Programming Languages and Systems, 28(2):207-255, March 2006.
2. Chandrasekhar Boyapati, Robert Lee, and Martin Rinard. 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), volume 37 of SIGPLAN Notices, pages 211-230, November 2002.
3. Krishnendu Chatterjee, Di Ma, Rupak Majumdar, Tian Zhao, Thomas A. Henzinger, and Jens Palsberg. Stack size analysis for interrupt-driven programs. Information and Computation, 194(2): 144-174, 2004.
4. Cormac Flanagan and Martin Abadi. Types for safe locking. In Proceedings of 8the European Symposium on Programming (ESOP'99), volume 1576 of Lecture Notes in Computer Science, pages 91-108, March 1999.
5. James Gosling, Bill Joy, Guy Steele, and Gilad Bracha. The Java Language Specification, Third Edition. Addison-Wesley Professional, June 2005.
6. Simon Peyton Jones, Andrew Gordon, and Sigbjorn Finne. Concurrent haskell. In Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 1996), pages 295-308, January 1996.
7. Naoki Kobayashi. Type-based information flow analysis for the pi-calculus. Acta Informatica, 42(4-5):291-347, 2005.
8. Naoki Kobayashi. A new type system for deadlock-free processes. In Proceedings of the 17th International Conference on Concurrency Theory, volume 4137 of Lecture Notes in Computer Science, pages 233-247, August 2006.
9. Naoki Kobayashi, Shin Saito, and Eijiro Sumii. An implicitly-typed deadlock-free process calculus. In Proceedings of CONCUR 2000, volume 1877 of Lecture Notes in Computer Science, pages 489-503, August 2000.
10. Simon Marlow, Simon Peyton Jones, and Andrew Moran. Asynchronous exceptions in haskell. In Proceedings of ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation (PLDI 2001), June 2001.
11. Hiroya Matsuba and Yutaka Ishikawa. Single IP address cluster for internet servers. In Proceedings of 21st IEEE International Parallel and Distributed Processing Symposium (IPDPS2007), March 2007.
12. Robin Milner. Communication and Concurrency. Prentice Hall, September 1995.
13. Robin Milner. Communicating and Mobile Systems: the Pi-Calculus. Cambridge University Press, 1999.
14. Jens Palsberg and Di Ma. A typed interrupt calculus. In Proceedings of 7th International Symposium on Formal Techniques in Real-Time and Fault Tolerant Systems, volume 2469 of Lecture Notes in Computer Science, pages 291-310, September 2002.