A Concurrent Logical Framework II: Examples and Applications

Abstract : CLF is a new logical framework with an intrinsic notion of concurrency. It is designed as a conservative extension of the linear logical framework LLF with the synchronous connectives (circle multiply, 1 !, and there exists) of intuitionistic linear logic, encapsulated in a monad. LLF is itself a conservative extension of LF with the asynchronous connectives (logical negation, & and T). In this report, the second of two technical reports describing CLF, we illustrate the expressive power of the framework by encoding several different concurrent languages including both the synchronous and asynchronous pi-calculus, an ML-like language with futures, lazy evaluation and concurrency primitives in the style of CML, Petri nets and finally, the security protocol specification language MSR. Throughout the report we assume the reader is already familiar with the formal definition of CLF. For detailed explanation and development of the type theory, please see A Concurrent Logical Framework I: Judgments and Properties WCPW02.

[1]  Kurt Jensen,et al.  A Brief Introduction to Coloured Petri Nets , 1997, TACAS.

[2]  F. Pfenning.  Logic programming in the LF logical framework , 1991 .

[3]  C. Petri.  Kommunikation mit Automaten , 1962 .

[4]  David J. Pym,et al.  A Relevant Analysis of Natural Deduction , 1998, J. Log. Comput..

[5]  Iliano Cervesato,et al.  Petri Nets and Linear Logic: a Case Study for Logic Programming , 1995, GULP-PRODE.

[6]  Roger M. Needham,et al.  Using encryption for authentication in large networks of computers , 1978, CACM.

[7]  Glynn Winskel,et al.  Petri Nets as Models of Linear Logic , 1990 .

[8]  Iliano Cervesato.  Typed MSR: Syntax and Examples , 2001, MMM-ACNS.

[9]  Frank Pfenning,et al.  Intensionality, extensionality, and proof irrelevance in modal type theory , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[10]  Roberto Bruni,et al.  Zero-Safe Nets: Comparing the Collective and Individual Token Approaches , 2000, Inf. Comput..

[11]  Frank Pfenning,et al.  A Linear Logical Framework , 2002, Inf. Comput..

[12]  Frank Pfenning,et al.  Logical Frameworks , 2001, Handbook of Automated Reasoning.

[13]  Frank Pfenning,et al.  System Description: Twelf - A Meta-Logical Framework for Deductive Systems , 1999, CADE.

[14]  de Ng Dick Bruijn,et al.  A survey of the project Automath , 1980 .

[15]  Furio Honsell,et al.  A framework for defining logics , 1993, JACM.

[16]  Roberto Bruni,et al.  A Comparison of Petri Net Semantics under the Collective Token Philosophy , 1998 .

[17]  John H. Reppy,et al.  Concurrent programming in ML , 1999 .

[18]  Frank Pfenning,et al.  On equivalence and canonical forms in the LF type theory , 2001, TOCL.

[19]  John C. Mitchell,et al.  A meta-notation for protocol analysis , 1999, Proceedings of the 12th IEEE Computer Security Foundations Workshop.

[20]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .

[21]  Karl Crary,et al.  A Simplified Account of the Metatheory of Linear LF , 2002, Electron. Notes Theor. Comput. Sci..

[22]  Carl A. Gunter,et al.  Normal process representatives , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[23]  Daniel Le Métayer,et al.  Programming by multiset transformation , 1993, CACM.

[24]  Antoni W. Mazurkiewicz.  True versus artificial concurrency , 1995, PSTV.

[25]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[26]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[27]  José Meseguer,et al.  From Petri Nets to Linear Logic , 1989, Category Theory and Computer Science.

[28]  Iliano Cervesato.  A Specification Language for Crypto-Protocols based on Multiset Rewriting, Dependent Types and Subsorting , 2001 .

[29]  Andrew Barber,et al.  Dual Intuitionistic Linear Logic , 1996 .

[30]  Martín Abadi,et al.  A calculus for cryptographic protocols: the spi calculus , 1997, CCS '97.

[31]  John C. Mitchell,et al.  Relating strands and multiset rewriting for security protocol analysis , 2000, Proceedings 13th IEEE Computer Security Foundations Workshop. CSFW-13.

[32]  Dale Miller.  The pi-Calculus as a Theory in Linear Logic: Preliminary Results , 1992, ELP.

[33]  D. Walker,et al.  A concurrent logical framework I: Judgments and properties , 2003 .

[34]  Dale Miller,et al.  Logic programming in a fragment of intuitionistic linear logic , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[35]  Danny Dolev,et al.  On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).