Bard Bloom

35 papers A* 8A 2B 2C 2Journal 14Unranked 7
YearRankTypeTitle / Venue / Authors
2012 C conf
Robust scripting via patterns.
DLS
Bard Bloom, Martin Hirzel
2012 A conf
SatX10: A Scalable Plug&Play Parallel SAT Framework - (Tool Presentation).
SAT
Bard Bloom, David Grove, Benjamin Herta, Ashish Sabharwal, Horst Samulowitz, Vijay A. Saraswat
2009 J jnl
Ferret: Programming language support for multiple dynamic classification.
Comput. Lang. Syst. Struct.
Bard Bloom, Paul T. Keyser, Ian Simmonds, Mark N. Wegman
2009 — conf
Thorn: robust concurrent scripting on the JVM.
OOPSLA Companion
Bard Bloom, John Field, Nathaniel Nystrom, Johan Östlund, Gregor Richards, Rok Strnisa, Jan Vitek, Tobias Wrigstad
2009 A conf
Thorn: robust, concurrent, extensible scripting on the JVM.
OOPSLA
Bard Bloom, John Field, Nathaniel Nystrom, Johan Östlund, Gregor Richards, Rok Strnisa, Jan Vitek, Tobias Wrigstad
2008 C conf
Matchete: Paths through the Pattern Matching Jungle.
PADL
Martin Hirzel, Nathaniel Nystrom, Bard Bloom, Jan Vitek
2006 J jnl
Architectural thinking and modeling with the Architects' Workbench.
IBM Syst. J.
Steven Abrams, Bard Bloom, Paul T. Keyser, Doug Kimelman, Eric Nelson, Wendy Neuberger, Tova Roth, Ian Simmonds, Steven Tang, John M. Vlissides
2005 — conf
Lopsided Little Languages: Experience with XQuery.
XIME-P
Bard Bloom
2004 J jnl
Precongruence formats for decorated trace semantics.
ACM Trans. Comput. Log.
Bard Bloom, Wan J. Fokkink, Rob J. van Glabbeek
2002 J jnl
Precongruence Formats for Decorated Trace Semantics
CoRR
Bard Bloom, Wan J. Fokkink, Rob J. van Glabbeek
2000 A* conf
Precongruence Formats for Decorated Trace Preorders.
LICS
Bard Bloom, Wan J. Fokkink, Rob J. van Glabbeek
1997 J jnl
Using a Protean Language to Enhance Expressiveness in Specification.
IEEE Trans. Software Eng.
Bard Bloom, Allan Cheng, Ashvin Dsouza
1995 J jnl
Bisimulation Can't be Traced.
J. ACM
Bard Bloom, Sorin Istrail, Albert R. Meyer
1995 A* conf
Generating BDD Models for Process Algebra Terms.
CAV
Ashvin Dsouza, Bard Bloom
1995 — conf
On the Expressive Power of CCS.
FSTTCS
Ashvin Dsouza, Bard Bloom
1995 J jnl
Structural Operational Semantics for Weak Bisimulations.
Theor. Comput. Sci.
Bard Bloom
1995 A* conf
Structured Operational Semantics as a Specification Language.
POPL
Bard Bloom
1995 J jnl
Transformational Design and Implementation of a New Efficient Solution to the Ready Simulation Problem.
Sci. Comput. Program.
Bard Bloom, Robert Paige
1994 A* conf
CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms.
POPL
Bard Bloom
1994 J jnl
Self-sufficiency and critical thinking in the programming languages course.
ACM SIGCSE Bull.
Bard Bloom, Alan D. Fekete
1994 J jnl
Turning SOS Rules into Equations
Inf. Comput.
Luca Aceto, Bard Bloom, Frits W. Vaandrager
1994 J jnl
When is Partial Trace Equivalence Adequate?
Formal Aspects Comput.
Bard Bloom
1993 B conf
Structured Operational Sematics for Process Algebras and Equational Axiom Systems.
CONCUR
Bard Bloom
1992 — conf
Compiling Joy Into Silicon: An Exercise in Applied Structural Operational Semantics.
REX Workshop
Sam Weber, Bard Bloom, Geoffrey Brown
1992 — conf
Computing Ready Simulations Efficiently.
NAPAW
Bard Bloom, Robert Paige
1992 J jnl
Experimenting with Process Equivalence.
Theor. Comput. Sci.
Bard Bloom, Albert R. Meyer
1992 A* conf
Turning SOS Rules into Equations
LICS
Luca Aceto, Bard Bloom, Frits W. Vaandrager
1991 — conf
Putting Time into Proof Outlines.
REX Workshop
Fred B. Schneider, Bard Bloom, Keith Marzullo
1991 B conf
Trade-Offs in True Concurrency: Pomsets and Mazurkiewicz Traces.
MFPS
Bard Bloom, Marta Z. Kwiatkowska
1990 J jnl
Can LCF be Topped? Flat Lattice Models of Typed lambda-Calculus
Inf. Comput.
Bard Bloom
1989 — conf
A Remark on Bisimulation Between Probabilistic Processes.
Logic at Botik
Bard Bloom, Albert R. Meyer
1988 A* conf
Bisimulation Can't Be Traced.
POPL
Bard Bloom, Sorin Istrail, Albert R. Meyer
1988 A* conf
Can LCF Be Topped? Flat Lattice models of Typed Lambda Calculus (Preliminary Report)
LICS
Bard Bloom
1988 J jnl
Constructing Two-Writer Atomic Registers.
IEEE Trans. Computers
Bard Bloom
1987 A* conf
Constructing Two-Writer Atomic Registers.
PODC
Bard Bloom