632 search results - page 40 / 127 » Proving Invariants of Functional Programs |
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...
94
Voted
FUIN
2006
15 years 17 days ago
2006
The notion of program transformation is ubiquitous in programming language studies on interpreters, compilers, partial evaluators, etc. In order to implement a program transformat...
104
Voted
TPHOL
2002
IEEE
15 years 5 months ago
2002
IEEE
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
110
click to vote
IFIP
2005
Springer
15 years 6 months ago
2005
Springer
A new quasi-Newton scheme for updating a low rank positive semi-definite Hessian approximation is described, primarily for use in sequential quadratic programming methods for non...
76
Voted
ALP
1990
Springer
15 years 4 months ago
1990
Springer
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...