Abstract not found

to particular programs of the family by the end-user through parametrization. This is applied to the proof of soundness of data manipulation operations at the machine level for periodic synchronous safety critical embedded software. The main novelties are the design principle of static analyzers by refinement

We present a new technique for removing unnecessary syn-chronization operations from statically compiled Java pro-grams. Our approach improves upon current eorts based on escape analysis, as it can eliminate synchronization oper-ations even on objects that escape their allocating threads. It makes

In distributed systems subject to random communication delays and component failures, atomic broadcast can be used to implement the abstraction of synchronous replicated storage, a distributed storage that displays the same contents at every correct processor as of any clock time. This paper

to a simulated dynamic map system. Task analysis revealed that multimodal interaction occurred most frequently during spatial location commands, and with intermediate tiequency during selection commands. In addition, microanalysis of input signals identitkd sequential, simultaneous, point

AbstreetThis paper proposes a set of efficient primitives for process synchronization in muitiprocessors. The only assumptions made in developing the set of primitives are that hardware combining is not implemented in the hter-connect, and (in one case) that the interconnect supports broadcast

I investigate the determinants of business cycles synchronization, across regions and over time. I use both international and intranational data to evaluate the linkages between trade in goods, trade in financial assets, specialization and business cycles synchronization in the context of a system

and inconsistent views. We also propose a language feature called atomic sets of locations, which lets programmers specify the existence of consistency properties between fields in objects, without specifying the properties themselves. We use static analysis to automatically infer those points in the code where

We graft synchronization onto Girard’s Geometry of Interaction in its most concrete form, namely token machines. This is realized by introducing proof-nets for SMLL, an extension of multiplicative linear logic with a specific construct modeling synchronization points, and of a multi-token abstract

We present an end-to-end system that goes from video sequences to high resolution, editable, dynamically controllable face models. The capture system employs synchronized video cameras and structured light projectors to record videos of a moving face from multiple viewpoints. A novel spacetime