JavaScript is disabled for your browser. Some features of this site may not work without it.
Computing and Information Science Technical Reports
Browse by
This is a collection of technical reports from the Cornell's Computing and Information Science (CIS) Department from the time period of 2003-present. These reports are part of the NCSTRL collection of Computer Science Technical Reports.
For reports prior to 2003, see the Computer Science Technical Reports Collection.
Recent Submissions
-
Abstraction-Safe Effect Handlers via Tunneling: Technical Report
(2018-11-09)Algebraic effect handlers offer a unified approach to expressing control-flow transfer idioms such as exceptions, iteration, and async/await. Unfortunately, previous attempts to make these handlers type-safe have failed ... -
A Reactive Approach for Use-Based Privacy
(2017-11-24)Use-based privacy views privacy in terms of authorized uses, a philosophy well-suited for data collection and data analysis applications that arise in networked information systems. This work takes a first step toward ... -
Videos of demo of self-driving robot with map verification
(2017-10-06)Three videos of a self-driving Segway system are shown, following an oval track. Delivering the system an incorrect map causes the system to drive off the track. The third video shows the system running with software that ... -
Pushing Bytes: Cloud-Scale Data Replication with RDMC
(2017-06)Data center infrastructures frequently replicate objects to create backups or to copy executables and input files to compute nodes. This task occurs under time pressure: data is at risk of loss until replicated for ... -
Shoal: A Lossless Network for High-density and Disaggregated Racks
(2017-04-30)Rack-scale computers comprise hundreds of micro-servers connected to internal storage and memory through an internal network. However, their density and disaggregated nature pose a problem for existing packet-switched ... -
Full-Processor Timing Channel Protection with Applications to Secure Hardware Compartments
(2017-04-25)This paper presents timing compartments, a hardware architecture abstraction that eliminates microarchitectural timing channels between groups of processes of VMs running on shared hardware. When coupled ... -
Unrestricted Stone Duality for Markov Processes
(2017-02-23)Stone duality relates logic, in the form of Boolean algebra, to spaces. Stone-type dualities abound in computer science and have been of great use in understanding the relationship between computational models and the ... -
Election Verifiability: Cryptographic Definitions and an Analysis of Helios and JCJ
(2017-02-13)Definitions of election verifiability in the computational model of cryptography are proposed. The definitions formalize notions of voters verifying their own votes, auditors verifying the tally of votes, and auditors ... -
Mixing Consistency in Geodistributed Transactions: Technical Report
(2016-10-07)Weakly consistent data stores have become popular because they enable highly available, scalable distributed applications. However, some data needs strong consistency. For applications that mix accesses to strongly and ... -
Safe Serializable Secure Scheduling: Transactions and the Trade-Off Between Security and Consistency (Technical Report)
(2016-08-16)Modern applications often operate on data in multiple administrative domains. In this federated setting, participants may not fully trust each other. These distributed applications use transactions as a core mechanism ...
RSS 1.0