Browse Dept. of Computer Science by Title

  • Meredith, Patrick O'Neil; Hills, Mark; Rosu, Grigore (2007-10)
    This paper presents an executable rewriting logic semantics of R5RS Scheme using the K definitional technique [19]. We refer to this definition as K-Scheme. The presented semantics follows the K language definitional style ...

    application/pdf

    application/pdfPDF (193kB)
  • Denis Bogdanas (2014-10-27)
    This is a companion report to the POPL'15 paper on K-Java, describing in detail the semantics of method invocation and of object creation.

    application/pdf

    application/pdfPDF (300kB)
  • Rosu, Grigore (2006-12)
    K is an algebraic framework for defining programming languages. It consists of a technique and of a specialized and highly optimized notation. The K-technique, which can be best explained in terms of rewriting modulo ...

    application/pdf

    application/pdfPDF (1MB)
  • Rosu, Grigore (2005-12)
    K is an algebraic framework for defining programming languages. It consists of a technique and of a specialized and highly optimized notation. The K-technique, which can be best explained in terms of rewriting modulo ...

    application/pdf

    application/pdfPDF (772kB)
  • Rosu, Grigore (2007-12)
    K is a definitional framework based on term rewriting, in which programming languages, calculi, as well as type systems or formal analysis tools can be defined making use of special list and/or set structures, called cells, ...

    application/pdf

    application/pdfPDF (1MB)
  • Rosu, Grigore (2007-12)
    K is a definitional framework based on term rewriting, in which programming languages, calculi, as well as type systems or formal analysis tools can be defined making use of special list and/or set structures, called cells, ...

    application/pdf

    application/pdfPDF (1MB)
  • Vakilian, Mohsen; Negara, Stas; Tasharofi, Samira; Johnson, Ralph E. (2011-08)
    Developing concurrent software is error prone. Others have cataloged common bug patterns in concurrent Java programs. But, there are no tools for detecting complex concurrency bug patterns accurately, and concurrent programs ...

    application/pdf

    application/pdfPDF (69kB)
  • Vakilian, Mohsen; Negara, Stas; Tasharofi, Samira; Johnson, Ralph E. (2013-05)
    Bug patterns are coding idioms that may make the code less maintainable or turn into bugs in future. The state-of-the-art tools for detecting concurrency bug patterns (CBPs) perform simple, intraprocedural analyses. While ...

    application/pdf

    application/pdfPDF (392kB)
  • Everett Hildenbrandt; Manasvi Saxena; Xiaoran Zhu; Nishant Rodrigues; Philip Daian; Dwight Guth; Grigore Rosu (2017-08-01)
    A developing field of interest for the distributed systems and applied cryptography community is that of smart contracts: self-executing financial instruments that synchronize their state, often through a blockchain. One ...

    application/pdf

    application/pdfPDF (426kB)
  • Zhao, Bo (2012-02-06)
    We propose a novel system TEXplorer that integrates keyword-based object ranking with the aggregation and exploration power of OLAP in a text database with rich structured attributes available, e.g., a product review ...

    application/pdf

    application/pdfPDF (398kB)
  • Rungta, Pratik S. (2011-08-25)
    Since the early days of Computer Vision, we have explored what is possible in the realm of ‘Scene Understanding’. The advent of consumer-grade RGBD cameras has broadened the possibilities within this realm. The data they ...

    application/pdf

    application/pdfPDF (12MB)
  • Kapadia, Apu C.; Sampemane, Geetanjali (2004-02)
    We examine the problem of providing useful feedback to users who are denied access to resources, while controlling the disclosure of the system security policies. High-quality feedback enhances the usability of a system, ...

    application/pdf

    application/pdfPDF (2MB)
  • Pasternack, Jeffrey (2012-02-01)
    The Information Age has created an increasing abundance of data and has, thanks to the rise of the Internet, made that knowledge instantly available to humans and computers alike. This is not without caveats, however, as ...

    application/pdf

    application/pdfPDF (848kB)
  • Ramachandran, Deepak (2011-05-25)
    The field of Reinforcement Learning is concerned with teaching agents to take optimal decisions to maximize their total utility in complicated environments. A Reinforcement Learning problem, generally described by the ...

    application/pdf

    application/pdfPDF (6MB)
  • Ning, Jim Qun (1989)
    Software maintenance is the most expensive part of the software life-cycle. This is partially due to the fact that quite often the only reliable and available documentation about a program is its source code and all the ...

    application/pdf

    application/pdfPDF (6MB)Restricted to U of Illinois
  • Lubars, Mitchell Douglas (1987)
    This thesis addresses the use of knowledge-based techniques in providing high level support for software design activities. A knowledge-based refinement paradigm of software development is introduced that alleviates some ...

    application/pdf

    application/pdfPDF (8MB)Restricted to U of Illinois
  • Whitehall, Bradley Lane (1990)
    To learn effectively, a system needs to use all the knowledge that is available. Explanation-based learning and similarity-based learning operate over a domain theory and a set of examples, respectively, but neither approach ...

    application/pdf

    application/pdfPDF (6MB)Restricted to U of Illinois
  • Donoho, Steven Kirk (1996)
    The relationship between constructive induction and domain knowledge can be analyzed systematically. Recent research has integrated knowledge and constructive induction in isolated domains with some success, but undue ...

    application/pdf

    application/pdfPDF (8MB)Restricted to U of Illinois
  • Hills, Mark; Rosu, Grigore (2006-10)
    This paper documents KOOL, a dynamic, object-oriented language designed using the K framework. The KOOL language includes many features available in mainstream object-oriented languages, including such features as runtime ...

    application/pdf

    application/pdfPDF (432kB)
  • Șerbănuță, Traian Florin; Rosu, Grigore (2010-09-22)
    Term rewriting proved to be a simple, uniform and powerful computational paradigm. Rewrite rules independently match and apply anywhere, unconstrained by the context. Rewriting is particularly appealing for defining ...

    application/pdf

    application/pdfPDF (755kB)