Type-based deadlock-freedom verification for non-block-structured lock primitives and mutable references

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

Volumn 5356 LNCS, Issue , 2008, Pages 155-170

  Suenaga, Kohei ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BLOCK STRUCTURED; CONCURRENT PROGRAM; DEADLOCK FREEDOM; SPECIFIC ORDERING; TYPE SYSTEMS; VERIFICATION METHOD;

LOCKS (FASTENERS);

EID: 58549083355     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89330-1_12     Document Type: Conference Paper

References (17)

1. 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)
2. 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, November 2002. vol. 37, pp. 211-230 (2002)
3. Boyland, J.: Checking interference with fractional permissions. In: Cousot, R. (ed.) SAS 2003. LNCS, vol. 2694, pp. 55-72. Springer, Heidelberg (2003)
4. Chatterjee, K., Ma, D., Majumdar, R., Zhao, T., Henzinger, T.A., Palsberg, J.: Stack size analysis for interrupt-driven programs. Information and Computation 194(2), 144-174 (2004)
5. Dahyabhai, N.: Bugzilla Bug 439215: dbus-daemon-1 hangs when using the option nss-initgroups-ignoreusers in/etc/ldap.conf. with the user root. Red Hat, Inc (accessed on June 19, 2008) (March 2008), https://bugzilla.redhat.com/show- bug.cgi?id=439215
6. Feng, X., Shao, Z., Dong, Y., Guo, Y.: Certifying low-level programs with hardware interrupts and preemptive threads. In: Programming Language Design and Implementation (PLDI) (June 2008)
7. Flanagan, C., Abadi, M.: Object types against races. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR, 1999. LNCS, vol. 1664, pp. 288-303. Springer, Heidelberg (1999)
8. Flanagan, C., Abadi, M.: Types for safe locking. In: Swierstra, S.D. (ed.) ESOP 1999. LNCS, vol. 1576, pp. 91-108. Springer, Heidelberg (1999)
9. Foster, J.S., Terauchi, T., Aiken, A.: Flow-sensitive type qualifiers. In: Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 1-12 (2002)
10. Kikuchi, D., Kobayashi, N.: Type-based verification of correspondence assertions for communication protocols. In: Proceedings of the Fifth ASIAN Symposium on Programming Languages and Systems (November 2007)
11. Kobayashi, N.: Type-based information flow analysis for the pi-calculus. Acta Informatica 42(4-5), 291-347 (2005)
12. 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)
13. Kobayashi, N.: Substructural type systems for program analysis. In: Garrigue, J., Hermenegildo, M.V. (eds.) FLOPS 2008. LNCS, vol. 4989, p. 14. Springer, Heidelberg (2008), http://www.kb.ecei.tohoku.ac. jp/~koba/slides/ FL0PS2008.pdf
14. 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)
15. 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)
16. Suenaga, K., Kobayashi, N.: Type-based analysis of deadlock for a concurrent calculus with interrupts. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 490-504. Springer, Heidelberg (2007)
17. Terauchi, T.: Types for Deterministic Concurrency. PhD thesis, Electrical Engineering and Computer Sciences, University of California at Berkeley (August 2006)