Now showing items 15-34 of 95

    • A Decision Procedure for Detecting Atomicity Violations for Communicating Processes with Locks 

      Kidd, Nicholas; Lammich, Peter; Touili, Tayssir; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 2009)
      We present a new decision procedure for detecting property violations in pushdown models for concurrent programs that use lock-based synchronization, where each thread's lock operations are properly nested (a la ...
    • Declarative, Temporal, and Practical Programming with Capabilities 

      Watson, Robert N. M.; Anderson, Jonathan; Reps, Thomas; Jha, Somesh; Harris, William R. (2013-02-26)
      New operating systems, such as the Capsicum capability system, allow a programmer to write an application that satisfies strong security properties by invoking security- specific system calls at a few key points in the ...
    • Demand Interprocedural Dataflow Analysis 

      Horwitz, Susan; Reps, Thomas; Sagiv, Mooly (University of Wisconsin-Madison Department of Computer Sciences, 1995)
    • Demonstration of a Prototype Tool for Program Integration 

      Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 1989)
      This paper illustrates a sample session with a preliminary implementation of a program-integration tool. The tool has been embedded in a program editor created using the Synthesizer Generator, a meta-system for creating ...
    • Detecting Program Components With Equivalent Behaviors 

      Yang, Wuu; Horwitz, Susan; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 1989)
      The execution behavior of a program component is defined as the sequence of values produced at the component during program execution. This paper presents an efficient algorithm for detecting program components ? in one ...
    • DIFC Programs by Automatic Instrumentation 

      Harris, William; Jha, Somesh; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 2010)
      Decentralized information flow control (DIFC) operating systems provide applications with mechanisms for enforcing information-flow policies for their data. However, significant obstacles keep such operating systems ...
    • Dissolve: A Distributed SAT Solver Based on Stalmarck's Method 

      Henry, Julien; Thakur, Aditya; Kidd, Nicholas; Reps, Thomas (2017-03-08)
      Creating an effective parallel SAT solver is known to be a challenging task. At present, the most efficient implementations of parallel SAT solvers are portfolio solvers with some heuristics to share learnt clauses. In ...
    • Distributed Certificate-Chain Discovery in SPKI/SDSI 

      Schwoon, Stefan; Wang, Hao; Jha, Somesh; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 2005)
      The authorization problem is to decide whether, according to a security policy, some principal should be allowed access to a resource. In the trust-management system SPKI/SDSI, the security policy is given by a set of ...
    • Efficient Comparison of Program Slices 

      Horwitz, Susan; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 1990)
    • Executable Slicing via Procedure Specialization 

      Aung, Min; Horwitz, Susan; Joiner, Rich; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 2012-03)
      Although Weiser originally defined a program slice to be an executable projection of a program, much of the research on slicing has focused on closure slices, which consist of the set of statements and conditions of the ...
    • A Generalization of Staalmarck's Method 

      Reps, Thomas; Thakur, Aditya (University of Wisconsin-Madison Department of Computer Sciences, 2011-12)
      This paper gives an account of Staalmarck's method for validity checking of propositional-logic formulas, and explains each of the key components in terms of concepts from the field of abstract interpretation. We then ...
    • Identifying Modules Via concept Analysis 

      Siff, Michael; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 1997)
    • Illustrating Interference in Interfering Versions of Programs 

      Reps, Thomas; Bricker, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 1989)
      The need to integrate several versions of a program into a common one arises frequently, but it is a tedious and time consuming task to merge programs by hand. The program-integration algorithm recently proposed by S. ...
    • Improving Pushdown System Model Checking 

      Lal, Akash; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 2006)
      In this paper, we reduce pushdown system (PDS) model checking to a graph-theoretic problem, and apply a fast graph algorithm to improve the running time for model checking. We use \textit{weighted} PDSs as a generalized ...
    • An Incremental Algorithm for a Generalization of the Shortest-Path Problem 

      Ramalingam, G; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 1992)
    • Incremental Evaluation for Attribute Grammars With Unrestricted Movement Between Tree Modifications 

      Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 1986)
    • Integrating Non-Interfering Versions of Programs 

      Horwitz, Susan; Prins, Jan; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 1987)
    • Interconvertibility of Set Constraints and Context-Free Language Reachability 

      Melski, David; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 1996)
    • Interprocedural Analysis of Concurrent Programs Under a Context Bound 

      Lal, Akash; Touili, Tayssir; Kidd, Nicholas; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 2007)
      Analysis of recursive programs in the presence of concurrency and shared memory is undecidable. A common approach is to remove the recursive nature of the program while dealing with concurrency. A different approach is ...
    • Interprocedural Path Profiling 

      Melski, David; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 1998)