Data-flow analyses that include some model of the data-flow between MPI sends and receives result in improved precision in the analysis results. One issue that arises with performing data-flow analyses on MPI programs is that the interprocedural control-flow graph ICFG is often irreducible due to call and return edges, and the MPI-ICFG adds further irreducibility due to communication edges. To ...

In [4] we presented a new approach to data analysis based on flow distribution study in a flow network, called here a flow graph. The introduced flow graph differs from that proposed by Ford and Fulkerson [1], Branches of the flow graph are interpreted as decision rules, whereas the flow graph is supposed to describe a decision algorithm. Hence, we propose to model decision processes as flow gr...

Data flow is a mode of parallel computation in which parallelism in a program can be exploited at the fine grained as well as macro level. A data flow computer executes a data dependency graph rather than the program counter controlled sequence of instructions executed by conventional machines. Nonprocedural languages appear to be especially appropriate high level languages for data flow comput...

AbsrructAs the number of available multiprocessors increases, so does the importance of providing software support for these systems, including parallel compilers. Data flow analysis, an important component of software tools, may be computed many times during the compilation of a program, especially when compiling for a multiprocessor. Although converting a sequential data flow algorithm to a p...

As the number of available multiprocessors increases, so does the importance of providing software support for these systems, including parallel compilers. Data flow analysis, an important component of software tools, may be computed many times during the compilation of a program, especially when compiling for a multiprocessor. Although converting a sequential data flow algorithm to a parallel ...

recently, e. m'{a}v{c}ajov'{a} and m. v{s}koviera proved that every bidirected eulerian graph which admits a nowhere zero flow, admits a nowhere zero $4$-flow. this result shows the validity of bouchet's nowhere zero conjecture for eulerian bidirected graphs. in this paper we prove the same theorem in a different terminology and with a short and simple proof. more precisely, we p...

We present the view that the method of multi-level access control, often considered confined in the theory of mandatory access control, instead is central in access control methods, in the sense that it is necessary for data secrecy (i.e. confidentiality) and privacy. This is consequence of a result in directed graph theory showing that there is a multi-level structure in any data flow graph. T...