Specifying Properties of Concurrent Computations in CLF | Zendy

Kevin Watkins | Zendy; Iliano Cervesato | Zendy; Frank Pfenning | Zendy; David Walker | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Specifying Properties of Concurrent Computations in CLF

Author(s) -

Kevin Watkins,

Iliano Cervesato,

Frank Pfenning,

David Walker

Publication year - 2008

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2007.11.013

Subject(s) - computer science , asynchronous communication , programming language , semantics (computer science) , representation (politics) , theoretical computer science , computation , logical framework , class (philosophy) , feature (linguistics) , concurrency , artificial intelligence , computer network , linguistics , philosophy , politics , political science , law

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research