Specifying Properties of Concurrent Computations in CLF

CLF (the Concurrent Logical Framework) is a language for specifying and reasoning about concurrent systems. Its most significant feature is the first-class representation of concurrent executions as monadic expressions. We illustrate the representation techniques available within CLF by applying them to an asynchronous pi-calculus with correspondence assertions, including its dynamic semantics, safety criterion, and a type system with latent effects due to Gordon and Jeffrey.

[1]  David Walker,et al.  A Concurrent Logical Framework: The Propositional Fragment , 2003, TYPES.

[2]  Thomas F. Melham.  A Mechanized Theory of the Pi-Calculus in HOL , 1994, Nord. J. Comput..

[3]  Jawahar Chirimar,et al.  Proof theoretic approach to specification languages , 1995 .

[4]  Daniel Hirschko.  A full formalisation of pi-calculus theory in the Calculus of Constructions , 1997 .

[5]  Dale Miller,et al.  A multiple-conclusion meta-logic , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[6]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

[7]  JEAN-MARC ANDREOLI,et al.  Logic Programming with Focusing Proofs in Linear Logic , 1992, J. Log. Comput..

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

[9]  David Walker,et al.  A Concurrent Logical Framework II: Examples and Applications , 2003 .

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

[11]  Simon S. Lam,et al.  A semantic model for authentication protocols , 1993, Proceedings 1993 IEEE Computer Society Symposium on Research in Security and Privacy.

[12]  Stefan Berghofer,et al.  Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the pi-Calculus and Mechanizing the Theory of Contexts , 2001, FoSSaCS.

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

[14]  Dale Miller,et al.  A proof theory for generic judgments: an extended abstract , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[15]  Dale Miller,et al.  A proof theory for generic judgments , 2005, TOCL.

[16]  M. Nivat.  Fiftieth volume of theoretical computer science , 1988 .

[17]  Andrew D. Gordon,et al.  Ðð Blockinøöóòò Aeóøø× Ò Ìììóööøø Blockin Blockinð Óñôùøøö Ë Blockin , 2007 .

[18]  Frank Pfenning,et al.  A judgmental reconstruction of modal logic , 2001, Mathematical Structures in Computer Science.

[19]  Furio Honsell,et al.  pi-calculus in (Co)inductive-type theory , 2001, Theor. Comput. Sci..

[20]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

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