Search
Now showing items 1-10 of 116
Tetris is Hard, Even to Approximate
(2002-10)
A Type System and Analysis for the Automatic Extraction and Enforcement of Design Information
(2002-12)
We present a new type system and associated type checker, analysis, and model extraction algorithms for automatically extracting models that capture aspects of the design of the program. Our type system enables the developer ...
Efficient Consistency Proofs on a Committed Database
(2003-02)
A consistent query protocol allows a database owner to publish a very short string c which commits her to a particular database D with special consistency property (i.e., given c, every allowable query has unique and ...
Inference of Generic Types in Java
(2003-03)
Future versions of Java will include support for parametric polymorphism, or generic classes. This will bring many benefits to Java programmers, not least because current Java practise makes heavy use of pseudo-generic ...
System Dependence Graph Construction for Aspect-Oriented Programs
(2003-03)
We extend previous dependence-based representations called system dependence graphs (SDGs) to represent aspect-oriented programs and present an SDG construction algorithm. This algorithm first constructs a module dependence ...
Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks
(2003-05)
Nodes in sensor networks often encounter spatially-correlated contention, where multiple nodes in the same neighborhood all sense an event they need to transmit information about. Furthermore, in many sensor network ...
Improving Application-level Network Services with Regions
(2003-05)
The underlying premise of the Region Project is that the concept of a region should be a new architecture capability in networking. A region is an entity that encapsulates and implements scoping, grouping, subdividing, and ...