# Browse Research and Tech Reports - Computer Science by Title

• (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

PDF (193kB)
• (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

PDF (300kB)
• (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

PDF (1MB)
• (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

PDF (772kB)
• (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

PDF (1MB)
• (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

PDF (1MB)
• (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

PDF (392kB)
• (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

PDF (2MB)
• (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

PDF (432kB)
• (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 deﬁning ...

application/pdf

PDF (755kB)
• (2007-09)
Topology optimization is a powerful tool for global and multiscale design of structures, microstructures, and materials. The computational bottleneck of topology optimization is the solution of a large number of extremely ...

application/pdf

PDF (5MB)
• (2005-05)
In neighborhood-based texture synthesis, adjacent local regions need to satisfy color continuity constraints in order to avoid visible seams. Such continuity constraints seriously restrict the variability of synthesized ...

application/pdf

PDF (434kB)
• (2006-12)
The Web has been rapidly deepened'' by myriad searchable databases online, where data are hidden behind query interfaces. Guarding data behind them, such query interfaces are the entrances'' or doors'' to the deep ...

application/pdf

PDF (2MB)
• (2012-05-07)
Network algorithms are deployed on large networks, and proper algorithm evaluation is necessary to avoid large-scale outages or performance bottlenecks. However, evaluating a network algorithm in a simulator results ...

application/pdf

PDF (261kB)
• (2006-01)
The computational bottleneck of topology optimization is the solution of a large number of linear systems arising in the finite element analysis. We propose fast iterative solvers for large three-dimensional topology ...

application/pdf

PDF (4MB)
• (2013-01-24)
With the fast growth of (online) content and the need for high quality content services, cloud data centers are increas- ingly becoming the preferred places to store data and re- trieve it from. With a highly variable ...

application/pdf

PDF (576kB)
• (2006-05)
Transactional memory (TM) is a compelling alternative to traditional synchronization, and implementing TM primitives directly in hardware offers a potential performance advantage over software-based methods. In this paper, ...

application/pdf

PDF (200kB)
• (2005-05)
Information extraction is a process that extracts limited semantic concepts from text documents and presents them in an organized way. Unlike several other natural language tasks, information extraction has a direct impact ...

application/pdf

PDF (495kB)
• (2013-06-25)

application/pdf

PDF (631kB)
• (2015)
Inductive invariants can be robustly synthesized using a learning model where the teacher is a program verifier who instructs the learner through concrete program configurations, classified as positive, negative, and ...

application/pdf

PDF (597kB)