Bard Bloom - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2012

SatX10: A Scalable Plug&Play Parallel SAT Framework - (Tool Presentation)Bard Bloom, David Grove, Benjamin Herta, Ashish Sabharwal, Horst Samulowitz, Vijay A. Saraswat. sat 2012: 463-468 [doi]

Robust scripting via patternsBard Bloom, Martin Hirzel. DLS 2012: 29-40 [doi]

2009

2008

Matchete: Paths through the Pattern Matching JungleMartin Hirzel, Nathaniel Nystrom, Bard Bloom, Jan Vitek. PADL 2008: 150-166 [doi]

2006

Architectural thinking and modeling with the Architects WorkbenchSteven Abrams, Bard Bloom, Paul Keyser, Doug Kimelman, Eric Nelson, Wendy Neuberger, Tova Roth, Ian Simmonds, Steven Tang, John M. Vlissides. IBMSJ, 45(3):481-500, 2006. [doi]

2005

Lopsided Little Languages: Experience with XQueryBard Bloom. ximep 2005: [doi]

2004

Precongruence formats for decorated trace semanticsBard Bloom, Wan Fokkink, Rob J. van Glabbeek. tocl, 5(1):26-78, 2004. [doi]

2002

Precongruence Formats for Decorated Trace SemanticsBard Bloom, Wan Fokkink, Rob J. van Glabbeek. corr, cs.LO/0204039, 2002. [doi]

2000

Precongruence Formats for Decorated Trace PreordersBard Bloom, Wan Fokkink, Rob J. van Glabbeek. lics 2000: 107-118 [doi]

1997

Using a Protean Language to Enhance Expressiveness in SpecificationBard Bloom, Allan Cheng, Ashvin Dsouza. TSE, 23(4):224-234, 1997. [doi]

1995

1994

Turning SOS Rules into EquationsLuca Aceto, Bard Bloom, Frits W. Vaandrager. iandc, 111(1):1-52, May 1994.

When is Partial Trace Equivalence Adequate?Bard Bloom. fac, 6(3):317-338, 1994.

CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErmsBard Bloom. POPL 1994: 339-347

Self-sufficiency and critical thinking in the programming languages courseBard Bloom, Alan D. Fekete. SIGCSE, 26(2):9-18, 1994. [doi]

1993

Structured Operational Sematics for Process Algebras and Equational Axiom SystemsBard Bloom. concur 1993: 539-540

1992

Turning SOS Rules into EquationsLuca Aceto, Bard Bloom, Frits W. Vaandrager. lics 1992: 113-124

Experimenting with Process EquivalenceBard Bloom, Albert R. Meyer. TCS, 101(2):223-237, 1992.

Computing Ready Simulations EfficientlyBard Bloom, Robert Paige. napaw 1993: 119-134

Compiling Joy Into Silicon: An Exercise in Applied Structural Operational SemanticsSam Weber, Bard Bloom, Geoffrey Brown. rex 1993: 639-659

1991

Trade-Offs in True Concurrency: Pomsets and Mazurkiewicz TracesBard Bloom, Marta Z. Kwiatkowska. mfps 1992: 350-375

Putting Time into Proof OutlinesFred B. Schneider, Bard Bloom, Keith Marzullo. rex 1992: 618-639

1990

Can LCF be Topped? Flat Lattice Models of Typed lambda-CalculusBard Bloom. iandc, 87(1/2):263-300, July/August 1990.

1989

A Remark on Bisimulation Between Probabilistic ProcessesBard Bloom, Albert R. Meyer. ershov 1989: 26-40

1988

Constructing Two-Writer Atomic RegistersBard Bloom. TC, 37(12):1506-1514, 1988.

Can LCF Be Topped? Flat Lattice models of Typed Lambda Calculus (Preliminary Report)Bard Bloom. lics 1988: 282-295

Bisimulation Can t Be TracedBard Bloom, Sorin Istrail, Albert R. Meyer. POPL 1988: 229-239

1987

Constructing Two-Writer Atomic RegistersBard Bloom. podc 1987: 249-259

Sign in or sign up to see more results.

runs on WebDSL