Completeness and logical full abstraction in modal logics for typed mobile processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5126 LNCS, Issue PART 2, 2008, Pages 99-111

  Berger, Martin ^a   Honda, Kohei ^b   Yoshida, Nobuko ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BISIMILARITY; CHARACTERISATION; EMBEDDINGS; FULL ABSTRACTION; HENNESSY-MILNER LOGICS; HIGHER-ORDER FUNCTIONS; MOBILE PROCESSES; MODAL LOGICS; MULTIPARTY INTERACTIONS; PARALLEL COMPOSITION; PREORDERS; PROGRAM LOGICS; PROOF SYSTEMS; STATE-TRANSFER;

ABSTRACTING; LINGUISTICS; TRANSLATION (LANGUAGES);

TRANSFER FUNCTIONS;

EID: 49049091371     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70583-3_9     Document Type: Conference Paper

References (25)

1. Full version of this paper as a DoC technical report, Imperial College London (to appear, 2008) www.dcs.qmul.ac.uk/~kohei/processlogic
2. Amadio, R., Dam, M.: A modal theory of types for the π-calculus. In: Jonsson, B., Parrow, J. (eds.) FTRTFT 1996. LNCS, vol. 1135, pp. 347-365. Springer, Heidelberg (1996)
3. Berger, M.: A program logic for sequential higher-order control (1): stateless case. Typescript, 36 pages (October 2007)
4. Berger, M., Honda, K., Yoshida, N.: Sequentiality and the π-calculus. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol. 2044, pp. 29-45. Springer, Heidelberg (2001)
5. Bonsangue, M., Kurz, A.: Pi-calculus in logical form. In: LICS 2007, pp. 303-312. IEEE, Los Alamitos (2007)
6. Caires, L., Cardelli, L.: A spatial logic for concurrency. I& C 186(2), 194-235 (2003)
7. Cardelli, L., Gordon, A.D.: Anytime, anywhere: Modal logics for mobile ambients. In: POPL, pp. 365-377 (2000)
8. Dam, M.: Proof systems for pi-calculus logics. In: Logic for Concurrency and Synchronisation. Trends in Logic, Studia Logica Library, pp. 145-212. Kluwer, Dordrecht (2003)
9. Honda, K.: From process logic to program logic. In: ICFP 2004, pp. 163-174. ACM, New York (2004)
10. Honda, K., Berger, M., Yoshida, N.: Descriptive and relative completeness for logics for higher-order functions. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 360-371. Springer, Heidelberg (2006)
11. Honda, K., Vasconcelos, V.T., Kubo, M.: Language Primitives and Type Disciplines for Structured Communication-based Programming. In: Hankin, C. (ed.) ESOP 1998 and ETAPS 1998. LNCS, vol. 1381, pp. 22-138. Springer, Heidelberg (1998)
12. Jones, C.B.: Specification and design of (parallel) programs. In: IFIP Congress, pp. 321-332 (1983)
13. Larsen, K.G.: Proof systems for satisfiability in Hennessy-Milner logic with recursion. Theor. Comput. Sci. 72(2&3), 265-288 (1990)
14. Longley, J., Plotkin, G.: Logical full abstraction and PCF. In: Tbilisi Symposium on Logic, Language and Information, CLSI (1998)
15. Miller, D., Tiu, A.: A proof theory for generic judgments. ACM Transactions on Computational Logic 6(4), 749-783 (2005)
16. Milner, R.: The polyadic π-calculus: A tutorial. In: Proceedings of the International Summer School on Logic Algebra of Specification, Marktoberdorf (1992)
17. Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, Parts I and II. Info.& Comp. 100(1) (1992)
18. Milner, R., Parrow, J., Walker, D.: Modal logics for mobile processes. TCS 114, 149-171 (1993)
19. Simpson, A.: Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS. J. Log. Algebr. Program. 60-61, 287-322 (2004)
20. Stirling, C.: A complete compositional model proof system for a subset of CCS. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol. 194, pp. 475-486. Springer, Heidelberg (1985)
21. Stirling, C.: Modal logics for communicating systems. TCS 49, 311-347 (1987)
22. Takeuchi, K., Honda, K., Kubo, M.: An Interaction-based Language and its Typing System. In: Halatsis, C., Philokyprou, G., Maritsas, D., Theodoridis, S. (eds.) PARLE 1994. LNCS, vol. 817, pp. 398-413. Springer, Heidelberg (1994)
23. Tiu, A.F.: Model checking for pi-calculus using proof search. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 36-50. Springer, Heidelberg (2005)
24. Yoshida, N., Berger, M., Honda, K.: Strong Normalisation in the π-Calculus. Information and Computation 191, 145-202 (2004)
25. Yoshida, N., Honda, K., Berger, M.: Logical reasoning for higher-order functions with local state. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol. 4423, pp. 361-377. Springer, Heidelberg (2007)