Kevin Watkins, Iliano Cervesato, Frank Pfenning, David Walker  Home/Search
Context
Related
| cmu.edu/~fp/papers/lfm04.ps Cached: PS.gz PS This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PDF Image Update HelpPS.gz PS From: cmu.edu/~fp/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 e#ects due to Gordon and Je#rey. (Update)
Similar documents (at the sentence level):
5.3%: Specifying Properties of Concurrent Computations in CLF - Watkins, Cervesato.. (2004) (Correct)
Active bibliography (related documents): More All
1.0: CLF: A Dependent Logical Framework for Concurrent.. - Watkins, Cervesato.. (2004) (Correct)
0.2: Monadic Concurrent Linear Logic Programming - Lopez, Pfenning, Polakow, Watkins (2005) (Correct)
0.2: Focusing the Inverse Method for Linear Logic - Chaudhuri, Pfenning (2005) (Correct)
Similar documents based on text:
4.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ watkins-specifying,
author = "Kevin Watkins and Iliano Cervesato and Frank Pfenning and David Walker",
title = "Specifying Properties of Concurrent Computations in CLF",
url = "citeseer.ist.psu.edu/watkins04specifying.html" }
Citations (may not include all citations):982 Theoretical Computer Science (context) - Girard - 1987
434 A framework for defining logics - Harper, Honsell et al. - 1993
369 Information and Computation (context) - Moggi - 1991
142 Logic programming with focusing proofs in linear logic - Andreoli - 1992
90 A linear logical framework - Cervesato, Pfenning - 2002
84 Mathematical Structures in Computer Science (context) - Pfenning, Davies et al.
81 A multiple-conclusion meta-logic - Miller - 1994
80 A semantic model for authentication protocols - Woo, Lam
51 A relevant analysis of natural deduction - Ishtiaq, Pym - 1998
38 Proof Theoretic Approach to Specification Languages - Chirimar - 1995
33 Theoretical Computer Science (context) - Honsell, Miculan et al. - 2001
32 Typing correspondence assertions for communication protocols - Gordon, Je - 2003
24 A concurrent logical framework I: Judgments and properties - Watkins, Cervesato et al.
19 A concurrent logical framework II: Examples and applications - Cervesato, Pfenning et al.
16 Higher order abstract syntax with induction IsabelleHOL Form.. (context) - Hirschko, order et al. - 2001
9 A concurrent logical framework: The propositional fragment - Watkins, Cervesato et al.
7 A mechanized theory of the pi-calculus in HOL - Melham - 1995
5 Software specification and verification in rewriting logic - Meseguer - 2002
4 A proof theory for generic judgments - Miller, Tiu - 2003
Documents on the same site (http://www.cs.cmu.edu/~fp/publications.html): More
Verifying Uniqueness in a Logical Framework - Anderson, Pfenning (2004) (Correct)
Compiler Verification in LF - Hannan, Pfenning (1992) (Correct)
Meta-Programming with Names and Necessity - Nanevski, Pfenning (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC