The increasing attention toward distributed shared memory systems attests to the fact that programmers nd shared memory parallel programming easier than message passing programming, while physically distributed memory multiprocessors and networks of workstations o er the desirable scalability for large applications. A current limitation of compilers for shared memory parallel languages is their...

Due to their distributed/parallel and data-driven nature, control systems can easily be modeled according to a data ow approach. Control systems are very often real-time systems therefore a formalism able to capture timing is required. In this paper we introduce a data ow model that includes time and priority for specifying real-time control systems and we give its formal semantics. The control...

This paper is about testability analysis for data-flow software. We describe an application of the SATAN method, which allows testability of data-flow designs to be measured, to analyze testability of the source code of critical data-flow software, such as avionics software. We first propose the transformation of the source code generated from data-flow designs into the Static Single Assignment...

We present a semantics-based technique for analysing probabilistic properties of imperative programs. This consists in a probabilistic version of classical data flow analysis. We apply this technique to pWhile programs, i.e programs written in a probabilistic version of a simple While language. As a first step we introduce a syntax based definition of a linear operator semantics (LOS) which is ...

Data flow analysis techniques can be used to help assess threats to data confidentiality and integrity in security-critical program code. However, a fundamental weakness of static analysis techniques is that they overestimate the ways in which data may propagate at run time. Discounting large numbers of these falsepositive data flow paths wastes an information security evaluator’s time and effo...

The widespread use of the continuation-passing style (CPS) transformation in compilers, opti-mizers, abstract interpreters, and partial evaluators reeects a common belief that the transformation has a positive eeect on the analysis of programs. Investigations by Nielson 14] and Burn/Filho 5, 6] support, to some degree, this belief with theoretical results. However, these investigations do not p...

Flow cytometric analysis allows rapid single cell interrogation of surface and intracellular determinants by measuring fluorescence intensity of fluorophore-conjugated reagents. The availability of new platforms, allowing detection of increasing numbers of cell surface markers, has challenged the traditional technique of identifying cell populations by manual gating and resulted in a growing ne...

Although data pow analysis was first developed for use in compilers, i t s usefulness is now recognized in many software tools. Because of its compiler origins, the computation of data pow for software tools is based on the traditional exhaustive data flow framework. However, although this framework is useful for computing data pow for compilers, it is not the most appropriate for sofsware tool...

the immiscible displacement of oil by water through a porous and permeable reservoir rock can be described by the use of a fractional flow curves (fw versus sw). water flooding project parameters can be obtained from the fractional flow curve. however, developing a representative fractional flow curve for a specific reservoir can be quite challenging when fluid and special core analysis data is...

A token-based model for asynchronous data path, called static data flow structures (SDFS), is formally defined. Three token game semantics are introduced for this model, namely atomic token, spread token and counterflow. The SDFS semantics are analysed using a simple benchmark example; their advantages and drawbacks are highlighted. A combination of spread token and counterflow models, which em...