Browse Dept. of Computer Science by Title

  • Giochin, Filippo (2010)
    In this thesis, we explore a new approach based on a tight integration between the debugger and the application's underlying parallel runtime system. The debugger is responsible for interacting with the user and receiving ...

    application/pdf

    application/pdfPDF (2MB)Restricted to U of Illinois
  • Gioachin, Filippo (2011-01-14)
    Debugging is a fundamental part of software development, and one of the largest in terms of time spent. When developing parallel applications, debugging becomes much harder due to a whole new set of problems not present ...

    application/pdf

    application/pdfPDF (3MB)
  • Lee, Yuh-Jeng (1988)
    This dissertation addresses the use of executable specifications in debugging logic programs which are renowned for their clean syntax and well-understood semantics, and for the feature that one can use a single language ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • Kostoulas, Dionysios; Psaltoulis, Dimitrios; Gupta, Indranil; Briman, Ken; Demers, Al (2005-02)
    Large-scale and dynamically changing distributed systems such as the Grid, peer-to-peer overlays, etc., need to collect several kinds of global statistics in a decentralized manner. In this paper, we tackle a specific ...

    application/pdf

    application/pdfPDF (2MB)
  • Chadha, Rohit; Viswanathan, Mahesh (2007-06)
    We consider the problem of verifying the safety of well-structured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have ( possibly) infinitely many control states along with an auxiliary ...

    application/pdf

    application/pdfPDF (266kB)
  • Prabhakar, Pavithra; Vladimerou, Vladimeros; Viswanathan, Mahesh; Dullerud, Geir E. (2008-01)
    The paper shows the decidability of the reachability problem for planar, monotonic, linear hybrid automata without resets. These automata are a special class of linear hybrid automata with only two variables, whose flows ...

    application/pdf

    application/pdfPDF (193kB)
  • Hendrix, Joseph D. (2008)
    Each of these theoretical topics have lead to the development of new libraries and tools. Two of the tools have already been used in external projects including our tree automata library's integration into the ACTAS protocol ...

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • 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)
  • 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)