9626 search results - page 405 / 1926 » Invariant Based Programming |
151
click to vote
CAV
2006
Springer
15 years 10 months ago
2006
Springer
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
155
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
193
click to vote
LOPSTR
2000
Springer
15 years 10 months ago
2000
Springer
In this paper we will present a formal framework, based on the notion of extraction calculus, which has been successfully applied to define procedures for extracting information fr...
182
click to vote
NIPS
2003
15 years 8 months ago
2003
Learning from ambiguous training data is highly relevant in many applications. We present a new learning algorithm for classification problems where labels are associated with se...
162
click to vote
CAL
2002
15 years 6 months ago
2002
Embedded systems commonly execute one program for their lifetime. Designing embedded system architectures with configurable components, such that those components can be tuned to t...