• Login
    Search 
    •   MINDS@UW Home
    • MINDS@UW Madison
    • College of Letters and Science, University of Wisconsin–Madison
    • Department of Computer Sciences, UW-Madison
    • CS Technical Reports
    • Search
    •   MINDS@UW Home
    • MINDS@UW Madison
    • College of Letters and Science, University of Wisconsin–Madison
    • Department of Computer Sciences, UW-Madison
    • CS Technical Reports
    • 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-6 of 6

    • Sort Options:
    • Relevance
    • Title Asc
    • Title Desc
    • Issue Date Asc
    • Issue Date Desc
    • Results Per Page:
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100
    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

    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

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

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

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

    A Method for Symbolic Computation of Abstract Operations 

    Thakur, Aditya; Reps, Thomas (2012-02)
    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 an ...

    Contact Us | Send Feedback
     

     

    Browse

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

    My Account

    Login

    Discover

    AuthorReps, Thomas (6)Thakur, Aditya (5)Elder, Matt (2)Lim, Junghee (2)Sharma, Tushar (2)Anderson, Tycho (1)Lal, Akash (1)Subjectabstract interpretation (6)
    symbolic abstraction (6)
    best transformer (3)machine code (2)modular arithmetic (2)Staalmarck's method (2)abstract domain (1)ane relation (1)domain combination (1)Howell form (1)... View MoreDate Issued2013 (3)2012 (2)2011 (1)Has File(s)Yes (6)

    Contact Us | Send Feedback