Now showing items 43-62 of 95

    • A New Abstraction Framework for Affine Transformers 

      Reps, Thomas; Sharma, Tushar (2017-05-16)
      Abstract. This paper addresses the problem of abstracting a set of affine transformers v' = v C + d, where v and v' represent the pre-state and post-state, respectively. We introduce a framework to harness any base abstract ...
    • A New Program Integration Algorithm 

      Yang, Wuu; Horwitz, Susan; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 1989)
      Program integration attempts to construct a merged program from several related but different variants of a base program. The merged program must include the changed computations of the variants as well as the computations ...
    • New Programs From Old 

      Ramalingam, G; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 1991)
    • Newtonian Program Analysis via Tensor Product 

      Reps, Thomas; Turetsky, Emma; Prabhu, Prathmesh (2016-02-10)
      Recently, Esparza et al. generalized Newton's method -- a numerical-analysis algorithm for finding roots of real-valued functions -- to a method for finding fixed-points of systems of equations over semirings. Their method ...
    • Numeric Analysis of Array Operations 

      Gopan, Denis; Reps, Thomas; Sagiv, Mooly (University of Wisconsin-Madison Department of Computer Sciences, 2004)
      We present a numeric analysis that is capable of reasoning about array operations. In particular, the analysis is able to establish that all elements of an array have been initialized ("an array kill"), as well as to ...
    • On Generalized Authorization Problems 

      Schwoon, Stefan; Jha, Somesh; Reps, Thomas; Stubblebine, S. (University of Wisconsin-Madison Department of Computer Sciences, 2003)
      This paper defines a framework in which one can formalize a variety of authorization and policy issues that arise in access control of shared computing resources. Instantiations of the framework address such issues as ...
    • On the Adequacy of Program Dependence Graphs for Representing Programs 

      Horwitz, Susan; Prins, Jan; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 1987)
    • On the Algebraic Properties of Program Integration 

      Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 1989)
    • On the Computational Complexity of Incremental Algorithms 

      Ramalingam, G; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 1991)
    • Parametric Shape Analysis via 3-Valued Logic 

      Sagiv, Mooly; Reps, Thomas; Wilhelm, Reinhard (University of Wisconsin-Madison Department of Computer Sciences, 1998)
    • Partial Evaluation of Machine Code 

      Srinivasan, Venkatesh; Reps, Thomas (2015-08-21)
      This paper presents an algorithm for off-line partial evaluation of machine code. The algorithm follows the classical two-phase approach of binding-time analysis (BTA) followed by specialization. However, machine-code ...
    • PostHat and All That: Attaining Most-Precise Inductive Invariants 

      Reps, Thomas; Lim, Junghee; Lal, Akash; Thakur, Aditya (2013-04-16)
      In abstract interpretation, the choice of an abstract domain fixes a limit on the precision of the inductive invariants that one can express; however, for a given abstract domain A, there is a most-precise (``strongest'', ...
    • Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation 

      Sagiv, Mooly; Reps, Thomas; Horwitz, Susan (University of Wisconsin-Madison Department of Computer Sciences, 1995)
    • Program Analysis via Graph Reachability 

      Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 1998)
    • Program Generalization for Software Reuse: From C to C++ 

      Siff, Michael; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 1996)
    • Program Specialization via Program Slicing 

      Reps, Thomas; Turnidge, Todd (University of Wisconsin-Madison Department of Computer Sciences, 1995)
    • Programming for a Capability System via Safety Games 

      Harris, William R.; Farley, Benjamin; Jha, Somesh; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 2011)
      New operating systems with security-specific system calls, such as the Capsicum capability system, allow programmers to write applications that satisfy strong security properties with significantly less effort than full ...
    • Programming for a Capability System via Safety Games 

      Farley, Benjamin; Harris, William; Reps, Thomas; Jha, Somesh (2012-04-05)
      New operating systems with security-specific system calls, such as the Capsicum capability system, allow programmers to write applications that satisfy strong security properties with significantly less effort than full ...
    • Property-Directed Shape Analysis 

      Itzhaky, Shachar; Bjorner, Nikolaj; Reps, Thomas; Sagiv, Mooly; Thakur, Aditya (2014-05-22)
      This paper addresses the problem of automatically generating quantified invariants for programs that manipulate singly and doubly linked-list data structures. Our algorithm is property-directed -- i.e., its choices are ...
    • Recency-Abstraction for Heap-Allocated Storage 

      Balakrishnan, Gogul; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 2005)
      In this paper, we present an abstraction for heap-allocated storage, called the recency-abstraction, that allows abstract-interpretation algorithms to recover non-trivial information for heap-allocated data objects. As an ...