| 2012 | DLS | Robust scripting via patterns. | Bard Bloom, Martin Hirzel |
| 2012 | SAT | SatX10: A Scalable Plug&Play Parallel SAT Framework - (Tool Presentation). | Bard Bloom, David Grove, Benjamin Herta, Ashish Sabharwal, Horst Samulowitz, Vijay A. Saraswat |
| 2009 | OOPSLA | Thorn: robust, concurrent, extensible scripting on the JVM. | Bard Bloom, John Field, Nathaniel Nystrom, Johan stlund, Gregor Richards, Rok Strnisa, Jan Vitek, Tobias Wrigstad |
| 2009 | OOPSLA | Thorn: robust concurrent scripting on the JVM. | Bard Bloom, John Field, Nathaniel Nystrom, Johan stlund, Gregor Richards, Rok Strnisa, Jan Vitek, Tobias Wrigstad |
| 2008 | PADL | Matchete: Paths through the Pattern Matching Jungle. | Martin Hirzel, Nathaniel Nystrom, Bard Bloom, Jan Vitek |
| 2000 | LICS | Precongruence Formats for Decorated Trace Preorders. | Bard Bloom, Wan J. Fokkink, Rob J. van Glabbeek |
| 1995 | CAV | Generating BDD Models for Process Algebra Terms. | Ashvin Dsouza, Bard Bloom |
| 1995 | POPL | Structured Operational Semantics as a Specification Language. | Bard Bloom |
| 1994 | POPL | CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms. | Bard Bloom |
| 1993 | CONCUR | Structured Operational Sematics for Process Algebras and Equational Axiom Systems. | Bard Bloom |
| 1992 | LICS | Turning SOS Rules into Equations | Luca Aceto, Bard Bloom, Frits W. Vaandrager |
| 1991 | MFPS | Trade-Offs in True Concurrency: Pomsets and Mazurkiewicz Traces. | Bard Bloom, Marta Z. Kwiatkowska |
| 1988 | LICS | Can LCF Be Topped? Flat Lattice models of Typed Lambda Calculus (Preliminary Report) | Bard Bloom |
| 1988 | POPL | Bisimulation Can't Be Traced. | Bard Bloom, Sorin Istrail, Albert R. Meyer |
| 1987 | PODC | Constructing Two-Writer Atomic Registers. | Bard Bloom |