Search
Now showing items 1-10 of 133
Inapproximability After Uniqueness Phase Transition in Two-Spin Systems
(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 ...
An Algorithm Inspired by Constraint Solvers to Infer Inductive Invariants in Numeric Programs
(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 ...
A Method for Symbolic Computation
(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 ...
Dragging: Density-Ratio Bagging
(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 ...
OpenNF: Enabling Innovation in Network Function Control
(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 ...
Secure Programming via Visibly Pushdown Safety Games
(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 ...
The Multimodal Focused Topic Model: A Nonparametric Bayesian Approach to Simultaneous Object Classification and Attribute Discovery
(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. ...
Abstract Domains of Affine Relations
(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 ...
PostHat and All That: Attaining Most-Precise Inductive Invariants
(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'', ...
Reuse-based Analytical Models for Caches
(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. ...










