This is a collection of technical reports from the Cornell's Computer Science (CS) Department from the time period of 1968-2002. These reports are part of the NCSTRL collection of Computer Science Technical Reports.

For reports from 2003-present, see the Computing and Information Science Technical Reports Collection.

Recent Submissions

  • On Free ω-Continuous and Regular Ordered Algebras 

    Esik, Zoltan; Kozen, Dexter (2016)
    Let E be a set of inequalities between finite Σ-terms. Let V_ω and V_r denote the varieties of all ω-continuous ordered Σ-algebras and regular ordered Σ-algebras satisfying E, respectively. We prove that the free V_r-algebra ...
  • A Calculus for Flow-Limited Authorization: Technical Report 

    Arden, Owen; Myers, Andrew C. (2016-09-13)
    Real-world applications routinely make authorization decisions based on dynamic computation. Reasoning about dynamically computed authority is challenging. Integrity of the system might be compromised if attackers can ...
  • Block-safe Information Flow Control 

    Kozyri, Elisavet; Desharnais, Josée; Tawbi, Nadia (2016-08-09)
    Flow-sensitive dynamic enforcement mechanisms for information flow labels offer increased permissiveness. However, these mechanisms may leak sensitive information when deciding to block insecure executions. When enforcing ...
  • JRIF: Reactive Information Flow Control for Java 

    Kozyri, Elisavet; Arden, Owen; Myers, Andrew C.; Schneider, Fred B. (2016-02-12)
    A reactive information flow (RIF) automaton for a value v specifies (i) allowed uses for v and (ii) the RIF automaton for any value that might be directly or indirectly derived from v. RIF automata thus specify how ...
  • Flow-Limited Authorization 

    Arden, Owen; Liu, Jed; Myers, Andrew (2015-05-08)
    Because information flow control mechanisms often rely on an underlying authorization mechanism, their security guarantees can be subverted by weaknesses in authorization. Conversely, the security of authorization can ...

View more


RSS Feeds