This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
We revise the classic methodology to find the multi-product break-even point. In the current paper we propose a solution to the problem under uncertainty conditions, based on DurÃ...
This paper provides a way to specify expressive declassification policies, in particular, when, what, and where policies that include conditions under which downgrading is allowed...
Anindya Banerjee, David A. Naumann, Stan Rosenberg
We define a family of embedded domain specific languages for generating HTML and XML documents. Each language is implemented as a combinator library in Haskell. The generated HTML...
In an important paper, Burer [2] recently showed how to reformulate general mixed-binary quadratic optimization problems (QPs) into copositive programs where a linear functional i...