eCommons@Cornell >
Browsing by Author Bloom, Bard
Showing results 1 to 11 of 11
Preview  Issue Date  Title  Author(s)   Aug1990  Bisimulation Can't Be Traced  Bloom, Bard; Istrail, Sorin; Meyer, Albert 
 Dec1989  Can LCF Be Topped? Flat Lattice Models of Typed $\lambda$Calculus  Bloom, Bard 
 Jan1996  Compiling Joy Into Silicon: a Formally Verified Compiler forDelayInsensitive Circuits  Weber, Sam; Bloom, Bard; Brown, Geoffrey 
 Jan1996  Metatheory of the $\pi$Calculus  Weber, Sam; Bloom, Bard 
 Dec1989  Partial Traces and the Semantics and Logic of CCSLike Languages  Bloom, Bard 
 Aug1993  Proceedings of the North American Process Algebra Workshop 1993  Ithaca, NY  Bloom, Bard 
 Sep1991  Putting Time into Proof Outlines  Schneider, Fred B.; Bloom, Bard; Marzullo, Keith 
 Aug1993  Ready, Set, Go: Structural Operational Semantics for LinearTime Process Algebras  Bloom, Bard 
 Aug1993  Structural Operational Semantics for Weak Bisimulations  Bloom, Bard 
 Aug1991  Tradeoffs in True Concurrency: Pomsets and Mazurkiewicz Traces  Bloom, Bard; Kwiatkowska, Marta 
 Jul1991  When Is Partial Trace Equivalence Adequate?  Bloom, Bard 
Showing results 1 to 11 of 11
