Browse Dept. of Computer Science by Title

  • Storch, Matthew Francis (1997)
    Simulation is often used in the analysis of complex computing systems. The design and validation of complex real-time systems demands capabilities not found in existing simulation environments. We categorize these capabilities ...

    application/pdf

    application/pdfPDF (7MB)Restricted to U of Illinois
  • Roush, Ellard Thomas (1995)
    This thesis introduces the Freeze Free process migration algorithm, which uses the following six techniques to dramatically reduce overhead and complexity.

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Raichel, Benjamin A. (2011-05-25)
    Given two simplicial complexes, and start and end vertices in each complex, we show how to compute curves (in each complex) between these vertices, such that the Frechet distance between these curves is minimized. As a ...

    application/pdf

    application/pdfPDF (495kB)
  • Shankesi, Ravinder (2013-08-22)
    Traditionally, security on the Internet has been concerned with threats posed by edge nodes (hosts) to other hosts and to the middle nodes of the network (routers). An example of the former is the spread of viruses and ...

    application/pdf

    application/pdfPDF (3MB)
  • Rosu, Grigore (2004-08)
    An automated technique to translate conditional rewrite rules into unconditional ones is presented, which is suitable to implement, or compile, conditional rewriting on top of much simpler and easier to optimize unconditional ...

    application/pdf

    application/pdfPDF (363kB)
  • Calhoun, Jon Cameron (2017-07-12)
    As high-performance computing (HPC) continues to progress, constraints on HPC system design forces the handling of errors to higher levels in the software stack. Of the types of errors facing HPC, soft errors that silently ...

    application/pdf

    application/pdfPDF (5MB)
  • Yim, Keun Soo (2013-05-24)
    This dissertation summarizes experimental validation and co-design studies conducted to optimize the fault detection capabilities and overheads in hybrid computer systems (e.g., using CPUs and Graphics Processing Units, ...

    application/pdf

    application/pdfPDF (3MB)
  • Rosu, Grigore (2012-03)
    Matching logic has been recently proposed as an alternative program verification approach. Unlike Hoare logic, where one defines a language-specific proof system that needs to be proved sound for each language separately, ...

    application/pdf

    application/pdfPDF (166kB)
  • Rosu, Grigore; Stefanescu, Andrei (2012-06)
    Matching logic reachability has been recently proposed as an alternative program verification approach. Unlike Hoare logic, where one defines a language-specific proof system that needs to be proved sound for each ...

    application/pdf

    application/pdfPDF (178kB)
  • Stephens, Sam C (2018-05)
    Maude is an equational and rewriting logic specification tool. It allows a unique and simple way of specifying concurrent programs and lends itself nicely to verification. This senior thesis focuses specifically on patterns ...

    application/pdf

    application/pdfPDF (282kB)
  • Rosu, Grigore; Ellison, Chucky M.; Schulte, Wolfram (2009-07-25)
    Rewriting logic semantics (RLS) is a definitional framework in which a programming language is defined as a rewrite theory: the algebraic signature defines the program configurations, the equations define structural ...

    application/pdf

    application/pdfPDF (395kB)
  • Pham, Nam D.; Ganti, Raghu K.; Nangia, Saurabh; Pongthawornkamol, Thadpong; Ahmed, Shameem; Abdelzaher, Tarek F.; Heo, Jin; Khan, Maifi; Ahmadi, Hossein (2009-10-08)
    This report presents a participatory sensing service, called Fueoogle, that maps vehicular fuel consumption on city streets, allowing drivers to find the most fuel-efficient routes for their vehicles between arbitrary ...

    application/pdf

    application/pdfPDF (667kB)
  • Popescu, Andrei (2009-03)
    Combining traces, coalgebra and lazy-filtering channel configurations for parallel composition, we give a fully-abstract denotational semantics for the pi-calculus under weak early bisimilarity.

    application/pdf

    application/pdfPDF (627kB)
  • Popescu, Andrei (2009-03)
    Combining traces, coalgebra and lazy-filtering channel configurations for parallel composition, we give a fully-abstract denotational semantics for the pi-calculus under weak early bisimilarity.

    application/pdf

    application/pdfPDF (627kB)
  • Blaauw, David Theodore (1992)
    Switch-level simulation has become an indispensable tool in the verification of large MOS circuits. In this dissertation, a new approach to switch-level simulation is proposed. The presented approach is based on the ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Girkar, Milind Baburao (1992)
    Thus far, parallelism at the loop level (or data-parallelism) has been almost exclusively the main target of parallelizing compilers. The variety of new parallel architectures and recent progress in interprocedural dependence ...

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • Braz, Rodrigo de Salvo; Roth, Dan (2004-04)
    Most machine learning algorithms rely on examples represented propositionally as feature vectors. However, most data in real applications is structured and better described by sets of objects with attributes and relations ...

    application/pdf

    application/pdfPDF (321kB)
  • Chang, Donald Yi-Chung (1978)

    application/pdf

    application/pdfPDF (8MB)Restricted to U of Illinois
  • Fesehaye, Debessay (2013-05-13)
    Major distributed systems such as the Internet, datacenter and hybrid P2P networks share a common known challenge of finding an optimal path to transfer content from a source to a destination and the optimal rate at which ...

    application/pdf

    application/pdfPDF (2MB)
  • Franques Garcia, Antonio Maria (2019-12-05)
    Recent computer architecture trends herald the arrival of massive multiprocessors with more than a thousand processor cores within a single chip. In this context, as parallel programs continue to increase the amount of ...

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois