This paper deals with the constrained reconstruction of 3D geometric models ofobjects from range data. It describes a new technique of global shape improvementbased upon feature positions and geometric constraints. It suggests a general incre-mental framework whereby constraints can be added and integrated in the modelreconstruction process, resulting in an optimal trade-o b...

It has been amply demonstrated in recent years that careful attention to the structure of systems software can lead to greater exibility, reliability, and ease of implementation, without incurring an undue penalty in performance. It is our contention that advanced programming languages| particularly languages with a mathematically rigorous semantics, and featuring higher-order functions, polymo...

detailed A B = `A implements B' 1 = root election 2 = cycle detection 3 = root contention solution [7] [27] this paper [4] [26] 1+2 TIP1 TIP2 TIP3 TIP4 3 I3 I2 I1 Impl Spec SPEC TIP Spec ImpA ImpB 1 1+3 which part of the protocol: Figure 5: An overview of research on the IEEE 1394 tree identify phase actually terminates within bounded time, since for the veri cation it is enough to show that it...

Object-oriented techniques have been pro ered as aids for managing complexity, enhancing reuse, and improving readability of irregular parallel applications. However, as performance is the major reason for employing parallelism, programmability and high performance must be delivered together. Using a suite of seven challenging irregular applications and the mature Illinois Concert system (a hig...

Syntax: P 2 Program TD 2 Type-Declaration T, S, U 2 Type-Name MD 2 Method-Declaration F* 2 Formal-List F 2 Formal B 2 Body D 2 Declaration E 2 Expression g 2 Method-Name E* 2 Expression-List C 2 Command M 2 Main I 2 Identi er N 2 Numeric-literal P ::= TD MD M TD ::= j type I fields ( F* ) j TD1 ; TD2 FD ::= j I : T j FD1 ; FD2 T ::= I MD ::= j method I ( F* ) : T f B g j MD1 ; MD2 F* ::= j F F*...

In this paper we suggest to use the B formal method to model a protocol dedicated to smart cards. We use a pragmatic approach to prove the dynamic properties of the protocol by using historical variables to express the past. We check manually that those variables have been correctly updated in the different operations. With this approach we can avoid the use of a model checker to verify the dyn...

versions of the immediate consequence operators that we will introduce canbe used for bottom-up abstract interpretation (i.e. xpoint computation of the ab-stract model). Abstract interpretation of CLP programs has been considered in adenotational semantics framework in [38], while we can generalize the bottom-up ap-proach in [3]. More interestingly, the compositional semantics c...

ion of the non-negative natural numbers. The correctness of the com-plete analysis then follows from the subject reduction result of [13] that allowsus to lift safety (as opposed to liveness) results from the behaviours to safetyresults for CML programs.We also address the implementation of the second stage of the analysis.Here the idea is to transform the problem as speci e...