Skip to main content

Type-based analysis of concurrent programs

  • Conference paper
  • First Online:
Types in Compilation (TIC 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1473))

Included in the following conference series:

  • 94 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

References

  1. Atsushi Igarashi and Naoki Kobayashi. Type-based analysis of usage of communication channels for concurrent programming languages. In Proceedings of International Static Analysis Symposium (SAS’97), Lecture Notes in Computer Science, Vol. 1302. Springer-Verlag, Berlin Heidelberg New York (1997) 187–201.

    Google Scholar 

  2. Naoki Kobayashi. A partially deadlock-free typed process calculus. To appear in ACM Transactions on Programming Languages and Systems, ACM, New York (1998). A preliminary summary appeared in Proceedings of LICS’97, (1997) 128–139.

    Google Scholar 

  3. Naoki Kobayashi, Benjamin C. Pierce, and David N. Turner. Linearity and the pi-calculus. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, ACM, New York (1996) 358–371.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Xavier Leroy Atsushi Ohori

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kobayashi, N. (1998). Type-based analysis of concurrent programs. In: Leroy, X., Ohori, A. (eds) Types in Compilation. TIC 1998. Lecture Notes in Computer Science, vol 1473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055523

Download citation

  • DOI: https://doi.org/10.1007/BFb0055523

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64925-0

  • Online ISBN: 978-3-540-68308-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics