1716 search results - page 308 / 344 » Proving Conditional Termination |
210
Voted
POPL
2009
ACM
16 years 1 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...
201
Voted
POPL
2004
ACM
16 years 1 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...
177
Voted
SIGMOD
2009
ACM
16 years 29 days 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...
138
Voted
VMCAI
2010
Springer
15 years 10 months 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...
113
click to vote
ICIP
2008
IEEE
15 years 7 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...