Now showing items 1-11 of 11

• #### Bisimulation Can't Be Traced ﻿

(Cornell University, 1990-08)
In the concurrent languages CCS, two programs are considered the same if they are bisimilar. Several years and many researchers have demonstrated that the theory of bisimulation is mathematically appealing and useful in ...
• #### Can LCF Be Topped? Flat Lattice Models of Typed $\lambda$-Calculus ﻿

(Cornell University, 1989-12)
Plotkin, [Plo77], examines the denotational semantics of PCF (essentially typed $\lambda$-calculus with arithmetic and looping). The standard Scott semantics $\bigvee$ is computationally adequate but not fully abstract; ...
• #### Compiling Joy Into Silicon: a Formally Verified Compiler forDelay-Insensitive Circuits ﻿

(Cornell University, 1996-01)
Manually designing delay-insensitive electronic circuits has proven to be difficult in practice. As an alternative, we designed and implemented a compiler that automatically produces such circuits. The source language ...
• #### Metatheory of the $\pi$-Calculus ﻿

(Cornell University, 1996-01)
Milner's {$\pi$}-calculus is a very influential process algebra in which communication channels are first-class objects. One of the basic concepts in the language is the transmission of one channel along another. This ...
• #### Partial Traces and the Semantics and Logic of CCS-Like Languages ﻿

(Cornell University, 1989-12)
We consider the theory of CCS-Like languages when partial traces (simply finite sequences of actions that the process may perform) are the only observation. We characterize process equivalence, giving relational, logical, ...
• #### Proceedings of the North American Process Algebra Workshop 1993 - Ithaca, NY ﻿

(Cornell University, 1993-08)
This contains the papers presented at the second North American Process Algebra Workshop, August 15, 1993, at Cornell University. Contents: * A Semantic Theory for ML Higher Order Concurrency Primitives (Dominique Bolignano ...
• #### Putting Time into Proof Outlines ﻿

(Cornell University, 1991-09)
• #### Ready, Set, Go: Structural Operational Semantics for Linear-Time Process Algebras ﻿

(Cornell University, 1993-08)
We investigate the relationship between operational semantics, equational semantics, and ready equivalence (a well-known relative of failure equivalence and testing equivalence) in process algebra. We give a class of ...
• #### Structural Operational Semantics for Weak Bisimulations ﻿

(Cornell University, 1993-08)
In this study, we present rule formats for four main notions of bisimulation with silent moves. Weak bisimulation is a congruence for any process algebra defined by WB cool rules; we have similar results for rooted weak ...
• #### Trade-offs in True Concurrency: Pomsets and Mazurkiewicz Traces ﻿

(Cornell University, 1991-08)
We compare finite pomsets and Mazurkiewicz traces, two models of true concurrency which generalize strings. We show that Mazurkiewicz traces are equivalent to a restricted class of pomsets. The restrictions lead to extra ...
• #### When Is Partial Trace Equivalence Adequate? ﻿

(Cornell University, 1991-07)
Two processes are partial trace equivalent if they can perform the same sequences of actions in isolation. Partial trace equivalence is perhaps the simplest possible notion of process equivalence. In general, it is too ...