default search action
Bard Bloom
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [c21]Bard Bloom, Martin Hirzel:
Robust scripting via patterns. DLS 2012: 29-40 - [c20]Bard Bloom, David Grove
, Benjamin Herta, Ashish Sabharwal, Horst Samulowitz, Vijay A. Saraswat:
SatX10: A Scalable Plug&Play Parallel SAT Framework - (Tool Presentation). SAT 2012: 463-468
2000 – 2009
- 2009
- [j13]Bard Bloom, Paul T. Keyser
Ferret: Programming language support for multiple dynamic classification. Comput. Lang. Syst. Struct. 35(3): 306-321 (2009) - [c19]Bard Bloom, John Field, Nathaniel Nystrom, Johan Östlund, Gregor Richards, Rok Strnisa, Jan Vitek, Tobias Wrigstad:
Thorn: robust, concurrent, extensible scripting on the JVM. OOPSLA 2009: 117-136 - [c18]Bard Bloom, John Field, Nathaniel Nystrom, Johan Östlund, Gregor Richards, Rok Strnisa, Jan Vitek, Tobias Wrigstad:
Thorn: robust concurrent scripting on the JVM. OOPSLA Companion 2009: 789-790 - 2008
- [c17]Martin Hirzel, Nathaniel Nystrom, Bard Bloom, Jan Vitek:
Matchete: Paths through the Pattern Matching Jungle. PADL 2008: 150-166 - 2006
- [j12]Steven Abrams, Bard Bloom, Paul T. Keyser
Architectural thinking and modeling with the Architects' Workbench. IBM Syst. J. 45(3): 481-500 (2006) - 2005
- [c16]Bard Bloom:
Lopsided Little Languages: Experience with XQuery. XIME-P 2005 - 2004
- [j11]Bard Bloom, Wan J. Fokkink
Precongruence formats for decorated trace semantics. ACM Trans. Comput. Log. 5(1): 26-78 (2004) - 2002
- [i1]Bard Bloom, Wan J. Fokkink, Rob J. van Glabbeek:
Precongruence Formats for Decorated Trace Semantics. CoRR cs.LO/0204039 (2002) - 2000
- [c15]Bard Bloom, Wan J. Fokkink
Precongruence Formats for Decorated Trace Preorders. LICS 2000: 107-118
1990 – 1999
- 1997
- [j10]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
- [j9]Bard Bloom, Sorin Istrail, Albert R. Meyer
Bisimulation Can't be Traced. J. ACM 42(1): 232-268 (1995) - [j8]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) - [j7]Bard Bloom:
Structural Operational Semantics for Weak Bisimulations. Theor. Comput. Sci. 146(1&2): 25-68 (1995) - [c14]Ashvin Dsouza, Bard Bloom:
Generating BDD Models for Process Algebra Terms. CAV 1995: 16-30 - [c13]Ashvin Dsouza, Bard Bloom:
On the Expressive Power of CCS. FSTTCS 1995: 309-323 - [c12]Bard Bloom:
Structured Operational Semantics as a Specification Language. POPL 1995: 107-117 - 1994
- [j6]Bard Bloom:
When is Partial Trace Equivalence Adequate? Formal Aspects Comput. 6(3): 317-338 (1994) - [j5]Luca Aceto, Bard Bloom, Frits W. Vaandrager:
Turning SOS Rules into Equations. Inf. Comput. 111(1): 1-52 (1994) - [j4]Bard Bloom, Alan D. Fekete:
Self-sufficiency and critical thinking in the programming languages course. ACM SIGCSE Bull. 26(2): 9-18 (1994) - [c11]Bard Bloom:
CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms. POPL 1994: 339-347 - 1993
- [c10]Bard Bloom:
Structured Operational Sematics for Process Algebras and Equational Axiom Systems. CONCUR 1993: 539-540 - 1992
- [j3]Bard Bloom, Albert R. Meyer
Experimenting with Process Equivalence. Theor. Comput. Sci. 101(2): 223-237 (1992) - [c9]Luca Aceto, Bard Bloom, Frits W. Vaandrager:
Turning SOS Rules into Equations. LICS 1992: 113-124 - [c8]Bard Bloom, Robert Paige:
Computing Ready Simulations Efficiently. NAPAW 1992: 119-134 - [c7]Sam Weber, Bard Bloom, Geoffrey Brown:
Compiling Joy Into Silicon: An Exercise in Applied Structural Operational Semantics. REX Workshop 1992: 639-659 - 1991
- [c6]Bard Bloom, Marta Z. Kwiatkowska:
Trade-Offs in True Concurrency: Pomsets and Mazurkiewicz Traces. MFPS 1991: 350-375 - [c5]Fred B. Schneider, Bard Bloom, Keith Marzullo:
Putting Time into Proof Outlines. REX Workshop 1991: 618-639 - 1990
- [j2]Bard Bloom:
Can LCF be Topped? Flat Lattice Models of Typed lambda-Calculus. Inf. Comput. 87(1/2): 263-300 (1990)
1980 – 1989
- 1989
- [c4]Bard Bloom, Albert R. Meyer:
A Remark on Bisimulation Between Probabilistic Processes. Logic at Botik 1989: 26-40 - 1988
- [j1]Bard Bloom:
Constructing Two-Writer Atomic Registers. IEEE Trans. Computers 37(12): 1506-1514 (1988) - [c3]Bard Bloom:
Can LCF Be Topped? Flat Lattice models of Typed Lambda Calculus (Preliminary Report). LICS 1988: 282-295 - [c2]Bard Bloom, Sorin Istrail, Albert R. Meyer:
Bisimulation Can't Be Traced. POPL 1988: 229-239 - 1987
- [c1]Bard Bloom:
Constructing Two-Writer Atomic Registers. PODC 1987: 249-259
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: