Browse Dept. of Computer Science by Title

  • Hendrix, Joseph D. (2008-09)
    This work develops new automated reasoning techniques for verifying the correctness of equationally specified programs. These techniques are not just theoretical, but have been implemented, and applied to actual program ...

    application/pdf

    application/pdfPDF (1MB)
  • Baugh, Lee W.; Zilles, Craig (2005-10)
    Because they are based on large content-addressable memories, load-store queues (LSQs) present implementation challenges in superscalar processors, especially as issue width and number of in-flight instructions are scaled. ...

    application/pdf

    application/pdfPDF (198kB)
  • Khirwadkar, Tanmay S. (2011-05-25)
    As Internet has become ubiquitous, the risk posed by network attacks has greatly increased. Network attacks have been used to achieve a wide gamut of objectives ranging from overloading a website to accessing classified ...

    application/pdf

    application/pdfPDF (736kB)
  • Lin, Chia-Chi; Jalaparti, Virajith; Caesar, Matthew; Van der Merwe, Jacobus (USENIX, 2013)
    Large-scale networks are among the most complex software infrastructures in existence. Unfortunately, the extreme complexity of their basis, the control-plane software, leads to a rich variety of nondeterministic failure ...

    application/pdf

    application/pdfPDF (755kB)
  • Ellison, Chucky M.; Rosu, Grigore (2012-04-27)
    This paper investigates undefined behavior in C and offers a few simple techniques for operationally specifying such behavior formally. A semantics-based undefinedness checker for C is developed using these techniques, as ...

    application/pdf

    application/pdfPDF (257kB)
  • Rosenberger, Harald (1990)
    Degenerate geometric data (e.g., three points on a line, four points on a circle) is known to create all sorts of special cases, some easy and some complicated, that have to be considered in implementations of geometric ...

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • Jayachandran, Praveen; Abdelzaher, Tarek F. (2007-05)
    In this paper, we present a delay composition rule that bounds the worst-case end-to-end delay of a job as a function of per-stage execution times of higher priority jobs along its path, in a multistage distributed system ...

    application/pdf

    application/pdfPDF (220kB)
  • Lu, Yi (2015-04-23)
    The delay composition theorem, by taking into account the fact that pipeline systems allow concurrent execution, expresses the upper-bounded delay of a real-time task as the sum of two summations, where the first one is ...

    application/pdf

    application/pdfPDF (499kB)Restricted to U of Illinois
  • Jayachandran, Praveen (2011-01-14)
    This thesis develops a new reduction-based analysis methodology for studying the worst-case end-to-end delay and schedulability of real-time jobs in distributed systems. The main result is a simple delay composition rule, ...

    application/pdf

    application/pdfPDF (2MB)
  • d'Amorim, Marcelo; Lauterburg, Steven; Marinov, Darko (2007-05)
    State-space exploration is the essence of model checking and an increasingly popular approach for automating test generation. A key issue in exploration of object-oriented programs is handling the program state, in particular ...

    application/pdf

    application/pdfPDF (300kB)
  • Uddin, Md Yusuf Sarwar; Khurshid, Ahmed; Jung, Hee Dong; Carl Gunter (2010-01-19)
    Disruption-tolerant network (DTN) is an intermittently connected network where the traditional end-to-end data communication between a source-destination pair is hardly possible. Instead, nodes opportunistically replicate ...

    application/pdf

    application/pdfPDF (234kB)
  • Sung, Hyojin (2015-07-16)
    As multicore systems become widespread, both software and hardware face a major challenge in efficiently exploiting and implementing parallelism. While shared–memory remains a popular programming model due to its global ...

    application/pdf

    application/pdfPDF (8MB)
  • Bortner, Dustin P. (2010-05-19)
    Information networks, such as biological or social networks, contain groups of related entities, which can be identified by clustering. Density-based clustering (DBC) differs from vertex-partitioning methods in that some ...

    application/pdf

    application/pdfPDF (677kB)
  • Bortner, Dustin P. (2010-05)
    Information networks, such as biological or social networks, contain groups of related entities, which can be identified by clustering. Density-based clustering (DBC) differs from vertex-partitioning methods in that some ...

    application/pdf

    application/pdfPDF (677kB)
  • Midkiff, Samuel Pratt (1992)
    The optimization of programs with explicit--i.e. user specified--parallelism requires the computation of the data dependence relation if optimizations performed by the compiler are to preserve sequential consistency. Shasha ...

    application/pdf

    application/pdfPDF (6MB)Restricted to U of Illinois
  • Ding, Hui (2006-11)
    Due to the complexity and requirements of modern real-time systems, multiple teams must often work concurrently and independently to develop the various components of the system. Since a team typically only knows the ...

    application/pdf

    application/pdfPDF (768kB)
  • Ding, Hui (2006)
    This thesis presents Dependency Management Framework (DMF), a unified theoretical framework and prototype toolkit for dependency management in robust real-time systems. To illustrate the usability and scalability of DMF, ...

    application/pdf

    application/pdfPDF (3MB)Restricted to U of Illinois
  • Wang, Jiqin (2014-09-16)
    The depth map of a video is a very important piece of information. Recovering the depth map of a video expands a 2D video into its 3rd dimension, and creates new possibilities, such as, object insertion, conversion to 3D, ...

    application/pdf

    application/pdfPDF (36MB)
  • Chen, Chien-Yi (1987)
    The availability of fast devices in low cost and high density technologies promises a major breakthrough in future supercomputer designs, especially in the design of highly concurrent processors. Locally interconnected ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Fesehaye, Debessay (2013-01-25)
    Existing literature shows that Peer-to-Peer (P2P) content sharing can result in significant scalability gains in addition to assisting content distribution networks (CDNs). However, currently proposed CDN and P2P hybrid ...

    application/pdf

    application/pdfPDF (292kB)