The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Bard Bloom: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ashvin Dsouza, Bard Bloom
    Generating BDD Models for Process Algebra Terms. [Citation Graph (0, 0)][DBLP]
    CAV, 1995, pp:16-30 [Conf]
  2. Bard Bloom
    Structured Operational Sematics for Process Algebras and Equational Axiom Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:539-540 [Conf]
  3. Bard Bloom, Albert R. Meyer
    A Remark on Bisimulation Between Probabilistic Processes. [Citation Graph (0, 0)][DBLP]
    Logic at Botik, 1989, pp:26-40 [Conf]
  4. Ashvin Dsouza, Bard Bloom
    On the Expressive Power of CCS. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:309-323 [Conf]
  5. Luca Aceto, Bard Bloom, Frits W. Vaandrager
    Turning SOS Rules into Equations [Citation Graph (0, 0)][DBLP]
    LICS, 1992, pp:113-124 [Conf]
  6. Bard Bloom
    Can LCF Be Topped? Flat Lattice models of Typed Lambda Calculus (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:282-295 [Conf]
  7. Bard Bloom, Wan Fokkink, Rob J. van Glabbeek
    Precongruence Formats for Decorated Trace Preorders. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:107-118 [Conf]
  8. Bard Bloom, Marta Z. Kwiatkowska
    Trade-Offs in True Concurrency: Pomsets and Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    MFPS, 1991, pp:350-375 [Conf]
  9. Bard Bloom, Robert Paige
    Computing Ready Simulations Efficiently. [Citation Graph (0, 0)][DBLP]
    NAPAW, 1992, pp:119-134 [Conf]
  10. Bard Bloom
    Constructing Two-Writer Atomic Registers. [Citation Graph (0, 0)][DBLP]
    PODC, 1987, pp:249-259 [Conf]
  11. Bard Bloom
    CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms. [Citation Graph (0, 0)][DBLP]
    POPL, 1994, pp:339-347 [Conf]
  12. Bard Bloom
    Structured Operational Semantics as a Specification Language. [Citation Graph (0, 0)][DBLP]
    POPL, 1995, pp:107-117 [Conf]
  13. Bard Bloom, Sorin Istrail, Albert R. Meyer
    Bisimulation Can't Be Traced. [Citation Graph (0, 0)][DBLP]
    POPL, 1988, pp:229-239 [Conf]
  14. Fred B. Schneider, Bard Bloom, Keith Marzullo
    Putting Time into Proof Outlines. [Citation Graph (0, 0)][DBLP]
    REX Workshop, 1991, pp:618-639 [Conf]
  15. Sam Weber, Bard Bloom, Geoffrey Brown
    Compiling Joy Into Silicon: An Exercise in Applied Structural Operational Semantics. [Citation Graph (0, 0)][DBLP]
    REX Workshop, 1992, pp:639-659 [Conf]
  16. Bard Bloom
    Lopsided Little Languages: Experience with XQuery. [Citation Graph (0, 0)][DBLP]
    XIME-P, 2005, pp:- [Conf]
  17. Bard Bloom, Wan Fokkink, Rob J. van Glabbeek
    Precongruence Formats for Decorated Trace Semantics [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  18. Bard Bloom
    When is Partial Trace Equivalence Adequate? [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1994, v:6, n:3, pp:317-338 [Journal]
  19. Luca Aceto, Bard Bloom, Frits W. Vaandrager
    Turning SOS Rules into Equations [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:111, n:1, pp:1-52 [Journal]
  20. Bard Bloom
    Can LCF be Topped? Flat Lattice Models of Typed lambda-Calculus [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:87, n:1/2, pp:263-300 [Journal]
  21. Bard Bloom, Sorin Istrail, Albert R. Meyer
    Bisimulation Can't be Traced. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:1, pp:232-268 [Journal]
  22. Bard Bloom, Robert Paige
    Transformational Design and Implementation of a New Efficient Solution to the Ready Simulation Problem. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1995, v:24, n:3, pp:189-220 [Journal]
  23. Bard Bloom
    Constructing Two-Writer Atomic Registers. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1988, v:37, n:12, pp:1506-1514 [Journal]
  24. Bard Bloom
    Structural Operational Semantics for Weak Bisimulations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:146, n:1&2, pp:25-68 [Journal]
  25. Bard Bloom, Albert R. Meyer
    Experimenting with Process Equivalence. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:101, n:2, pp:223-237 [Journal]
  26. Bard Bloom, Wan Fokkink, Rob J. van Glabbeek
    Precongruence formats for decorated trace semantics. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2004, v:5, n:1, pp:26-78 [Journal]
  27. Bard Bloom, Allan Cheng, Ashvin Dsouza
    Using a Protean Language to Enhance Expressiveness in Specification. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1997, v:23, n:4, pp:224-234 [Journal]

  28. Thorn: robust, concurrent, extensible scripting on the JVM. [Citation Graph (, )][DBLP]


  29. Thorn: robust concurrent scripting on the JVM. [Citation Graph (, )][DBLP]


  30. Matchete: Paths through the Pattern Matching Jungle. [Citation Graph (, )][DBLP]


  31. Ferret: Programming language support for multiple dynamic classification. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.303secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002