Travelled to:1 × Belgium
1 × Italy
1 × United Kingdom
7 × USA
Collaborated with:∅ A.Dsouza N.Nystrom J.Vitek W.Fokkink R.J.v.Glabbeek L.Aceto F.W.Vaandrager S.Istrail A.R.Meyer M.Hirzel D.Grove B.Herta A.Sabharwal H.Samulowitz V.A.Saraswat J.Field J.Östlund G.Richards R.Strnisa T.Wrigstad
Talks about:trace (2) model (2) sat (2) can (2) be (2) precongru (1) framework (1) structur (1) preorder (1) parallel (1)
Person: Bard Bloom
DBLP: Bloom:Bard
Contributed to:
2012
2009
2008
2000
1995
19951994199219881988Wrote 10 papers:
- SAT-2012-BloomGHSSS #framework #game studies #named #parallel #satisfiability #scalability
- SatX10: A Scalable Plug&Play Parallel SAT Framework — (BB, DG, BH, AS, HS, VAS), pp. 463–468.
- OOPSLA-2009-BloomFNORSVW #concurrent #named #robust #virtual machine
- Thorn: robust, concurrent, extensible scripting on the JVM (BB, JF, NN, JÖ, GR, RS, JV, TW), pp. 117–136.
- PADL-2008-HirzelNBV #named #pattern matching
- Matchete: Paths through the Pattern Matching Jungle (MH, NN, BB, JV), pp. 150–166.
- LICS-2000-BloomFG
- Precongruence Formats for Decorated Trace Preorders (BB, WF, RJvG), pp. 107–118.
- CAV-1995-DsouzaB #algebra #generative #modelling #process
- Generating BDD Models for Process Algebra Terms (AD, BB), pp. 16–30.
- POPL-1995-Bloom #semantics #specification
- Structured Operational Semantics as a Specification Language (BB), pp. 107–117.
- POPL-1994-Bloom #communication #higher-order #named #λ-calculus
- CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms (BB), pp. 339–347.
- LICS-1992-AcetoBV #equation
- Turning SOS Rules into Equations (LA, BB, FWV), pp. 113–124.
- LICS-1988-Bloom #modelling #λ-calculus
- Can LCF Be Topped? Flat Lattice models of Typed λ Calculus (BB), pp. 282–295.
- POPL-1988-BloomIM #bisimulation
- Bisimulation Can’t Be Traced (BB, SI, ARM), pp. 229–239.