Now showing items 1-5 of 5

    • 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) ...
    • Bilateral Algorithms for Symbolic Abstraction 

      Reps, Thomas; Elder, Matt; Thakur, Aditya (University of Wisconsin-Madison Department of Computer Sciences, 2012-03-28)
      Given a concrete domain C, a concrete operation tau: C -> C, and an abstract domain A, a fundamental problem in abstract interpretation is to find the best abstract transformer tau#: A -> A that over-approximates tau. ...
    • Code Sandwiches 

      Elder, Matt; Jackson, Steve; Liblit, Ben (University of Wisconsin-Madison Department of Computer Sciences, 2008)
      A code sandwich consists of before, after, and body code. Typically, the before code makes some change, the body code works in the context of the change, and the after code undoes the change. A code sandwich must guarantee ...
    • Heap Typability is NP-Complete 

      Elder, Matt; Liblit, Ben (University of Wisconsin-Madison Department of Computer Sciences, 2007)
      Given a snapshot of a running program�s memory heap, and a set of types representing data in the program, dynamic heap type inference attempts to assign types to memory locations such that certain global consistency ...