Atsushi Igarashi and Naoki Kobayashi. A generic type system for the pi-calculus. In Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 128--141. ACM Press, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Correspondence Assertions for Process Synchronization.. - Bonelli, Compagnoni.. (2003) (3 citations) (Correct)
....on x (if label l 1 was selected) or the type of y may depend on x and z (if the label l 2 was selected) Thus, in the present work, dependency spans whole sessions. Recently, type systems where CCS like processes are used for typing process expressions have appeared. The generic type systems of [15] is an example, although they do not incorporate correspondence assertions (however see Section 4) Another approach is [5] in which models (types as CCS processes) of calculus expressions are obtained and the validity of temporal formulas are analyzed through model checking techniques in order ....
....account number which the ATM communicates to the Bank is exactly the same as the one punched in by the client as received by the ATM. It would be interesting to enrich the set of assertion labels and thus consider more expressive constraint equations. Session types look much like processes. In [15] a generic type system for the calculus is studied in which types are CCS like processes. They suggest that it is possible to integrate a theory of correspondence assertions into their framework. We are currently looking into this issue. Additional future work includes developing the formal ....
Igarashi, A. and N. Kobayashi, A generic type system for the pi-calculus, in: Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (2001), pp. pp.128-141.
Typing Correspondence Assertions for Communication Protocols - Gordon, Jeffrey (2001) (22 citations) (Correct)
....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 dependent in the sense that they may include the names of channels; to the best of our knowledge, this is the rst dependent type system for the calculus. Another system of dependent types for a concurrent language is Flanagan and Abadi s system [FA99] for ....
A. Igarashi and N. Kobayashi. A generic type system for the pi calculus. In 28th ACM Symposium on Principles of Programming Languages, pages 128-141, 2001.
Strong Normalisation in the π-Calculus - Yoshida, Berger, Honda (2001) (1 citation) (Correct)
....resulting in a new effective method to ensure SN for name passing processes. As our initial example of server client interaction suggests, SN in processes is closely related to liveness. Yoshida [66] presents a typed p calculus with a local liveness property. Kobayashi and his colleagues [38, 40 42] propose several typing systems which ensure different forms of liveness; for example [41] time quotas are assigned to communications for this purpose. Sangiorgi [56] proposes a typing system to guarantee what he calls receptiveness, which means that an appropriate input prefix is always ....
....and A records the action modes attached to names and causality between names. For example, the copy cat in Example 2.2 (1) is typed as y : ht; ti;x : ht; ti [x y] x y where ht; ti denotes a pair of input and output types. The typing in this format is similar to those proposed in [17, 38] where types are CCS or p terms. Compared to [17, 38] the syntax of action types of the present type discipline (in this format) is simpler since the maximum path length is at most 1; hence an action type is essentially representable as parallel composition of ( a: b 1 j : b n ) The merit of ....
[Article contains additional citation context not shown here]
Igarashi, A. and Kobayashi, N., A generic type system for the pi-calculus, POPL'01, ACM, 2001.
Strong Normalisation in the π-Calculus - Yoshida, Berger, Honda (2001) (1 citation) (Correct)
....effective method to ensure SN for name passing processes. As our initial example of server client interaction suggests, SN in processes is closely related to liveness properties in interaction. Yoshida [47] presents a typed p calculus with a local liveness property. Kobayashi and his colleagues [26, 28 30] propose several typing systems which ensure a form of liveness (in [29] time quotas are assigned to communications for this purpose) Unlike the present work, these and other preceding typing systems for p calculus [9, 11, 18, 19, 39, 41] do not guarantee SN and the associated liveness properties ....
Igarashi, A. and Kobayashi, N., A generic type system for the picalculus, POPL'01, ACM, 2001.
Type-Based Information Flow Analysis for the Pi-Calculus - Kobayashi (2003) (2 citations) Self-citation (Kobayashi) (Correct)
No context found.
A. Igarashi and N. Kobayashi. A generic type system for the pi-calculus. Theor. Comput. Sci. To appear. A preliminary summary appeared in Proceedings of POPL 2001, pp.128-141.
Type Systems for Concurrent Programs - Kobayashi (2002) Self-citation (Kobayashi) (Correct)
No context found.
A. Igarashi and N. Kobayashi. A generic type system for the pi-calculus. In Proc. of POPL, pages 128--141, January 2001.
Time Regions and Effects for Resource Usage Analysis - Kobayashi (2003) Self-citation (Kobayashi) (Correct)
No context found.
A. Igarashi and N. Kobayashi. A generic type system for the pi-calculus. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pages 128--141, January 2001.
A Type System for Lock-Free Processes - Kobayashi (2002) (1 citation) Self-citation (Kobayashi) (Correct)
No context found.
Atsushi Igarashi and Naoki Kobayashi. A generic type system for the pi-calculus. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pages 128--141, January 2001.
A Generic Type System for the Pi-Calculus - Igarashi, Kobayashi (2001) (30 citations) Self-citation (Igarashi Kobayashi) (Correct)
No context found.
A. Igarashi and N. Kobayashi. A generic type system for the pi-calculus. Tech. rep., Department of Information Science, University of Tokyo, 2000. to appear.
Resource Usage Analysis - Igarashi, Kobayashi (2002) (27 citations) Self-citation (Igarashi Kobayashi) (Correct)
No context found.
A. Igarashi and N. Kobayashi. A generic type system for the pi-calculus. In Proc. of POPL, pages 128--141, 2001.
Time Regions and Effects for Resource Usage Analysis - Kobayashi (2003) Self-citation (Kobayashi) (Correct)
No context found.
A. Igarashi and N. Kobayashi. A generic type system for the pi-calculus. In Proceedings of ACM SIGPLAN /SIGACT Symposium on Principles of Programming Languages, pages 128--141, January 2001.
CLL: A Concurrent Language Built from Logical Principles - Garg (2005) (Correct)
No context found.
Atsushi Igarashi and Naoki Kobayashi. A generic type system for the pi-calculus. In Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 128--141. ACM Press, 2001.
Security Policies as Membranes in Systems for Global.. - Gorla, Hennessy, Sassone (2004) (Correct)
No context found.
A. Igarashi and N. Kobayashi. A generic type system for the pi-calculus. In Proceedings of POPL '01, pages 128--141. ACM, 2001.
Instant Polymorphic Type Systems for Mobile Process Calculi.. - Makholm, Wells (2005) (2 citations) (Correct)
No context found.
A. Igarashi, N. Kobayashi. A generic type system for the pi-calculus. In Conf. Rec. POPL '01: 28th ACM Symp. Princ. of Prog. Langs., 2001.
Instant Polymorphic Type Systems for Mobile Process Calculi.. - Makholm, Wells (2004) (2 citations) (Correct)
No context found.
A. Igarashi, N. Kobayashi. A generic type system for the pi-calculus. In Conf. Rec. POPL '01: 28th ACM Symp. Princ. of Prog. Langs., 2001.
Security Policies as Membranes in Systems for Global Computing - Gorla, al. (2004) (Correct)
No context found.
A. Igarashi and N. Kobayashi. A generic type system for the pi-calculus. In Proceedings of POPL '01, pages 128--141. ACM, 2001.
Instant Polymorphic Type Systems for Mobile Process Calculi.. - Makholm, Wells (2004) (2 citations) (Correct)
No context found.
A. Igarashi, N. Kobayashi. A generic type system for the pi-calculus. In Conf. Rec. POPL '01: 28th ACM Symp. Princ. of Prog. Langs., 2001.
Session Types for Functional Multithreading - Vasconcelos, Gay, Ravara (2004) (3 citations) (Correct)
No context found.
A. Igarashi and N. Kobayashi. A generic type system for the pi-calculus. Theoretical Computer Science, 311(1--3):121--163, 2003.
SafeJava: A Unified Type System for Safe Programming - Boyapati (2004) (2 citations) (Correct)
No context found.
Atsushi Igarashi and Naoki Kobayashi. A generic type system for the Pi-calculus. In Principles of Programming Languages (POPL), January 2001.
Ownership Types for Safe Programming: Preventing Data.. - Boyapati, Lee, Rinard (2002) (21 citations) (Correct)
No context found.
A. Igarashi and N. Kobayashi. A generic type system for the Pi-calculus. In Principles of Programming Languages (POPL), January 2001.
Recovering Resources in the π-Calculus - Teller (Correct)
No context found.
A. Igarashi and N. Kobayashi. A generic type system for the pi-calculus. In POPL, pages 128--141, 2001.
SafeJava: A Unified Type System for Safe Programming - Boyapati (2004) (2 citations) (Correct)
No context found.
Atsushi Igarashi and Naoki Kobayashi. A generic type system for the Pi-calculus. In Principles of Programming Languages (POPL), January 2001.
SafeJava: A Unified Type System for Safe Programming - Boyapati (2004) (2 citations) (Correct)
No context found.
Atsushi Igarashi and Naoki Kobayashi. A generic type system for the Pi-calculus. In Principles of Programming Languages (POPL), January 2001.
Channel Dependent Types for Higher-Order Mobile Processes.. - Yoshida (2004) (4 citations) (Correct)
No context found.
Igarashi, A. and Kobayashi, N., A Generic Type System for the Pi-Calculus, POPL'01, 128-141, ACM, 2001.
Nomadic π-Calculi: Expressing and Verifying Communication.. - Unyapoth (2001) (Correct)
No context found.
Atsushi Igarashi and Naoki Kobayashi. A generic type system for the picalculus. In Proceedings of POPL '01 [ACM01], pages 128-141.
First 50 documents
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