This very readable article discusses the use of an automated reasoning tool (Nuprl) in the context of concurrent programming, in particular Milner's CCS. To this end a denotational model of concurrency based on Aczel's non-well-founded sets is developed (which, by the way, resembles also de Bakker \& Zucker's processes approach, and) which serves as the basis for the implementation of CCS (and presumably also related calculi). The paper provides a short but excellent introduction to CCS and its semantics in terms of the model mentioned above, an overview of the Nuprl system, the implementation of the semantic model in Nuprl, and the Nuprl implementation of CCS and Hennessy-Milner logic.
- A calculus of communicating systems
- A Theory of Communicating Sequential Processes
- Acceptance trees
- Algebraic laws for nondeterminism and concurrency
- Calculi for synchrony and asynchrony
- Combinatory logic. With two sections by William Craig.
- scientific article; zbMATH DE number 3898221 (Why is no real title available?)
- scientific article; zbMATH DE number 3986665 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 48630 (Why is no real title available?)
- Testing equivalences for processes
- Type theory and concurrency
- Type theory and concurrency
- Formalizing process algebraic verifications in the calculus of constructions
- Process realizability
- scientific article; zbMATH DE number 1086866 (Why is no real title available?)
- Automating the refinement of specifications for distributed systems via syntactic transformations
- Type Preservation as a Confluence Problem
- Mechanizing a proof by induction of process algebra specifications in higher order logic
- On process equivalence = equation solving in CCS
- Do-it-yourself type theory
This page was built for publication: Type theory and concurrency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124322)