1716 search results - page 308 / 344 » Proving Conditional Termination |
240
click to vote
POPL
2009
ACM
16 years 3 months ago
2009
ACM
This paper presents a type-based solution to the long-standing problem of object initialization. Constructors, the conventional mechanism for object initialization, have semantics...
236
click to vote
POPL
2004
ACM
16 years 3 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
201
click to vote
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is careful...
162
click to vote
VMCAI
2010
Springer
16 years 11 days ago
2010
Springer
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
139
click to vote
ICIP
2008
IEEE
15 years 9 months ago
2008
IEEE
This appendix proves the illumination robustness of the proposed corner detector over the Harris corner detector. I. HARRIS CORNER DETECTOR The Harris corner detector [1] is based...