Searching for authors named "Bard Bloom" – sorted by Relevance.
-
Abstract Constructing Two-Writer Atomic Registers
- Abstract Constructing Two-Writer Atomic Registers Bard Bloom* M.I.T. Laboratory for Computer
- Add To MetaCart
-
Ready Simulation, Bisimulation, and the Semantics of CCS-Like Languages
- Ready Simulation, Bisimulation, and the Semantics of CCS-Like Languages Bard Bloom March 12, 1993
- Cited by 14 (3 self) – Add To MetaCart
-
Applying Symbolic Model Checking to Process Algebras
- Applying symbolic model checking to process algebras Ashvin Dsouza Bard Bloom Abstract
- Add To MetaCart
-
SOS Rule Formats for Parameterized and State-Bearing Processes
- SOS Rule Formats for Parameterized and State-Bearing Processes DRAFT Bard Bloom Department
- Cited by 2 (0 self) – Add To MetaCart
-
Bisimulation can't be traced: preliminary report
- Bisimulation Can’t Be Traced: Preliminary Report Bard Bloom* Sorin Istrail MIT Lab. for Computer
- Cited by 47 (6 self) – Add To MetaCart
-
Transformational Design and Implementation Of A New Efficient Solution To The Ready Simulation Problem
- Problem Bard Bloom y Department of Computer Science, Cornell University Ithaca, New York, USA bard
- Cited by 31 (2 self) – Add To MetaCart
-
LCF Should Be Lifted
- LCF Should Be Lifted (Summary) Bard Bloom Jon G. Riecke MIT Laboratory for Computer Science
- Cited by 3 (1 self) – Add To MetaCart
-
Matchete: Paths through the pattern matching jungle
- Matchete: Paths through the Pattern Matching Jungle Martin Hirzel 1 , Nathaniel Nystrom 1 , Bard
- Cited by 1 (0 self) – Add To MetaCart
-
Precongruence Formats for Decorated Trace Semantics
- Precongruence Formats for Decorated Trace Semantics BARD BLOOM IBM T.J. Watson Research Center WAN
- Cited by 9 (2 self) – Add To MetaCart
-
Precongruence Formats for Decorated Trace Preorders
- Precongruence Formats for Decorated Trace Preorders Bard Bloom IBM T.J. Watson Research Center
- Cited by 4 (2 self) – Add To MetaCart

