Browsing Department of Computer Sciences, UW-Madison by Title

Now showing items 1-20 of 1922

    • The 007 Benchmark 

      Carey, Michael J; Dewitt, David J; Naughton, Jeffrey F (University of Wisconsin-Madison Department of Computer Sciences, 1993)

    • A 2-Layered SIMD/MIMD Parallel Pyramidal "Array/Net" 

      Uhr, Leonard; Thompson, Murray; Lackey, Joseph (University of Wisconsin-Madison Department of Computer Sciences, 1980)

    • 3-D Multiview Object Representations for Model-Based Object Recognition 

      Korn, Matthew R; Dyer, Charles R (University of Wisconsin-Madison Department of Computer Sciences, 1985)

    • 3600 Drum Scope System Routines for the DD212 Terminal 

      Venezky, Richard (University of Wisconsin-Madison Department of Computer Sciences, 1967)

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

    • Absolute Value Equation Solution via Dual Complementarity 

      Mangasarian, Olvi (2011)
      By utilizing a dual complementarity condition, we propose an iterative method for solving the NPhard absolute value equation (AVE): Ax?|x| = b, where A is an n�n square matrix. The algorithm makes no assumptions on the ...

    • Absolute Value Equations 

      Meyer, Robert; Mangasarian, Olvi (2005)
      We investigate existence and nonexistence of solutions for NP-hard equations in- volving absolute values of variables: Ax ? |x| = b, where A is an arbitrary n � n real matrix. By utilizing an equivalence relation to the ...

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

    • Accessing Realistic Mixed Complementarity Problems within MATLAB 

      Rutherford, Thomas F.; Ferris, Michael C. (1995)
      This paper describes a suite of programs that allow realistic complementarity problems to be accessed from within the MATLAB programming environment. The suite of programs uses data generated from the GAMS/MCP library and ...

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