A number of investigators have continued to discuss application of asynchronous techniques to rmprove the computational power of computing systems. 2.12,5,9 In fact the need for asynchronous design techniques arose in the earliest machines 26,6.2o which introduced parallel handling of bits in a number and overlapping of independent operations. The concept of distributed autonomous concurrent pr...

Recently, there has been much interest in performing demand-driven data-flow analysis in software development environments. Demand-driven analysis techniques compute data-flow fact(s) for a particular program point, rather than computing data-flow information for the entire program. The existing work in this area, however, assumes that the static call graph is available for the entire program. ...

This is the third in a series introducing the activity model in the Unified Modeling Language, version 2 (UML 2), and how it integrates with the action model [1]. The previous article addressed the execution characteristics of actions in general, and additional functionality of actions that invoke behaviors [2]. The first article gave an overview of activities and actions that is assumed here [...

Suppose G is an nvertex and medge simple graph with edge set E(G). An integervalued function f: E(G) → Z is called a flow. Tutte was introduced the flow polynomial F(G, λ) as a polynomial in an indeterminate λ with integer coefficients by F(G,λ) In this paper the Flow polynomial of some dendrimers are computed.

We suggest a graphical system for analyzing and processing algorithm structure with a user-friendly interface and a set of necessary tools. The system is designed to make the process of visualization, modification, and analysis of algorithm graphs easier. The system provides algorithm flow graph building and analysis, the algorithm flow graph height and width adjustment, algorithm simplificatio...

We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n) and Õ(m). The algorithms use a new compact data structure for representing reducible flow graphs called Annotated Decomposition Trees. This data structure extends a binary tree to represent flowgraph information, dominance relat...

This paper describes how the jABC, a generic framework for library-based program development, and two of its plugins the Model Checker and a flow graph converter form a framework for intraprocedural data-flow analysis via model checking. Based on functionalities provided by the Soot program analysis platform, the converter generates graph structures from Java classes. Data flow analyses are the...

In the omnipresent model of the stored-program computer, both the instructions and data are held in a single storage structure. Therefore, instructions can be read and written as if they were data. In practice however, instructions rarely change during the execution of the program. As a result, it is often assumed that the instructions are constant. Therefore, many tools and analyses fail in th...

a communication net is usually represented by a linear graph g whose branches represent channels for information flow and whose vertices represent sources, sinks and switching centers. the purpose of this paper is to show that for modeling digital communication nets, conventional use of the concepts of capacity and terminal capacity is inadequate . we will present an alternative to max-flow min...