We present a general model allowing static analysis based on abstract interpretation for systems of communicating processes. Our technique , inspired by Regular Model Checking, represents set of program states as lattice automata and programs semantics as symbolic transducers. This model can express dynamic creation/destruction of processes and communications. Using the abstract interpretation ...

In a process algebra with hiding and recursion it is possible to create processes which compute internally without ever communicating with their environment. Such processes are said to diverge or livelock. In this paper we show how it is possible to conservatively classify processes as livelock-free through a static analysis of their syntax. In particular, we present a collection of rules, base...

Unsteady dynamic behavior of TTCP model with different wrap around fin sets were investigated in a trisonic wind tunne. The aerodynamic coefficient force measurement in this wind tunnel shows good agreement in comparison with that of the NASA Langley Research Center in static case. The model was sinusoidally oscillated at three different frequencies of 1, 3 and 8 Hz at M=2.0 and the effects of ...

Reports on reimplementing or porting legacy code to modern platforms are numerous in the literature. However, they focus on technical problems, functional equivalence, and performance. In the current paper, our goal is to pull maintainability into focus as well and we argue that it is (at least) of equal importance. We conducted source code analysis on two implementations of the runtime environ...

The two main hindrances for a wider application of the model checking approach for verification of concurrent and distributed systems are the state explosion problem and its limitation in handling infinite state systems. We consider a class of infinite state systems given by certain types of Transition Diagrams (TDs), called simple TDs, that employ commutative functions for updating variables. ...

Starting from a static dataflow model it is possible to establish an easy one-to-one correspondance between actors of the model and actors of the machine. This correspondance allows to realize a fine grain dataflow engine with identical Functional Units (FUs) that are the hardware actor implementation. Although actors are characterized by having homogeneous I/O conditions, that is one output an...

In a UML model, different aspects of a system are covered by different types of diagrams and this bears the risk that an overall system specification becomes inconsistent or incomplete. Hence, it is important to provide means to check the consistency and completeness of a UML model. Many approaches for model validation and verification rely on generation of suitable code which dynamically (i.e....

The Global Trade Analysis Project (GTAP) is a research program initiated in 1992 to provide the economic research community with a global economic dataset for use in the quantitative analyses of international economic issues. The Project’s objectives include the provision of a documented, publicly available, global, general equilibrium data base, and to conduct seminars on a regular basis to in...

The Ravenscar profile for Ada enforces several restrictions on the usage of general-purpose tasking constructs, thereby facilitating most analysis tasks and in particular functional and timing verification using model checking. This paper presents an experiment in translating the Ravenscar fragment of Ada into the input language of a timed model checker (IF [7, 8]), discusses the difficulties a...