From process logic to program logic

ACM SIGPLAN Notices

Volumn 39, Issue 9, 2004, Pages 163-174

  Honda, Kohei ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Duality; Higher Order Functions; Hoare Logic; Mobile Processes; Types; Calculus

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; EMBEDDED SYSTEMS; FEEDBACK; MATHEMATICAL MODELS; SEMANTICS; SPEECH; SYNTACTICS;

DUALITY; HIGHER-ORDER FUNCTIONS; HOARE LOGIC; MOBILE PROCESSES;

FORMAL LOGIC;

EID: 9744226551     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/1016848.1016874     Document Type: Conference Paper

References (61)

1. Abadi, M., Cardelli, L., Curien, P.-L., Formal Parametric Polymorphism, TCS 121, 1-2, (Dec), 9-58. Elsevier, 1993.
2. Abadi, M, Leino, R. A logic for object-oriented programs, pages 682-696, TAPSOFT'97, LNCS, 1997.
3. Abramsky, S., Jagadeesan, R. and Malacaria, P., Full Abstraction for PCF. Info. & Comp. 163 (2000), 409-470.
4. Apt, K.R. Ten Years of Hoare Logic: a survey. TOPLAS. 3:431-483, 1981.
5. Baeten, J.C.M. and Weijland, W.P. Process Algebra. Cambridge University Press, 1990.
6. Berger, M., Honda, K. and Yoshida, N., Sequentially and the π-Calculus, TLCA01, LNCS 2044, 29-45, 2001.
7. Berger, M., Honda, K. and Yoshida, N., Genericity and the π-Calculus, FoSSaCs'03, LNCS 2620, 103-119, 2003.
8. Boudol, G., Asynchrony and the pi-calculus, INRIA Research Report 1702, 1992.
9. Caires, L. and Cardelli, L., A Spatial Logic for Concurrency (Part I). Info. & Comp., 2003.
10. Clint, M. and Hoare C.A.R. Program proving: jumps and functions. Acta Inf. 1:214-224, 1971.
11. Cousot, P. Methods and logics for proving programs. Handbook of Theoretical Computer Science, volume B, 843-993. Elsevier, 1999.
12. Curry, B. and Feys, R. Combinatory Logic. North-Holland, 1958.
13. Dam, M. Proof Systems for π-Calculus Logics. Logic for Concurrency and Synchronization. Studies in Logic and Computing, Oxford University Press, 2003.
14. Gordon, M., Milner, A. and Wadsworth, C., Edinburgh LCF, LNCS 78, 1979.
15. Gunter, C., Semantics of Programming Languages: Structures and Techniques, MIT Press, 1992.
16. Floyd, W. Assigning meaning to programs. Prc. Symp. in Applied Mathematics. 19:19-32, 1967.
17. Francez N. and Pnueli, A. A proof method for cyclic programs. Acta Inf. 9, pp. 133-157, 1978.
18. Girard, J.-Y., Linear Logic, TCS, 50:1-102, 1987.
19. Harel, D. Proving the correctness of regular deterministic programs. TCS, 12:61-81, 1980.
20. Hennessy, M. and Milner, R. Algebraic Laws for Nondeterminism and Concurrency. Journal of ACM, 32:1, pp.137-161, 1985.
21. Hoare, C.A.R. An axiomatic basis of computer programming. CACM, 12:576-580, 1969.
22. Hoare, C.A.R. Procedures and Parameters: an axiomatic approach. Lecture Notes in Mathematics 188, 102-116, Semantics of Algorithmic Languages, Springer, 1971.
23. Hoare, C.A.R. Communicating Sequential Processes, Prentice Hall, 1985.
24. Hoare, C.A.R. and Wirth, N., An axiomatic definition of the programming language PASCAL. Acta Inf. 2:335-355, 1973.
25. Honda, K., Composing Processes, POPL'96, 344-357, ACM, 1996.
26. Honda, K. Sequential Process Logics: Soundness Proofs. Typescript, 50pp. November 2003/January 2004. Available at: www.dcs.qmul.ac.uk/~kohei/logics.
27. Honda, K. Process Logic and Duality: Part (1) Sequential Processes. Typescript, 210pp. March 2004. Available at: www.dcs.qmul.ac.uk/~kohei/logics.
28. Honda, K. and Yoshida, N., A Compositional Logic for Polymorphic Higher-Order Functions. PPDP'04, ACM, 2004.
29. Honda, K. and Tokoro, M. An object calculus for asynchronous communication. ECOOP'91, LNCS 512, 133-147, 1991.
30. Honda, K. and Yoshida, N. Game-theoretic analysis of call-by-value computation. TCS, 221:393-456, 1999.
31. Honda, K. and Yoshida, N., A Uniform Type Structure for Secure Information Flow, POPL'02, 81-92, ACM, 2002.
32. Honda, K. and Yoshida, N., Noninterference proofs from Flow Analysis. To appear in: Journal of Functional Programming, CUP, 2004.
33. Honda, K., Yoshida, N. and Berger, M., Control in the π-Calculus, Proc. CW'04, ACM, 2004.
34. Hyland, M. and Ong, L., "On Full Abstraction for PCF":I, II and III. Info. & Comp. 163 (2000), 285-408.
35. Jacobs, B. et al. Reasoning about Java Classes (Preliminary Report). OOPSLA'98, ACM, 1998.
36. Jones, C.B. Specification and Design of (Parallel) Programs. Proc. IFIP 9th World Computer Congress. North Holland, 321-332, 1983.
37. Kobayashi, N., Pierce, B., and Turner, D., Linear types and the π-calculus, TOPLAS, 21(5):914-947, 1999.
38. Kowaltowsky, T. Axiomatic approach to side effects and general jumps. Acta Informatica 7, 357-360.
39. Laurent, O., Polarized games, LICS 2002, 265-274, IEEE, 2002.
40. Leavens, G. and Baker, A. Enhancing the Pre- and Postcondition Technique for More Expressive Specifications. FM'99: World Congress on Formal Methods, Springer, 1999.
41. Longley, J. and Plotkin, G. Logical Full Abstraction and PCF. Tbilisi Symposium on Logic, Language and Information, 333-352, Stanford, CSLI, 1998.
42. Mendelson, E. Introduction to Mathematical Logic (third edition). Wadsworth Inc., 1987.
43. Milner, R., Communication and Concurrency, Prentice Hall, 1989.
44. Milner, R., Functions as Processes, MSCS. 2(2):119-141, 1992,
45. Milner, R., Speech by Robin Milner on receiving an Honorary Degree from the University of Bologna, ICALP'97, http://www.cs.unibo.it/icalp/Lauree_milner. html.
46. Milner, R., Parrow, J. and Walker, D., A Calculus of Mobile Processes, Info. & Comp. 100(1):1-77, 1992.
47. Milner, R., Parrow, J.G. and Walker, D.J., Modal logics for mobile processes, TCS, 114:149-171, 1993.
48. Milner, R., Polyadic π-Calculus: a tutorial. Proceedings of the International Summer School on Logic Algebra of Specification, Marktoberdorf, 1992.
49. Naur, P. Proof of algorithms by general snapshots. BIT 6, 310-316, 1966.
50. O'Hearn, P., Yang, H. and Reynolds, J., Separation and Information Hiding, POPL'04, 268-280, 2004.
51. Oheimb, D.V., Hoare Logic for Java in Isabelle/HOL. Concurrency: Practice and Experience. John Wiley, 2002.
52. Pierce, B.C., Types and Programming Languages, MIT Press, 2002.
53. Pierce, B.C. and Sangiorgi. D, Typing and subtyping for mobile processes. MSCS, 6(5):409-454, 1996.
54. Plotkin, G. and Abadi, M., A Logic for Parametric Polymorphism, LICS'98, 42-53, IEEE Press, 1998.
55. Poetzsh-Heffter, A. and Muller, P. A programming logic for sequential Java. ESOP'99, LNCS 1576, 162-176, 1999,
56. Reynolds, J. Intuitionistic Reasoning about Shared Mutable Data Structure, Millennial Perspectives in Computer Science, Oxford, 1999.
57. Sangiorgi, D., π-calculus, internal mobility, and agent-passing calculi. TCS, 167(2):235-271, 1996.
58. Walker, D., Objects in the π-calculus. Info. Comp., 116(2):253-271, 1995.
59. Yoshida, N., Berger, M. and Honda, K., Strong Normalisation in the π-Calculus, LICS'01, 311-322, IEEE, 2001. Full version in: Info. & Comp., 191:145-202, 2004.
60. Yoshida, N., Berger, M. and Honda, K., Strong Normalisation in the π-Calculus, LICS'01, 311-322, IEEE, 2001. Full version in: Info. & Comp., 191:145-202, 2004.
61. Yoshida, N., Honda, K. and Berger, M. Linearity and Bisimulation, FoSSaCs 2002, LNCS 2303, 417-433, 2002.