Sciweavers

1140 search results - page 6 / 228
» Progress on Certifying Algorithms
Sort
View
JAR
2011
112views more  JAR 2011»
13 years 4 months ago
A Framework for Certified Boolean Branch-and-Bound Optimization
We consider optimization problems of the form (S, cost), where S is a clause set over Boolean variables x1 . . . xn, with an arbitrary cost function cost: Bn → R, and the aim is ...
Javier Larrosa, Robert Nieuwenhuis, Albert Olivera...
COLT
2005
Springer
14 years 3 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
DAGSTUHL
2001
13 years 11 months ago
A Language-Based Approach to Security
Abstract. Language-based security leverages program analysis and program rewriting to enforce security policies. The approach promises efficient enforcement of fine-grained access ...
Fred B. Schneider, J. Gregory Morrisett, Robert Ha...
POPL
2004
ACM
14 years 10 months ago
Symbolic transfer function-based approaches to certified compilation
We present a framework for the certification of compilation and of compiled programs. Our approach uses a symbolic transfer functions-based representation of programs, so as to ch...
Xavier Rival
WDAG
2005
Springer
80views Algorithms» more  WDAG 2005»
14 years 3 months ago
Obstruction-Free Algorithms Can Be Practically Wait-Free
Abstract. The obstruction-free progress condition is weaker than previous nonblocking progress conditions such as lock-freedom and waitfreedom, and admits simpler implementations t...
Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir...