Now showing items 5-24 of 1766

    • A-Posteriori Error Estimates 

      Parter, Seymour (University of Wisconsin-Madison Department of Computer Sciences, 1974)
    • Abe-A Query Language for Constructing Aggregates-by-Example 

      Klug, Anthony C (University of Wisconsin-Madison Department of Computer Sciences, 1982)
    • An Abstract Domain for Bit-Vector Inequalities 

      Reps, Thomas; Thakur, Aditya; Sharma, Tushar (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 

      Elder, Matt; Lim, Junghee; Sharma, Tushar; Anderson, Tycho; Reps, Thomas (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 

      Elder, Matt; Lim, Junghee; Sharma, Tushar; Andersen, Tycho; Reps, Thomas (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 

      Lal, Akash; Kidd, Nicholas; Reps, Thomas; Touili, Tayssir (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 

      Larus, James R (University of Wisconsin-Madison Department of Computer Sciences, 1990)
    • Abstract: Magic Templates: A Spellbinding Approach to Logic Programs 

      Ramakrishnan, Raghu (University of Wisconsin-Madison Department of Computer Sciences, 1988)
    • Abstraction Refinement for 3-Valued Logic Analysis 

      Loginov, Alexey; Reps, Thomas; Sagiv, Mooly (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 

      Klug, Anthony C (University of Wisconsin-Madison Department of Computer Sciences, 1982)
    • Access Problems with Computer-Based Services 

      Desautels, Edward J (University of Wisconsin-Madison Department of Computer Sciences, 1983)
    • The Accuracy of the Fractional Step Method 

      Strikwerda, John; Lee, Young S. (University of Wisconsin-Madison Department of Computer Sciences, 1997)
    • Accuracy vs. Performance in Parallel Simulation of Interconnection Networks 

      Burger, Douglas C; Wood, David A (University of Wisconsin-Madison Department of Computer Sciences, 1995)
    • An Accurate and Efficient Performance Analysis Technique for Multiprocessor Snooping Cache-Consistency Protocols 

      Vernon, Mary K; Lazowska, Edward D; Zahorjan, John (University of Wisconsin-Madison Department of Computer Sciences, 1988)
    • Achieving Good End-to-End Service Using Bill-Pay 

      Estan, Cristian; Akella, Aditya; Banerjee, Suman (University of Wisconsin-Madison Department of Computer Sciences, 2006)
    • Acquiring Recursive and Iterative Concepts With Explanation-Based Learning 

      Shavlik, Jude W (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 ...
    • Active Cache: Caching Dynamic Contents on the Web 

      Cao, Pei; Zhang, Jin; Beach, Kevin (University of Wisconsin-Madison Department of Computer Sciences, 1998)
    • Active Learning Literature Survey 

      Settles, Burr (University of Wisconsin-Madison Department of Computer Sciences, 2009)
      The key idea behind active learning is that a machine learning algorithm can achieve greater accuracy with fewer labeled training instances if it is allowed to choose the training data from which is learns. An active learner ...
    • Adapting to Intermittent Faults in Multicore Systems 

      Wells, Philip M.; Chakraborty, Koushik; Sohi, Gurindar S. (University of Wisconsin-Madison Department of Computer Sciences, 2007)
      Future multicore processors will become more susceptible to a variety of hardware failures. In particular, intermittent faults, caused in part by manufacturing process variation or in-progress wear-out, can cause bursts ...
    • Adaptive and Robust Query Processing with SHARP 

      Bizarro, Pedro; DeWitt, David (University of Wisconsin-Madison Department of Computer Sciences, 2006)
      Database catalogs often do not contain enough statistical information to correctly cost all possible physi-cal plans. In their absence, the optimizer can produce incorrect estimates and select suboptimal plans for execution. ...