Browse Dept. of Computer Science by Title

  • Yershova, Anna; Tovar, Benjamin; Ghrist, Robert; LaValle, Steven M. (2009-04-16)
    This paper defines and analyzes a simple robot with local sensors that moves in an unknown polygonal environment. The robot can execute wall-following motions and can traverse the interior of the environment only when ...

    application/pdf

    application/pdfPDF (274kB)
  • Vu, Long; Gupta, Indranil; Liang, Jin; Nahrstedt, Klara (2006-08)
    While several deployed p2p file sharing overlays have been characterized in the literature, this paper shows that some of their conclusions may be false for p2p applications that stream media instead. Specifically, we ...

    application/pdf

    application/pdfPDF (330kB)
  • Chen, Kai; Yang, Zhenyu; Wagener, Christian; Nahrstedt, Klara (2005-01)
    Multihop wireless hotspot network has been recently proposed to extend the coverage area of a base station. However, with selfish nodes in the network, multihop packet forwarding cannot take place without an incentive ...

    application/pdf

    application/pdfPDF (160kB)
  • Ham, MyungJoo (2009)
    We conduct both physical robot experiments and software agent simulations for the coordinated task allocation mechanisms. The experimental results suggest that the proposed mechanisms are scalable and fault-tolerant and ...

    application/pdf

    application/pdfPDF (6MB)Restricted to U of Illinois
  • Rosu, Grigore; Schulte, Wolfram (2009-01)
    Hoare logics rely on the fact that logic formulae can encode, or specify, program states, including environments, stacks, heaps, path conditions, data constraints, and so on. Such formula encodings tend to lose the structure ...

    application/pdf

    application/pdfPDF (477kB)
  • Rosu, Grigore; Schulte, Wolfram (2009-01)
    Hoare logics rely on the fact that logic formulae can encode, or specify, program states, including environments, stacks, heaps, path conditions, data constraints, and so on. Such formula encodings tend to lose the structure ...

    application/pdf

    application/pdfPDF (477kB)
  • Rosu, Grigore (2011-11-16)
    Matching logic allows to specify structural properties about program configurations by means of special formulae, called patterns, and to reason about them by means of pattern matching. This paper proposes rewriting ...

    application/pdf

    application/pdfPDF (285kB)
  • Rosu, Grigore (2014-01-20)
    Matching logic is a first-order logic (FOL) variant to reason about structure. Its sentences, called patterns, are constructed using variables, symbols, connectives and quantifiers, but no dif ference is made between ...

    application/pdf

    application/pdfPDF (232kB)
  • Yu, Tian-Li (2006)
    Unlike most simple textbook examples, the real world is full with complex systems, and researchers in many different fields are often confronted by problems arising from such systems. Simple heuristics or even enumeration ...

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • Yu, Tian-Li (2006-11)
    Unlike most simple textbook examples, the real world is full with complex systems, and researchers in many different fields are often confronted by problems arising from such systems. Simple heuristics or even enumeration ...

    application/pdf

    application/pdfPDF (2MB)
  • Frazier, Michael Duane (1994)
    Current knowledge representation research has sought to provide schemes for encoding knowledge about how a given system behaves, with the goal being accuracy and utility. Ideally, the goal of encoding knowledge is not the ...

    application/pdf

    application/pdfPDF (8MB)Restricted to U of Illinois
  • Cholewa, Andrew Russel (2015-04-28)
    Maude-NPA is a narrowing-based model checker for analysing cryptographic protocols in the Dolev-Yao model modulo equations. Maude-NPA is a powerful analyzer that is sound and never returns spurious counter-examples. ...

    application/pdf

    application/pdfPDF (801kB)
  • Serbanuta, Traian Florin; Chen, Feng; Rosu, Grigore (2008-12)
    Extracting causal models from observed executions has proved to be an effective approach to analyze concurrent programs. Most existing causal models are based on happens-before partial orders and/or Mazurkiewicz traces. ...

    application/pdf

    application/pdfPDF (431kB)
  • Serbanuta, Traian Florin; Chen, Feng; Rosu, Grigore (2008-12)
    Extracting causal models from observed executions has proved to be an effective approach to analyze concurrent programs. Most existing causal models are based on happens-before partial orders and/or Mazurkiewicz traces. ...

    application/pdf

    application/pdfPDF (417kB)
  • Șerbănuță, Traian Florin; Chen, Feng; Rosu, Grigore (2010-09-22)
    This paper shows that it is possible to build a theoretically maximal and sound causal model for concurrent computations from a given execution trace. For an observed execution, the proposed model comprises all consistent ...

    application/pdf

    application/pdfPDF (489kB)
  • Șerbănuță, Traian Florin; Chen, Feng; Rosu, Grigore (2011-10-14)
    This paper shows that it is possible to build a maximal and sound causal model for concurrent computations from a given execution trace. It is sound, in the sense that any program which can generate a trace can also ...

    application/pdf

    application/pdfPDF (590kB)
  • Serbanuta, Traian Florin; Chen, Feng; Rosu, Grigore (2008-09)
    ACM Classification: F.3.2 Semantics of Programming Languages D.2.4 Software/Program Verification D.2.5 Testing and Debugging

    application/pdf

    application/pdfPDF (265kB)
  • Serbanuta, Traian Florin; Chen, Feng; Rosu, Grigore (2008-09)
    ACM Classification: F.3.2 Semantics of Programming Languages D.2.4 Software/Program Verification D.2.5 Testing and Debugging

    application/pdf

    application/pdfPDF (265kB)
  • Har-Peled, Sariel; Roth, Dan; Zimak, Dav A. (2006-10)
    We study the problem of learning large margin halfspaces in various settings using coresets and show that coresets are a widely applicable tool for large margin learning. A large margin coreset is a subset of the input ...

    application/pdf

    application/pdfPDF (257kB)
  • Sharma, Sanjay (1999)
    This research addresses the issue of evaluating the performance of parallel I/O subsystems for a variety of I/O intensive workloads on massively parallel systems. First, a model-based workload specification methodology for ...

    application/pdf

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