217 search results - page 32 / 44 » A New Approach to Abstract Syntax with Variable Binding |
JSAT
2006
13 years 7 months ago
2006
Abstract. We introduce new approaches intended to speed up determining the satisfiability of a given Boolean formula expressed as a conjunction of Boolean functions. A common prac...
PLDI
2009
ACM
14 years 2 months ago
2009
ACM
We present the first machine-checked correctness proof for information flow control (IFC) based on program dependence graphs (PDGs). IFC based on slicing and PDGs is flow-sensi...
DTJ
1998
13 years 7 months ago
1998
ir increasing use of abstraction, modularity, delayed binding, polymorphism, and source reuse, especially when these attributes are used in combination. Modern processor architectu...
DAGM
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This contribution presents a novel approach to the challenging problem of model selection in motion estimation from sequences of images. New light is cast on parametric m...
SAT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...