| 2008 |
|---|
| 29 | EE | Martin Hirzel,
Nathaniel Nystrom,
Bard Bloom,
Jan Vitek:
Matchete: Paths through the Pattern Matching Jungle.
PADL 2008: 150-166 |
| 2006 |
|---|
| 28 | EE | Steven Abrams,
Bard Bloom,
Paul Keyser,
Doug Kimelman,
Eric Nelson,
Wendy Neuberger,
Tova Roth,
Ian Simmonds,
Steven Tang,
John M. Vlissides:
Architectural thinking and modeling with the Architects' Workbench.
IBM Systems Journal 45(3): 481-500 (2006) |
| 2005 |
|---|
| 27 | EE | Bard Bloom:
Lopsided Little Languages: Experience with XQuery.
XIME-P 2005 |
| 2004 |
|---|
| 26 | EE | Bard Bloom,
Wan Fokkink,
Rob J. van Glabbeek:
Precongruence formats for decorated trace semantics.
ACM Trans. Comput. Log. 5(1): 26-78 (2004) |
| 2002 |
|---|
| 25 | EE | Bard Bloom,
Wan Fokkink,
Rob J. van Glabbeek:
Precongruence Formats for Decorated Trace Semantics
CoRR cs.LO/0204039: (2002) |
| 2000 |
|---|
| 24 | EE | Bard Bloom,
Wan Fokkink,
Rob J. van Glabbeek:
Precongruence Formats for Decorated Trace Preorders.
LICS 2000: 107-118 |
| 1997 |
|---|
| 23 | EE | Bard Bloom,
Allan Cheng,
Ashvin Dsouza:
Using a Protean Language to Enhance Expressiveness in Specification.
IEEE Trans. Software Eng. 23(4): 224-234 (1997) |
| 1995 |
|---|
| 22 | | Ashvin Dsouza,
Bard Bloom:
Generating BDD Models for Process Algebra Terms.
CAV 1995: 16-30 |
| 21 | | Ashvin Dsouza,
Bard Bloom:
On the Expressive Power of CCS.
FSTTCS 1995: 309-323 |
| 20 | | Bard Bloom:
Structured Operational Semantics as a Specification Language.
POPL 1995: 107-117 |
| 19 | EE | Bard Bloom,
Sorin Istrail,
Albert R. Meyer:
Bisimulation Can't be Traced.
J. ACM 42(1): 232-268 (1995) |
| 18 | | Bard Bloom,
Robert Paige:
Transformational Design and Implementation of a New Efficient Solution to the Ready Simulation Problem.
Sci. Comput. Program. 24(3): 189-220 (1995) |
| 17 | EE | Bard Bloom:
Structural Operational Semantics for Weak Bisimulations.
Theor. Comput. Sci. 146(1&2): 25-68 (1995) |
| 1994 |
|---|
| 16 | | Bard Bloom:
CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms.
POPL 1994: 339-347 |
| 15 | | Bard Bloom:
When is Partial Trace Equivalence Adequate?
Formal Asp. Comput. 6(3): 317-338 (1994) |
| 14 | | Luca Aceto,
Bard Bloom,
Frits W. Vaandrager:
Turning SOS Rules into Equations
Inf. Comput. 111(1): 1-52 (1994) |
| 1993 |
|---|
| 13 | | Bard Bloom:
Structured Operational Sematics for Process Algebras and Equational Axiom Systems.
CONCUR 1993: 539-540 |
| 1992 |
|---|
| 12 | | Luca Aceto,
Bard Bloom,
Frits W. Vaandrager:
Turning SOS Rules into Equations
LICS 1992: 113-124 |
| 11 | | Bard Bloom,
Robert Paige:
Computing Ready Simulations Efficiently.
NAPAW 1992: 119-134 |
| 10 | | Sam Weber,
Bard Bloom,
Geoffrey Brown:
Compiling Joy Into Silicon: An Exercise in Applied Structural Operational Semantics.
REX Workshop 1992: 639-659 |
| 9 | | Bard Bloom,
Albert R. Meyer:
Experimenting with Process Equivalence.
Theor. Comput. Sci. 101(2): 223-237 (1992) |
| 1991 |
|---|
| 8 | | Bard Bloom,
Marta Z. Kwiatkowska:
Trade-Offs in True Concurrency: Pomsets and Mazurkiewicz Traces.
MFPS 1991: 350-375 |
| 7 | | Fred B. Schneider,
Bard Bloom,
Keith Marzullo:
Putting Time into Proof Outlines.
REX Workshop 1991: 618-639 |
| 1990 |
|---|
| 6 | | Bard Bloom:
Can LCF be Topped? Flat Lattice Models of Typed lambda-Calculus
Inf. Comput. 87(1/2): 263-300 (1990) |
| 1989 |
|---|
| 5 | | Bard Bloom,
Albert R. Meyer:
A Remark on Bisimulation Between Probabilistic Processes.
Logic at Botik 1989: 26-40 |
| 1988 |
|---|
| 4 | | Bard Bloom:
Can LCF Be Topped? Flat Lattice models of Typed Lambda Calculus (Preliminary Report)
LICS 1988: 282-295 |
| 3 | | Bard Bloom,
Sorin Istrail,
Albert R. Meyer:
Bisimulation Can't Be Traced.
POPL 1988: 229-239 |
| 2 | | Bard Bloom:
Constructing Two-Writer Atomic Registers.
IEEE Trans. Computers 37(12): 1506-1514 (1988) |
| 1987 |
|---|
| 1 | | Bard Bloom:
Constructing Two-Writer Atomic Registers.
PODC 1987: 249-259 |
