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

  • A Calculus for Flow-Limited Authorization: Technical Report 

    Arden, Owen; Myers, Andrew C. (2016-05-09)
    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 ...
  • 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 ...
  • A Linear List Merging Algorithm 

    Hopcroft, John E.; Ullman, Jeffrey D. (2008-05-14)
    A linear list merging algorithm and its analysis is presented. Starting with n lists, each containing a single element, the algorithm will execute an arbitrary sequence of requests to merge lists and to find the name of ...
  • On the Modelling Power of Petri Nets 

    Meiling, Erik (Cornell University, 1979-12)
    The behavior of a Petri net is expressed as a formal language. Certain families of Petri net languages are characterized by propositions similar to the classical pumping theorems. The results are used to give examples ...

View more

Statistics

RSS Feeds