• Login
    Search 
    •   MINDS@UW Home
    • MINDS@UW Madison
    • Search
    •   MINDS@UW Home
    • MINDS@UW Madison
    • Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Search

    Show Advanced FiltersHide Advanced Filters

    Filters

    Use filters to refine the search results.

    Now showing items 1-10 of 95

    • Sort Options:
    • Relevance
    • Title Asc
    • Title Desc
    • Issue Date Asc
    • Issue Date Desc
    • Results Per Page:
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100
    Thumbnail

    An Algorithm Inspired by Constraint Solvers to Infer Inductive Invariants in Numeric Programs 

    Mine, Antoine; Breck, Jason; Reps, Thomas (2016-01-08)
    This paper addresses the problem of proving a given invariance property phi of a loop in a numeric program, by inferring automatically a stronger inductive invariant psi. The algorithm we present is based on both abstract ...
    Thumbnail

    A Method for Symbolic Computation 

    Reps, Thomas; Thakur, Aditya (2011-12)
    In 1979, Cousot and Cousot gave a specification of the ?best? (most-precise) abstract transformer possible for a given concrete transformer and a given abstract domain. Unfortunately, their specification does not lead to ...
    Thumbnail

    Symbolic Analysis via Semantic Reinterpretation 

    Lim, Junghee; Lal, Akash; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 2008)
    In recent years, the use of symbolic analysis in systems for testing and verifying programs has experienced a resurgence. By ``symbolic program analysis'', we mean logic-based techniques to analyze state changes along ...
    Thumbnail

    Semantics of Program Representation Graphs 

    Ramalingam, G; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 1989)
    Program representation graphs are a recently introduced intermediate representation form for programs. In this paper, we develop a mathematical semantics for these graphs by interpreting them as data-flow graphs. We also ...
    Thumbnail

    Secure Programming via Visibly Pushdown Safety Games 

    Harris, William; Jha, Somesh; Reps, Thomas (2012-01)
    Several recent operating systems provide system calls that allow an application to explicitly manage the privileges of modules with which the application interacts. Such privilege-aware operating systems allow a programmer ...
    Thumbnail

    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 ...
    Thumbnail

    Verifying Concurrent Message-Passing C Programs with Recursive Calls 

    Chaki, Sagar; Clarke, Edmund; Kidd, Nicholas; Reps, Thomas; Touili, Tayssir (University of Wisconsin-Madison Department of Computer Sciences, 2005)
    We consider the model-checking problem for C programs with (1) data ranging over very large domains, (2) (recursive) procedure calls, and (3) concurrent parallel components that communicate via synchronizing actions. We ...
    Thumbnail

    Recovery of Variables and Heap Structure in x86 Executables 

    Balakrishnan, Gogul; Reps, Thomas (University of Wisconsin-Madison Department of Computer Sciences, 2005)
    This paper addresses two problems that arise when analyzing executables: (1) recovering variable-like quantities in the absence of symbol-table and debugging information, and (2) recovering useful information about objects ...
    Thumbnail

    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 ...
    Thumbnail

    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 ...
    • 1
    • 2
    • 3
    • 4
    • . . .
    • 10

    Contact Us | Send Feedback
     

     

    Browse

    All of MINDS@UWCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CommunityBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Discover

    Author
    Reps, Thomas (95)
    Horwitz, Susan (13)Jha, Somesh (11)Kidd, Nicholas (11)Lal, Akash (11)Thakur, Aditya (11)Sagiv, Mooly (10)Lim, Junghee (8)Ramalingam, G (5)Touili, Tayssir (5)... View MoreSubjectabstract interpretation (11)symbolic abstraction (6)machine code (5)best transformer (3)canonical abstraction (2)capabilities (2)IA-32 instruction set (2)machine-code synthesis (2)modular arithmetic (2)predicate abstraction (2)... View MoreDate Issued2010 - 2017 (33)2000 - 2009 (29)1990 - 1999 (21)1986 - 1989 (12)Has File(s)Yes (95)

    Contact Us | Send Feedback