Browsing CS Technical Reports by Title
Now showing items 1-20 of 1767
-
The 007 Benchmark
(University of Wisconsin-Madison Department of Computer Sciences, 1993) -
A 2-Layered SIMD/MIMD Parallel Pyramidal "Array/Net"
(University of Wisconsin-Madison Department of Computer Sciences, 1980) -
3-D Multiview Object Representations for Model-Based Object Recognition
(University of Wisconsin-Madison Department of Computer Sciences, 1985) -
3600 Drum Scope System Routines for the DD212 Terminal
(University of Wisconsin-Madison Department of Computer Sciences, 1967) -
A-Posteriori Error Estimates
(University of Wisconsin-Madison Department of Computer Sciences, 1974) -
Abe-A Query Language for Constructing Aggregates-by-Example
(University of Wisconsin-Madison Department of Computer Sciences, 1982) -
An Abstract Domain for Bit-Vector Inequalities
(University of Wisconsin-Madison Department of Computer Sciences, 2013-04-16)This paper advances the state of the art in abstract interpretation of machine code. It tackles two of the biggest challenges in machine-code analysis: (1) holding onto invariants about values in memory, and (2) identifying ... -
Abstract Domains of Affine Relations
(University of Wisconsin-Madison Department of Computer Sciences, 2013-05-13)This paper considers some known abstract domains for affine-relation analysis, along with several variants, and studies how they relate to each other. The various domains represent sets of points that satisfy affine ... -
Abstract Domains of Affine Relations
(University of Wisconsin-Madison Department of Computer Sciences, 2011)This paper considers some known abstract domains for affine-relation analysis (ARA), along with several variants, and studies how they relate to each other. We show that the abstract domains of Mueller-Olm/Seidl (MOS) ... -
Abstract Error Projection
(University of Wisconsin-Madison Department of Computer Sciences, 2006)To improve the reporting of results from model checking and programanalysis systems, we introduce the notion of an error projection and annotated error projection. An error projection is a set of program nodes N such that ... -
Abstract Execution: A Technique for Efficiently Tracing Programs
(University of Wisconsin-Madison Department of Computer Sciences, 1990) -
Abstract: Magic Templates: A Spellbinding Approach to Logic Programs
(University of Wisconsin-Madison Department of Computer Sciences, 1988) -
Abstraction Refinement for 3-Valued Logic Analysis
(University of Wisconsin-Madison Department of Computer Sciences, 2004)This paper concerns the question of how to create abstractions that are useful for program analysis. It presents a method that refines an abstraction automatically for analysis problems in which the semantics of statements ... -
Access Paths in the Abe Statistical Query Facility
(University of Wisconsin-Madison Department of Computer Sciences, 1982) -
Access Problems with Computer-Based Services
(University of Wisconsin-Madison Department of Computer Sciences, 1983) -
The Accuracy of the Fractional Step Method
(University of Wisconsin-Madison Department of Computer Sciences, 1997) -
Accuracy vs. Performance in Parallel Simulation of Interconnection Networks
(University of Wisconsin-Madison Department of Computer Sciences, 1995) -
An Accurate and Efficient Performance Analysis Technique for Multiprocessor Snooping Cache-Consistency Protocols
(University of Wisconsin-Madison Department of Computer Sciences, 1988) -
Achieving Good End-to-End Service Using Bill-Pay
(University of Wisconsin-Madison Department of Computer Sciences, 2006) -
Acquiring Recursive and Iterative Concepts With Explanation-Based Learning
(University of Wisconsin-Madison Department of Computer Sciences, 1989)In explanation-based learning, a specific problem?s solution is generalized into a form that can be later used to solve conceptually similar problems. Most research in explanation-based learning involves relaxing constraints ...