1,721,060 research outputs found
On the verification of Finite Failure
No full textIn Gori [An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations, Theoret. Comput. Sci. 290(1) (2003) 863-936] a new fixpoint semantics which correctly models finite failure has been defined. This semantics is And-compositional, compositional w.r.t. instantiation and is based on a co-continuous operator. Based on this fixpoint semantics a new inductive method able to verify a program w.r.t. the property of finite failure can be defined. In this paper we show how Ferrand's approach, using both a least fixpoint and greatest fixpoint semantics, can be adapted to finite failure. The verification method is not effective. Therefore, we consider an approximation from above and an approximation from below of our semantics, which give two different finite approximations. These approximations are used for effective program verification
A GREY-WEIGHTED SKELETON
No full textSkeletons have been largely used as descriptors of shape in the field of image processing. Only binary pictures, however, have been considered so far. In this paper a grey-weighted skeleton is defined for grey-valued continuous and quantized images. In order to extend the invertibility property of the skeleton to the grey case, a transformation is defined, which is a generalization of both direct and inverse binary skeleton transformations. By taking advantage of the properties of this transformation, a procedure for the inversion of a grey-weighted skeleton (i.e., for obtaining a binary reconstructed image from a grey-weighted skeleton) is finally proposed
INTERNATIONAL JOINT CONFERENCE ON THEORY AND PRACTICE OF SOFTWARE-DEVELOPMENT, PISA, MARCH 1987
No full text
- …
