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

  • Accepting Blame: Expressive Checked Exceptions 

    Zhang, Yizhou; Salvaneschi, Guido; Beightol, Quinn; Liskov, Barbara; Myers, Andrew C. (2016-04)
    Unhandled exceptions crash programs, so a compile-time check that exceptions are handled should in principle make software more reliable. But designers of some recent languages have argued that the benefits of statically ...
  • Genus: Making Generics Object-Oriented, Expressive, and Lightweight 

    Zhang, Yizhou; Loring, Matthew C.; Salvaneschi, Guido; Liskov, Barbara; Myers, Andrew C. (2015-06)
    The support for generic programming in modern object-oriented programming languages is awkward and lacks desirable expressive power. We introduce an expressive genericity mechanism that adds expressive power and strengthens ...
  • Kolmogorov Extension, Martingale Convergence, and Compositionality of Processes 

    Kozen, Dexter (2015-12-30)
    We show that the Kolmogorov extension theorem and the Doob martingale convergence theorem are two aspects of a common generalization, namely a colimit-like construction in a category of Radon spaces and reversible Markov ...
  • Full-Processor Timing Channel Protection with Applications to Secure Hardware Compartments 

    Ferraiuolo, Andrew; Wang, Yao; Xu, Rui; Zhang, Danfeng; Myers, Andrew; Suh, Edward (2015)
    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 ...
  • Regular Expressions with Dynamic Name Binding 

    Kozen, Dexter; Milius, Stefan; Schröder, Lutz; Wißmann, Thorsten (2015-10-18)
    Nominal Kleene algebra (NKA) is a formalism to specify trace languages with name generation; it extends standard regular expressions with a name binding construct. NKA has been proved complete over a natural nominal language ...

View more

Statistics

RSS Feeds