Alternate document:   Details   A Partially Deadlock-free Typed Process Calculus (II) (97) Naoki Kobayashi

See this document in CiteSeerX!

A Partially Deadlock-Free Typed Process Calculus (1997)  (Make Corrections)  (86 citations)
NAOKI KOBAYASHI University of Tokyo We propose a novel static type system for ...
ACM Transactions on Programming Languages and Systems



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
yl.is.s.utokyo.ac.j...toplas1902.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  kb.cs.titech.ac.jp...publications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: this article is to overcome the above problems by identifying deadlockfree and/or deterministic parts of concurrent programs with a static type system. The important observation behind this solution is that not all parts of concurrent programs suffer from deadlock and nondeterminism: most parts of actual programs should be deadlock-free and/or deterministic. The key ideas in our approach (especially for ensuring partial deadlock-freedom) are (1) to introduce the order of channel use as type... (Update)

Cited by:   More
Ensuring Termination by Typability - Deng, Sangiorgi   (Correct)
Sequentiality and the π-Calculus - Berger, Honda, Yoshida (2001)   (Correct)
Atomizer: A Dynamic Atomicity Checker for Multithreaded Programs - Flanagan, Freund (2004)   (Correct)

Similar documents (at the sentence level):
22.8%:   A Partially Deadlock-free Typed Process Calculus (II) - Kobayashi (1997)   (Correct)

Similar documents based on text:   More   All
0.5:   An Implicitly-Typed Deadlock-Free Process Calculus - Naoki Kobayashi Shin   (Correct)
0.3:   A Partially Deadlock-free Typed Process Calculus (I) -- A.. - Naoki Kobayashi   (Correct)
0.2:   Improving the Accuracy of Subcategorizations Acquired from Corpora - Yoshinaga (2004)   (Correct)

Related documents from co-citation:   More   All
47:   Information and Computation (context) - Milner, Parrow et al. - 1992
43:   Linearity and the pi-calculus - Kobayashi, Pierce et al. - 1996
27:   Pict: A programming language based on the pi-calculus - Pierce, Turner - 1997

BibTeX entry:   (Update)

Naoki Kobayashi. A partially deadlock-free typed process calculus. In Proceedings of LICS '97, pages 128--139. Computer Science Press, July 1997. Full version as Technical Report 97-02, University of Tokyo. http://citeseer.ist.psu.edu/kobayashi97partially.html   More

@article{ kobayashi98partially,
    author = "Naoki Kobayashi",
    title = "A Partially Deadlock-Free Typed Process Calculus",
    journal = "ACM Transactions on Programming Languages and Systems",
    volume = "20",
    number = "2",
    pages = "436--482",
    year = "1998",
    url = "citeseer.ist.psu.edu/kobayashi97partially.html" }
Citations not processed or no citations identified.



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.kb.cs.titech.ac.jp/~kobayasi/publications.html):   More
Time Regions and Effects for Resource Usage Analysis - Kobayashi (2003)   (Correct)
Type-Based Information Flow Analysis for Low-Level Languages - Kobayashi, Shirane (2002)   (Correct)
Distributed Concurrent Linear Logic Programming - Kobayashi, Shimizu, Yonezawa   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC