• 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-10 of 133

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

    Inapproximability After Uniqueness Phase Transition in Two-Spin Systems 

    Cai, Jin-Yi; Chen, Xi; Guo, Heng; Lu, Pinyan (2011-12)
    A two-state spin system is specified by a matrix A = A_{0,0} A_{0,1} A_{1,0} A_{1,1} = beta 1 1 gamma where beta, gamma >= 0. Given an input graph G=(V,E), the partition function Z_A(G) of a system is ...
    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

    Dragging: Density-Ratio Bagging 

    Zhu, Xiaojin; Tan, Yimin (2013-06-06)
    We propose density-ratio bagging (dragging), a semi-supervised extension of bootstrap aggregation (bagging) method. Additional unlabeled training data are used to calculate the weight on each labeled training point by a ...
    Thumbnail

    OpenNF: Enabling Innovation in Network Function Control 

    Gember-Jacobson, Aaron; Viswanathan, Raajay; Prakash, Chaithan; Grandl, Robert; Khalid, Junaid; Das, Sourav; Akella, Aditya (2014-07-07)
    Network functions virtualization (NFV) together with software-defined networking (SDN) has the potential to help operators satisfy tight service level agreements, accurately monitor and manipulate network traffic, and ...
    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

    The Multimodal Focused Topic Model: A Nonparametric Bayesian Approach to Simultaneous Object Classification and Attribute Discovery 

    Zhu, Xiaojin; Dyer, Charles R.; Rosin, Jake (2012-01)
    A nonparametric Bayesian model for attribute-based object recognition and image-based class attribute inference is presented. This model draws on existing work in Bayesian nonparametrics such as the focused topic model. ...
    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

    Reuse-based Analytical Models for Caches 

    Wood, David A.; Sen, Rathijit (2011-11-18)
    We develop a reuse distance/stack distance based analytical modeling framework for efficient, online prediction of cache performance for a range of cache configurations and replacement policies LRU, PLRU, RANDOM, NMRU. ...
    • 1
    • 2
    • 3
    • 4
    • . . .
    • 14

    Contact Us | Send Feedback
     

     

    Browse

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

    My Account

    Login

    Discover

    AuthorReps, Thomas (33)Akella, Aditya (13)Thakur, Aditya (12)Sankaralingam, Karthikeyan (11)Jha, Somesh (8)Zhu, Xiaojin (7)Liblit, Ben (6)Linderoth, Jeff (6)Hill, Mark D. (5)Ho, Chen-Han (5)... View MoreSubjectabstract interpretation (12)symbolic abstraction (6)machine code (5)debugging (4)machine learning (4)Accelerators (3)best transformer (3)computer architecture (3)IA-32 instruction set (3)machine-code synthesis (3)... View MoreDate Issued2013 (23)2011 (22)2012 (18)2010 (16)2014 (14)2015 (12)2016 (11)2017 (11)2018 (6)Has File(s)Yes (133)

    Contact Us | Send Feedback