Browsing CAS: Computer Science: Technical Reports by Title

OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

Sort by: Order: Results:

  • Bestavros, Azer; Bradley, Adam D.; Kfoury, Assaf J.; Matta, Ibrahim (Boston University Computer Science Department, 2005-05-01)
    The heterogeneity and open nature of network systems make analysis of compositions of components quite challenging, making the design and implementation of robust network services largely inaccessible to the average ...
  • Lapets, Andrei; Levin, Alex; Parkes, David (Boston University Computer Science Department, 2008-10-09)
    We first introduce a very simple typed language for expressing allocation algorithms that allows automatic verification that an algorithm is monotonic and therefore truthful. The analysis of truthfulness is accomplished ...
  • Kfoury, Assaf J.; Pericas-Geertsen, Santiago M. (Boston University Computer Science Department, 2000-03-06)
    We consider type systems that combine universal types, recursive types, and object types. We study type inference in these systems under a rank restriction, following Leivant's notion of rank. To motivate our work, we ...
  • Bugliesi, Michele; Pericas-Geertsen, Santiago M. (Boston University Computer Science Department, 2000-10-16)
    Existing type systems for object calculi are based on invariant subtyping. Subtyping invariance is required for soundness of static typing in the presence of method overrides, but it is often in the way of the expressive ...
  • Jahama, Said; Kfoury, A. J. (Boston University Computer Science Department, 1993-12-20)
    We establish the equivalence of type reconstruction with polymorphic recursion and recursive types is equivalent to regular semi-unification which proves the undecidability of the corresponding type reconstruction problem. ...
  • Ocean, Michael; Kfoury, Assaf; Bestavros, Azer (Boston University Computer Science Department, 2008-06-14)
    snBench is a platform on which novice users compose and deploy distributed Sense and Respond programs for simultaneous execution on a shared, distributed infrastructure. It is a natural imperative that we have the ability ...
  • Liu, Likai; Kfoury, Assaf J.; Bestavros, Azer; Gabay, Yarom; Bradley, Adam D.; Matta, Ibrahim (Boston University Computer Science Department, 2005-12-28)
    When analysing the behavior of complex networked systems, it is often the case that some components within that network are only known to the extent that they belong to one of a set of possible "implementations" – e.g., ...
  • Ishakian, Vatche; Bestavros, Azer; Kfoury, Assaf (CS Department, Boston University, 2010-01-24)
    Desirable application performance is typically guaranteed through the use of Service Level Agreements (SLAs) that specify fixed fractions of resource capacities that must be allocated for unencumbered use by the application. ...
  • Wells, J.B. (Boston University Computer Science Department, 1995-12-10)
    Mitchell defined and axiomatized a subtyping relationship (also known as containment, coercibility, or subsumption) over the types of System F (with "→" and "∀"). This subtyping relationship is quite simple and does not ...
  • Harfoush, Khaled; Bestavros, Azer; Byers, John (Boston University Computer Science Department, 2000-07-03)
    Current Internet transport protocols make end-to-end measurements and maintain per-connection state to regulate the use of shared network resources. When a number of such connections share a common endpoint, that endpoint ...
  • Yilmaz, Selma; Matta, Ibrahim (Boston University Computer Science Department, 2002)
    The objective of unicast routing is to find a path from a source to a destination. Conventional routing has been used mainly to provide connectivity. It lacks the ability to provide any kind of service guarantees and smart ...
  • Bera, Debajyoti; Fenner, Stephen; Green, Frederic; Homer, Steve (Boston University Computer Science Department, 2008-02-15)
    We define and construct efficient depth universal and almost size universal quantum circuits. Such circuits can be viewed as general purpose simulators for central classes of quantum circuits and can be used to capture the ...
  • Lapets, Andrei; Kfoury, Assaf (CS Department, Boston University, 2010-05-14)
    User-friendly interfaces can play an important role in bringing the benefits of a machine-readable representation of formal arguments to a wider audience. The "aartifact" system is an easy-to-use lightweight verifier for ...
  • Lapets, Andrei (CS Department, Boston University, 2010-05-14)
    Machine verification of formal arguments can only increase our confidence in the correctness of those arguments, but the costs of employing machine verification still outweigh the benefits for some common kinds of formal ...
  • West, Richard; Gloudon, Jason (Boston University Computer Science Department, 2003-06-01)
    Extensible systems allow services to be configured and deployed for the specific needs of individual applications. This paper describes a safe and efficient method for user-level extensibility that requires only minimal ...
  • Reynolds, Mark (CS Department, Boston University, 2010-07-23)
    The goal of this work was to apply lightweight formal methods to the study of the security of the JavaScript language. Previous work has shown that lightweight formal methods present a new approach to the study of security ...
  • Zatko, Sarah Lieberman; Van Alstyne, Marshall (Boston University Computer Science Department, 2009-05-11)
    We propose an economic mechanism to reduce the incidence of malware that delivers spam. Earlier research proposed attention markets as a solution for unwanted messages, and showed they could provide more net benefit than ...
  • Bestavros, Azer (Boston University Computer Science Department, 1995-02-21)
    Speculative service implies that a client's request for a document is serviced by sending, in addition to the document requested, a number of other documents (or pointers thereto) that the server speculates will be requested ...
  • Heddaya, Abdelsalam; Park, Kihong; Sinha, Himanshu (Boston University Computer Science Department, 1993-06-04)
    Parallel computing on a network of workstations can saturate the communication network, leading to excessive message delays and consequently poor application performance. We examine empirically the consequences of integrating ...
  • Byers, John; Nasser, Gabriel (Boston University Computer Science Department, 2000-10-17)
    We consider challenges associated with application domains in which a large number of distributed, networked sensors must perform a sensing task repeatedly over time. For the tasks we consider, there are three significant ...

Search OpenBU


Advanced Search

Browse

Deposit Materials