Browsing CAS: Computer Science: Technical Reports by Title

OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

Sort by: Order: Results:

  • The Undecidability of Mitchell's Subtyping Relationship
    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 ...
  • Unicast-based Characterization of Network Loss Topologies
    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 ...
  • Unicast Routing: Cost-Performance Tradeoffs
    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 ...
  • Universal Quantum Circuits
    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 ...
  • A User-friendly Interface for a Lightweight Verification System
    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 ...
  • User-friendly Support for Common Concepts in a Lightweight Verifier
    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 ...
  • User-Level Sandboxing: a Safe and Efficient Mechanism for Extensibility
    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 ...
  • Using Lightweight Formal Methods for JavaScript Security
    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 ...
  • Using Markets and Spam to Combat Malware
    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 ...
  • Using Speculation to Reduce Server Load and Service Time on the WWW
    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 ...
  • Using Warp to Control Network Contention in Mermera
    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 ...
  • Utility-Based Decision-Making in Wireless Sensor Networks
    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 ...
  • Validating Arbitrarily Large Network Protocol Compositions with Finite Computation
    Bradley, Adam D.; Bestavros, Azer; Kfoury, Assaf J. (Boston University Computer Science Department, 2002-09-08)
    Formal tools like finite-state model checkers have proven useful in verifying the correctness of systems of bounded size and for hardening single system components against arbitrary inputs. However, conventional applications ...
  • Value-cognizant Speculative Concurrency Control
    Bestavros, Azer; Braoudakis, Spyridon (Boston University Computer Science Department, 1995-02-20)
    A problem with Speculative Concurrency Control algorithms and other common concurrency control schemes using forward validation is that committing a transaction as soon as it finishes validating, may result in a value loss ...
  • Verification with Natural Contexts: Soundness of Safe Compositional Network Sketches
    Lapets, Andrei; Kfoury, Assaf (Boston University Computer Science Department, 2009-10-01)
    In research areas involving mathematical rigor, there are numerous benefits to adopting a formal representation of models and arguments: reusability, automatic evaluation of examples, and verification of consistency and ...
  • View Registration Using Interesting Segments of Planar Trajectories
    Nunziati, Walter; Alon, Jonathan; Sclaroff, Stan; Del Bimbo, Alberto (Boston University Computer Science Department, 2005-05-19)
    We introduce a method for recovering the spatial and temporal alignment between two or more views of objects moving over a ground plane. Existing approaches either assume that the streams are globally synchronized, so that ...
  • Virtual-CPU Scheduling in the Quest Operating System
    Danish, Matthew; Li, Ye; West, Rich (CS Department, Boston University, 2010-11-10)
    This paper describes the scheduling framework for a new operating system called "Quest". The three main goals of Quest are to ensure safety, predictability and efficiency of software execution. For this paper, we focus on ...
  • A Virtual Deadline Scheduler for Window-Constrained Service Guarantees
    Zhang, Yuting; West, Richard; Qi, Xin (Boston University Computer Science Department, 2004-03-23)
    This paper presents a new approach to window-constrained scheduling, suitable for multimedia and weakly-hard real-time systems. We originally developed an algorithm, called Dynamic Window-Constrained Scheduling (DWCS), ...
  • Visible Volume: a Robust Measure for Protein Structure Characterization
    Lo Conte, Loredana; Smith, Temple (Boston University Computer Science Department, 1997-07-10)
    We propose a new characterization of protein structure based on the natural tetrahedral geometry of the β carbon and a new geometric measure of structural similarity, called visible volume. In our model, the side-chains ...
  • The War Between Mice and Elephants
    Guo, Liang; Matta, Ibrahim (Boston University Computer Science Department, 2001)
    Recent measurement based studies reveal that most of the Internet connections are short in terms of the amount of traffic they carry (mice), while a small fraction of the connections are carrying a large portion of the ...

Search OpenBU


Advanced Search

Browse

Deposit Materials