1763 search results - page 193 / 353 » A Formalization of Polytime Functions |
93
Voted
CADE
2008
Springer
16 years 2 months ago
2008
Springer
We present a tool for automatic generation of packed bitfields and tagged unions for systems-level C, along with automatic, machine checked refinement proofs in Isabelle/HOL. Our a...
122
Voted
CADE
2007
Springer
16 years 2 months ago
2007
Springer
This paper presents an overview of the verication framework ALICE in its current version 0.7. It is based on the generic theorem prover Isabelle [Pau03a]. Within ALICE a software o...
170
click to vote
ICIP
2009
IEEE
16 years 23 days ago
2009
IEEE
This paper presents a study aimed to the realization of a novel
multiresolution registration framework. The transformation
function is computed iteratively as a composition of lo...
103
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
133
click to vote
FOSSACS
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. The resource calculus is an extension of the λ-calculus allowing to model resource consumption. Namely, the argument of a function comes as a finite multiset of resourc...