N. Kobayashi. A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems, 20(2):436--482, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Typed Behavioural Equivalences for Processes in the Presence .. - Hennessy, Rathke (2002) (10 citations) (Correct)
....theory of distributed systems. They are essentially a form of static analysis which help in the elimination of run time errors from programs. Within the theory of distributed systems this intuitive notion of run time error has been extended to include a diverse range of properties. For example in [14,3] type systems have been designed to detect potential deadlocks while [19] introduced a system of types for the calculus which are used to control the interpretation of the calculus. This system of types was extended further in [18] and now forms the basis for the powerful type system ....
Naoki Kobayashi. A partially deadlock-free typed process calculus. In Proceedings, Twelth Annual IEEE Symposium on Logic in Computer Science, pages 128-139, Warsaw, Poland, 29 June{2 July 1997. IEEE Computer Society Press.
Typing Non-uniform Concurrent Objects - Ravara (1999) (10 citations) (Correct)
....[San99b] Deadlock detection. In the context of the calculus, there is some work on deadlock detection, that is, a message sent but never received, or a receiver waiting for a message that never arrives. Kobayashi et al. guarantee partial deadlock freedom and partial con uence of programs [Kob97, SK98] via a type system that generalises the input output modes and linearity. Instead of multiplicities, types are annotated with a usage that is a term of a very simple process algebra build from 0, input pre xing, output pre xing, parallel composition, and bang (any number of times) A ....
Naoki Kobayashi. A partially deadlock-free typed process calculus. In Proceedings of LICS'97, pages 128-139. Computer Society Press, 1997. Extended version as Technical Report 97-02, University of Tokyo, Japan.
Global/Local Subtyping for a Distributed π-calculus - Sewell (1997) (Correct)
....scope of this paper, however, so they are not reflected in the calculus. A number of refined type systems for calculi have been studied, addressing polymorphism [FLMR97, LW95, PS97, Tur96, Vas94] directionality [Ode95, PS96] linearity and receptiveness [Ama97, KPT96, San97] deadlock freedom [Kob97], object encodings [San96] confluence [Nie96, NS97] type inference [Gay93, VH93] and other phenomena (this is far from exhaustive) Each allows some particular behavioural discipline of processes to be expressed. It may be useful to contrast typing for calculi with the more standard typing for ....
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.
Typing Correspondence Assertions for Communication Protocols - Gordon, Jeffrey (2001) (22 citations) (Correct)
....avoidance [FA99] and access control [SS00] Early type systems for the calculus [Mil99,PS96] focus on regulating the data sent on channels. Subsequent type systems also regulate process behaviour; for example, session types [THK94,HVK98] regulate pairwise interactions and linear types [Kob98] help avoid deadlocks. A recent paper [DG00] explicitly proposes a type and e ect system for the calculus, and the idea of latent e ects on channel types. This idea can also be represented in a recent general framework for concurrent type systems [IK01] Still, the types of our system are ....
N. Kobayashi. A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems, 20:436-482, 1998.
Strong Normalisation in the π-Calculus - Yoshida, Berger, Honda (2001) (1 citation) (Correct)
.... of this paper is a simple refinement of [11] Concretely, the system is based on two central ideas: 1) Linear types [22, 42, 44, 66] which ensure that a channel is used exactly once for input output and, for a replicated channel, an input occurs exactly once and output occurs zero or more times [11, 40, 50, 53, 57]. 2) Action types with causality, where causality is represented by edges in a directed graph whose acyclicity ensures the absence of circular dependencies [42, 44, 66] cf. 22] Transmission of causality is controlled by a form of cut elimination in action types. Let us illustrate these ....
....between dual input and output by keeping the causality between channels. For example, we have: a : a : hence we can type the process in (2) as: Now we can detect a cyclic dependency such as Fwhbci j Fwhcbi in (3) by looking at their types b : and c : [32, 40, 66] (which, when combined, induces a vicious circle) This simple causality information turns the system with possibly diverging processes [10, 11] into a strongly normalising one. The type discipline based on these ideas is formally presented in Section 2. Proving SN for the p Calculus. To prove SN ....
[Article contains additional citation context not shown here]
Kobayashi, N., A partially deadlock-free typed process calculus, ACM TOPLAS, Vol. 20, No. 2, 436--482, 1998.
Strong Normalisation in the π-Calculus - Yoshida, Berger, Honda (2001) (1 citation) (Correct)
.... of this paper is a simple refinement of [9] Concretely, the system is based on two central ideas: Linear types [14, 30, 31, 47] which ensure that a channel is used exactly once for input output and, for a replicated channel, an input occurs exactly once and output occurs zero or more times [9, 28, 34, 37, 41]. Action types with causality, where causality is represented by edges in a directed graph whose acyclicity ensures the absence of circular dependencies [30, 31, 47] Transmission of causality is controlled by a form of cut elimination in action types. Let us illustrate these points by ....
....an appropriate base G, we can type ( being disjoint union) G Fwha 1 ci j Fwha 2 ci j Fwhcbi . a 1 a 2 c b G a(x) bhxi j bhxi) j b(x) chxi j chxi) a c) b c) We can detect a cyclic dependency such as Fwhabi j Fwhbai by looking at their types a b and b a [22, 28, 47]. Proving SN for the p Calculus To prove SN for typable processes, the first idea would be, in the light of the previous examples, to show that reduction steps follow a noncircular ordering on free channels, e.g. the reductions of ahvijFwhabijFwhbci proceed at a, b and c in this order, but in ....
[Article contains additional citation context not shown here]
Kobayashi, N., A partially deadlock-free typed process calculus, ACM TOPLAS, Vol. 20, No. 2, 436--482, 1998.
Typing Correspondence Assertions for Communication Protocols - Gordon, Jeffrey (2002) (22 citations) (Correct)
....channel types. Our type system omits subtyping, for the sake of simplicity, but we expect it would be a straightforward addition. Later type systems for the # calculus also regulate process behaviour; for example, session types [THK94, HVK98] regulate pairwise interactions and linear types [Kob98] help avoid deadlocks. A recent paper [DG00] explicitly proposes a type and e#ect system for the # calculus, and the idea of latent e#ects on channel types. This idea can also be represented in a recent general framework for concurrent type systems [IK01] Still, the types of our system are ....
N. Kobayashi. A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems, 20:436--482, 1998.
Quasi-Linear Types - Kobayashi (1999) (49 citations) Self-citation (Kobayashi) (Correct)
No context found.
N. Kobayashi. A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems, 20(2):436--482, 1998. A preliminary summary appeared in Proceedings of LICS'97, pages 128--139.
Quasi-Linear Types - Kobayashi (1999) (49 citations) Self-citation (Kobayashi) (Correct)
No context found.
N. Kobayashi. A Partially Deadlock-free Typed Process Calculus (I) -- A Simple System --. Technical Report 96-02, Department of Information Science, University of Tokyo, September 1996.
Type Systems for Concurrent Programs - Kobayashi (2002) Self-citation (Kobayashi) (Correct)
No context found.
N. Kobayashi. A partially deadlock-free typed process calculus. ACM Trans. Prog. Lang. Syst., 20(2):436--482, 1998.
An Implicitly-Typed Deadlock-Free Process Calculus - Naoki Kobayashi Shin (4 citations) Self-citation (Kobayashi) (Correct)
No context found.
Naoki Kobayashi. A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems, 20(2):436--482, 1998. A preliminary summary appeared in Proceedings of LICS'97, pages 128--139.
A Type System for Lock-Free Processes - Kobayashi (2002) (1 citation) Self-citation (Kobayashi) (Correct)
No context found.
Naoki Kobayashi. A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems, 20(2):436--482, 1998. A preliminary summary appeared in Proceedings of LICS'97, pages 128--139.
A Generic Type System for the Pi-Calculus - Igarashi, Kobayashi (2001) (30 citations) Self-citation (Kobayashi) (Correct)
No context found.
N. Kobayashi. A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems, 20(2):436--482, 1998.
An Implicitly-Typed Deadlock-Free Process Calculus - Kobayashi, Saito, Sumii (4 citations) Self-citation (Kobayashi) (Correct)
No context found.
N. Kobayashi. A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems, 20(2):436--482, 1998.
A Generic Type System for the Pi-Calculus - Igarashi, Kobayashi (2003) (30 citations) Self-citation (Kobayashi) (Correct)
No context found.
N. Kobayashi. A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems, 20(2):436--482, 1998.
Distributed Concurrent Linear Logic Programming - Kobayashi, Shimizu, Yonezawa (9 citations) Self-citation (Kobayashi) (Correct)
No context found.
N. Kobayashi. A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems, 20(2), 1998. A preliminary summary appeared in Proceedings of LICS'97, pages 128--139.
Type Reconstruction for Linear Pi-Calculus with I/O Subtyping - Igarashi, Kobayashi (2001) (8 citations) Self-citation (Kobayashi) (Correct)
No context found.
Naoki Kobayashi. A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems, 20(2):436--482, 1998. A preliminary summary appeared in proceedings of LICS'97, pages 128--139.
Ensuring Termination by Typability - Deng, Sangiorgi (Correct)
No context found.
N. Kobayashi. A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems, 20(2):436--482, 1998.
Sequentiality and the π-Calculus - Berger, Honda, Yoshida (2001) (Correct)
No context found.
Kobayashi, N., A partially deadlock-free typed process calculus, ACM TOPLAS, Vol. 20, No. 2, 436-482, 1998.
Atomizer: A Dynamic Atomicity Checker for Multithreaded Programs - Flanagan, Freund (2004) (5 citations) (Correct)
No context found.
N. Kobayashi. A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems, 20(2):436-- 482, 1998.
What is a `Good' Encoding of Guarded Choice? - Nestmann (1997) (Correct)
No context found.
N. Kobayashi. A Partially Deadlock-Free Typed Process Calculus. In Proceedings of LICS '97, pages 128--139. Computer Society Press, 1997.
Sequentiality and the π-Calculus - Berger, Honda, Yoshida (2001) (Correct)
No context found.
Kobayashi, N., A partially deadlock-free typed process calculus, ACM TOPLAS, Vol. 20, No. 2, 436-482, 1998.
What are Polymorphically-Typed Ambients? - Amtoft, Kfoury, Pericas-Geertsen (2000) (Correct)
No context found.
N. Kobayashi. A partially deadlock-free typed process calculus. ACM Trans. on Prog. Langs. & Systs., 20(2):436--482,
Typing Non-uniform Concurrent Objects - Antonio Ravara And (1999) (10 citations) (Correct)
No context found.
Naoki Kobayashi. A partially deadlock-free typed process calculus. In Proc. of LICS'97, pages 128--139. Computer Society Press, 1997.
Description and Verification of Mobile Processes with Graph.. - König (Correct)
No context found.
Naoki Kobayashi. A partially deadlock-free typed process calculus. In Twelfth Annual Symposium on Logic in Computer Science (LICS) (Warsaw, Poland), pages 128--139. IEEE, Computer Society Press, 1997. Full version as as Technical Report 97-02, University of Tokyo.
First 50 documents Next 50
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