Library developers often have to deal with client compatibility issues across versions of a library that are identical in their API specification. The reason for this can often be traced to some unspecified assumptions made by the client about the behaviour of exported library functions. Earlier work in this direction includes [4] . One could partially address this problem by analyzing the data...

The paper describes how to translate a Prolog program into a control ow graph (CFG). The program is annotated with control information and a system of simple set constraints is formed and solved. Using this information, a CFG can be constructed straightforwardly, which is described. In order to represent control information compactly, the paper proposes a method to structure the solution of the...

Source code clone detection, which can identify fragments with similar functions, plays a significant role in software development and quality assurance. Existing methods either extract single syntactic or semantic information, ignore the associated information between statements different structures. It is difficult for these to effectively detect pairs functions. In this paper, we propose new...

We propose an algorithm for the transfer of packed linguistic structures, that is, finite collections of labelled graphs which share certain subparts. A labelled graph is seen as a word over a vocabulary of description elements (nodes, arcs, labels), and a collection of graphs as a set of such words, that is, as a language over description elements. A packed representation for the collection of...

A control flow graph represents all the flows of control that may arise during program execution. Since exception mechanism in Java induces flows of control, exception induced control flow have to be incorporated in control flow graph. In the previous research to construct control flow graph, they compute exception flow and normal flow at the same time while computing control flow information. ...

We consider the game of Go from the point of view of machine learning and as a well-deened domain for learning on graph representations. We discuss the representation of both board positions and candidate moves and introduce the common fate graph (CFG) as an adequate representation of board positions for learning. Single candidate moves are represented as feature vectors with features given by ...

This paper gives a shortest path algorithm for CFG (context free grammar) labeled and weighted digraphs where edge weights may be positive or negative, but negative-weight cycles are not allowed in the underlying unlabled graph. These results build directly on an algorithm of Barrett, Jacob, and Marathe [1]. In addition to many other results, they gave a shortest path algorithm for CFG labeled ...

Before proving Lemma 1 from [MS13] we prove several propositions that relate paths in the graph PDG(CFG c ) where c is of the form if (e) then c1 else c2 fi, while (e) do c1 od, or c1; c2 to paths in the graphs PDG(CFG I,O c1 ) and (if applicable) PDG(CFG c2 ). In the proofs, we write p + k for the path that is obtained from p by adding k to each node on p that is a natural number, and leaving ...

A parametric approach to control dependence is presented, where the parameter is any prefix-invariant property on paths in the control-flow graph (CFG). Existing control dependencies, both direct and indirect, can be obtained as instances of the parametric framework for particular properties on paths. A novel control dependence relation, called termination-sensitive control dependence, is obtai...

abstract. 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.