# Browse Research and Tech Reports - Computer Science by Title

• (2004-12)
Current parallel programming approaches, which typically use message-passing and shared memory threads, require the programmer to write considerable low-level work management and distribution code to partition and distribute ...

application/pdf

PDF (598Kb)
• (2006-02)
Java+ITP is an experimental tool for the verification of properties of a sequential imperative subset of the Java language. It is based on an algebraic continuation passing style (CPS) semantics of this fragment as an ...

application/pdf

PDF (264Kb)
• (2009-05)
JavaScript has evolved from a simple language intended to give web browsers basic hinteraction into a fully featured dynamic language that allows the browser to become an application delivery platform. With innovations ...

application/pdf

PDF (743Kb)
• (2006-03)
Gossip protocols provide probabilistic reliability and scalability, but their inherent randomness may lead to high variation in (received) message overheads at different nodes. This paper presents techniques that leverages ...

application/pdf

PDF (419Kb)
• (2013-05)
Emerging applications in the domains of recognition, mining and synthesis (RMS); image and video processing; data warehousing; and automatic financial trading admit a particular style of parallelism termed flow-based ...

application/pdf

PDF (834Kb)
• (2010-05-09)
Collecting the real human movement has drawn significant attention from research community since a better understanding of human movement could provide new insights in network protocol design and network management for ...

application/pdf

PDF (235Kb)
• (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)