Now showing items 4-6 of 666

    • Computer-Enforced Immutability for the Java Language 

      Birka, Adrian (2003-06)
      This thesis presents the design, implementation, and evaluation of an extension to the Java language, ConstJava, that is capable of expressing immutability constraints and verifying them at compile time. The specific ...
    • Compositionality for Probabilistic Automata 

      Lynch, Nancy A.; Segala, Roberto; Vaandrager, Frits
      We establish that on the dfomain of probabilistic automata, the trace distribution preorder coincides with the simulation preorder.
    • Subexponential Parameterized Algorithms on Graphs of Bounded Genus and H-minor-free Graphs 

      Demaine, Erik D.; Fomin, Fedor V.; Hajiaghayi, Mohammad Taghi; Thilikos, Dimitrios M. (2003-06)
      We introduce a new framework for designing fixed-parameter algorithms with subexponential running time---2^O(sqrt k) n^O(1). Our results apply to a broad family of graph problems, called bidimensional problems, which ...