Sciweavers

1710 search results - page 172 / 342
» High-Level Programs and Program Conditions
Sort
View
ESOP
2008
Springer
13 years 10 months ago
Cover Algorithms and Their Combination
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...
Sumit Gulwani, Madan Musuvathi
EUSFLAT
2003
206views Fuzzy Logic» more  EUSFLAT 2003»
13 years 9 months ago
Analysis of multi-product break-even with uncertain information
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Ã...
Luisa L. Lazzari, María Silvia Moriñ...
SP
2008
IEEE
134views Security Privacy» more  SP 2008»
13 years 8 months ago
Expressive Declassification Policies and Modular Static Enforcement
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
JFP
2002
100views more  JFP 2002»
13 years 8 months ago
A typed representation for HTML and XML documents in Haskell
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...
Peter Thiemann
OL
2010
77views more  OL 2010»
13 years 6 months ago
A note on Burer's copositive representation of mixed-binary QPs
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...
Immanuel M. Bomze, Florian Jarre