Abstract
PDF (343 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
), and rules for pairs of dual decidable atoms (such as 
doi:10.1016/j.entcs.2007.11.013 
Copyright © 2008 Elsevier B.V. All rights reserved.
Kevin Watkinsa, 
, Iliano Cervesatob, , Frank Pfenninga, and David Walkerc,
aDepartment of Computer Science, Carnegie Mellon University, Pittsburgh, PA bCarnegie Mellon University – Qatar Campus, Doha, Qatar cDepartment of Computer Science, Princeton University, Princeton, NJ
Available online 23 February 2008.
Abstract
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.
Keywords: logical frameworks; type theory; linear logic; concurrency
References
J.-M. Andreoli, Logic programming with focusing proofs in linear logic, Journal of Logic and Computation 2 (1992), pp. 197–347.
I. Cervesato and F. Pfenning, A linear logical framework, Information & Computation 179 (2002), pp. 19–75. Abstract | 
PDF (381 K)
| View Record in Scopus | Cited By in Scopus (11)
PDF (381 K)
| View Record in Scopus | Cited By in Scopus (11)Cervesato, I., F. Pfenning, D. Walker and K. Watkins, A concurrent logical framework II: Examples and applications, Technical Report CMU-CS-02-102, Department of Computer Science, Carnegie Mellon University (2002), revised May 2003.
Chirimar, J.L., “Proof Theoretic Approach to Specification Languages,” Ph.D. thesis, University of Pennsylvania (1995).
J.-Y. Girard, Linear logic, Theoretical Computer Science 50 (1987), pp. 1–102.
A.D. Gordon and A. Jeffrey, Typing correspondence assertions for communication protocols, Theoretical Computer Science 300 (2003), pp. 379–409. Abstract | PDF (328 K)
| View Record in Scopus | Cited By in Scopus (25)
PDF (328 K)
| View Record in Scopus | Cited By in Scopus (25)R. Harper, F. Honsell and G. Plotkin, A framework for defining logics, Journal of the Association for Computing Machinery 40 (1993), pp. 143–184. View Record in Scopus | Cited By in Scopus (158)
Hirschkoff, D., A full formalisation of pi-calculus theory in the Calculus of Constructions, in: E. Gunter and A. Felty, editors, Proceedings of the 10th International Conference on Theorem Proving in Higher-Order Logics (TPHOLs'97) (1997), pp. 153–169.
F. Honsell, M. Miculan and I. Scagnetto, Pi-calculus in (co)inductive type theories, Theoretical Computer Science 253 (2001), pp. 239–285.
S. Ishtiaq and D. Pym, A relevant analysis of natural deduction, Journal of Logic and Computation 8 (1998), pp. 809–838. View Record in Scopus | Cited By in Scopus (10)
T. Melham, A mechanized theory of the pi-calculus in HOL, Nordic Journal of Computing 1 (1995), pp. 50–76.
Meseguer, J., Software specification and verification in rewriting logic, Lecture notes for the Marktoberdorf International Summer School, Germany (2002).
Miller, D., A multiple-conclusion meta-logic, in: S. Abramsky, editor, Ninth Annual Symposium on Logic in Computer Science (1994), pp. 272–281.
Miller, D. and A. Tiu, A proof theory for generic judgments, in: P. Kolaitis, editor, Proceedings of the 18th Annual Symposium on Logic in Computer Science (LICS'03) (2003), pp. 118–127.
E. Moggi, Notions of computation and monads, Information and Computation 93 (1991), pp. 55–92. Abstract | Article | PDF (1904 K)
| View Record in Scopus | Cited By in Scopus (292)
PDF (1904 K)
| View Record in Scopus | Cited By in Scopus (292)F. Pfenning and R. Davies, A judgmental reconstruction of modal logic, Mathematical Structures in Computer Science 11 (2001), pp. 511–540 notes to an invited talk at the Workshop on Intuitionistic Modal Logics and Applications (IMLA'99), Trento, Italy, July 1999.
Röckl, C., D. Hirschkoff and S. Berghofer, Higher-order abstract syntax with induction in Isabelle/HOL: Formalizing the pi-calculus and mechanizing the theory of contexts, in: F. Honsell and M. Miculan, editors, Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures (FOSSACS'01) (2001), pp. 364–378.
Watkins, K., I. Cervesato, F. Pfenning and D. Walker, A concurrent logical framework I: Judgments and properties, Technical Report CMU-CS-02-101, Department of Computer Science, Carnegie Mellon University (2002), revised May 2003.
Watkins, K., I. Cervesato, F. Pfenning and D. Walker, A concurrent logical framework: The propositional fragment, in: Types for Proofs and Programs, Springer-Verlag LNCS, 2004 Selected papers from the Third International Workshop Torino, Italy, April 2003. To appear.
T. Woo and S. Lam, A semantic model for authentication protocols, Proceedings of the 1993 IEEE Computer Society Symposium on Research in Security and Privacy (1993), pp. 178–194.
