Analysing input/output-capabilities of mobile processes with a generic type system

Journal of Logic and Algebraic Programming

Volumn 63, Issue 1, 2005, Pages 35-58

  König, Barbara ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

calculus; Lattice ordered monoids; Type systems

Indexed keywords

ABSTRACTING; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; COSTS; INFORMATION USE; LINEAR ALGEBRA;

Π-CALCULUS; LATTICE-ORDERED MONOIDS; MOBILE PROCESSES; TYPE SYSTEMS;

LOGIC PROGRAMMING;

EID: 14644439913     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jlap.2004.01.004     Document Type: Article

References (24)

1. Nielson F., Nielson H.R., Hankin C. Principles of Program Analysis. 1999;Springer-Verlag
2. Pierce B., Sangiorgi D. Typing and subtyping for mobile processes. Journal of Mathematical Structures in Computer Science. 6(5):1996;409-454
3. Kobayashi N., Pierce B.C., Turner D.N. Linearity and the pi-calculus. ACM Transactions on Programming Languages and Systems. 21(5):1999;914-947
4. Kobayashi N. A partially deadlock-free typed process calculus. ACM Transactions on Programming Languages and Systems (TOPLAS). 20(2):1998;436-482
5. Kobayashi N. A type system for lock-free processes. Information and Computation. 177:2002;122-159
6. Abadi M. Secrecy by typing in security protocols. Journal of the ACM. 46(5):1999;749-786
7. Bodei C., Degano P., Nielson F., Nielson H.R. Control flow analysis for the pi-calculus. Sangiorgi D., de Simone R. Proceedings of CONCUR'98, LNCS 1466. 1998;84-98 Springer-Verlag
8. Honda K., Vasconcelos V., Yoshida N. Secure information flow as typed process behaviour. in: Proceedings of ESOP'00. LNCS 1782. 2000;180-199 Springer-Verlag
9. Hennessy M., Riely J. Information flow vs. resource access in the asynchronous pi-calculus. in: Proceedings of ICALP'00. LNCS 1853. 2000;415-427 Springer-Verlag
10. Riely J., Hennessy M. Distributed processes and location failures. in: Proceedings of ICALP'97. LNCS 1256. 1997;471-481 Springer-Verlag
11. Yoshida N., Hennessy M. Assigning types to processes. Information and Computation. 174(2):2002;143-179
12. Honda K. Composing processes. in: Proceedings of POPL'96. 1996;344-357 ACM
13. Igarashi A., Kobayashi N. A generic type system for the pi-calculus. in: Proceedings of POPL'01. 2001;128-141 ACM
14. Kobayashi N., Saito S., Sumii E. An implicitly-typed deadlock-free process calculus. in: Proceedings of CONCUR 2000. LNCS 1877. 2000;489-503 Springer-Verlag
15. Kobayashi N., Nakade M., Yonezawa A. Static analysis of communication for asynchronous concurrent programming languages. in: Proceedings of SAS'95. LNCS 983. 1995;225-242 Springer-Verlag
16. Milner R., Parrow J., Walker D. A calculus of mobile processes. Information and Computation. 100(1):1992;1-77
17. Milner R. The polyadic. π -calculus: a tutorial Hamer F.L., Brauer W., Schwichtenberg H. Logic and Algebra of Specification. 1993;Springer-Verlag, Heidelberg
18. Berry G., Boudol G. The chemical abstract machine. Theoretical Computer Science. 96:1992;217-248
19. Birkhoff G. Lattice Theory. third ed.:1967;American Mathematical Society
20. U. Nestmann, M. Steffen, Typing confluence, in: Second International ERCIM Workshop on Formal Methods in Industrial Critical Systems, Cesena, Italy, 4-5 July 1997, 1997, pp. 77-101
21. Igarashi A., Kobayashi N. Type reconstruction for linear. π -calculus with I/O subtyping Information and Computation. 161:2000;1-44
22. B. König, Description and verification of mobile processes with graph rewriting techniques, Ph.D. Thesis, Technische Universität München, 1999
23. König B. Generating type systems for process graphs. in: Proceedings of CONCUR'99. LNCS 1664. 1999;352-367 Springer-Verlag
24. König B. A general framework for types in graph rewriting. in: Proceedings of FST TCS'00. LNCS 1974. 2000;373-384 Springer-Verlag