Specifying Properties of Concurrent Computations in CLF

Authors:
Kevin Watkins;Iliano Cervesato;Frank Pfenning;David Walker
Affiliations:
Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA;Carnegie Mellon University -- Qatar Campus, Doha, Qatar;Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA;Department of Computer Science, Princeton University, Princeton, NJ
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 12
Cited 3

Linear logic

Theoretical Computer Science
Notions of computation and monads

Information and Computation
A framework for defining logics

Journal of the ACM (JACM)
Proof theoretic approach to specification languages

Proof theoretic approach to specification languages
&pgr;-calculus in (Co)inductive-type theory

Theoretical Computer Science - Special issues on models and paradigms for concurrency
A mechanized theory of the &pi-calculus in Hol

Nordic Journal of Computing
A Full Formalisation of pi-Calculus Theory in the Calculus of Constructions

TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
A linear logical framework

Information and Computation
A Proof Theory for Generic Judgments: An extended abstract

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Typing correspondence assertions for communication protocols

Theoretical Computer Science
A Semantic Model for Authentication Protocols

SP '93 Proceedings of the 1993 IEEE Symposium on Security and Privacy
A judgmental reconstruction of modal logic

Mathematical Structures in Computer Science

Proof-theoretic and higher-order extensions of logic programming

A 25-year perspective on logic programming
Session types as intuitionistic linear propositions

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Trace matching in a concurrent logical framework

Proceedings of the seventh international workshop on Logical frameworks and meta-languages, theory and practice

Quantified Score

Hi-index	0.00

Visualization

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.