W. Yang. Identifying syntactic differences between two programs. Softw. Pract. Exper., 21(7):739--755, 1991.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....approaches assume the availability of a list of modifications, perhaps created by a cooperating editor that tracks the changes applied to P . Other approaches assume that a mapping of code segments in P to their corresponding segments in P 0 can be obtained using algorithms that perform slicing[22] or establish graph isomorphisms[11] 2. Select T 0 T , the set of tests to reexecute on P 0 . This step may make use of the results of step 1, coupled with test history information that records the input, output, and execution history for each test. An execution history for a given test ....

W. Yang. Identifying syntactic differences between two programs. Software---Practice and Experience, 21(7):739--55, July 1991.

....retest place less emphasis on coverage criteria[11, 12, 21] One drawback of these approaches is that they require prior knowledge of all changes made to the original program. This knowledge must be obtained either by a programming environment that tracks changes as they are made, or by algorithms[11, 22] that determine corresponding program components. The assumption of a programming environment that tracks changes is unreasonable for large programs given current practice; the algorithms for determining corresponding components are unnecessarily costly for this application. In this paper, we ....

W. Yang, "Identifying syntactic differences between two programs," Software--Practice and Experience, Vol. 21(7), pp. 739-55, July, 1991.

....the hardness result mentioned above still holds. In general, there are several formulations of the problem of detecting changes in snapshots of data. In addition to being useful for managing change in autonomous databases, such techniques have applications in many other domains. For example, Yan91] describes the application of a technique similar to that in [Sel77] to identify syntactic differences between versions of a program. The formulation that is most profitable to use depends on the application at hand. In an application with a small amount of data (e.g. structured catalogue ....

....is independent of the cost model used, making our methods for detecting changes useful in diverse application domains. The idea of working with signatures is widely used in the literature of differencing algorithms, in various forms (such as traces or matchings) WF74, Mye86, ZS89, Yan91] However, the introduction of move and copy operations makes it hard to recover a script from a signature, and this makes it difficult to detect changes using signatures. To illustrate some of these difficulties, Figure 6.1(b) shows the traditional signature of the edit script in Figure ....

[Article contains additional citation context not shown here]

W. Yang. Identifying syntactic differences between two programs. Software---Practice and Experience, 21(7):739--755, July 1991.

....compares the text string derived 6 from concatenating the code corresponding to the cdsuccessors of N to that derived from concatenating the code corresponding to the cd successors of N 0 . Alternatively, GetCorresp can use a method such as the SequenceMatching algorithm presented in [10] and [24]. If the mapping method is conservative and avoids false positives that identify changed components as unchanged, Compare will select safe test sets. More precise methods for establishing mapping yield more precise test selection, but at increased execution cost. When GetCorresp returns true, ....

W. Yang. Identifying syntactic differences between two programs. Software---Practice and Experience, 21(7):739--55, July 1991. 16

....classifying the changes as either semantic or textual. The difference between two code versions is defined as the number of semantically or textually changed components of the new version plus the number of new flow or control dependence edges in the graph representation of the new version. Wang [81] developed a comparison algorithm that detects syntactic differences between two sequential Pascal program versions by constructing and comparing a variant of their parse trees. The results are visualized using a simple textual side by side display of the two versions with differences color coded. ....

W. Yang. Identifying syntactic differences between two programs. Software -- Practice and Experience, 21(7):739--755, July 1991.

....for reasons similar to those stated above, in practice we often need to detect the differences ourselves by comparing the two versions. For example, CAW98] describes experiences in detecting and browsing differences between different versions of a restaurant review database on the Web, while [Yan91] describes the implementation of an application that highlights differences between program versions. There is a substantial body of prior work on differencing algorithms. The main distinguishing features of the work in this paper are the following. See Section 6 for a detailed discussion. ....

....in RAM. See [Vit98] for an overview of external memory algorithms. In this paper, we analyze algorithms based on their I O, RAM, and CPU costs. As an illustration of the importance of using an algorithm that is cognizant of the hierarchical structure of data, consider the following example from [Yan91] Figure 1 depicts depicts fragments of two program versions that are being compared. A sequence comparison program such as the one in[MM85] compares the inputs line by line and may result in matching program text as suggested by the solid lines in the figure. Given the nested structure of the ....

W. Yang. Identifying syntactic differences between two programs. Software---Practice and Experience, 21(7):739--755, July 1991.

....for reasons similar to those stated above, in practice we often need to detect the differences ourselves by comparing the two versions. For example, CAW98] describes experiences in detecting and browsing differences between different versions of a restaurant review database on the Web, while [Yan91] describes the implementation of an application that highlightsdifferences between program versions. There is a substantial body of prior work on differencing algorithms. The main distinguishing features of the work in this paper are the following. See Section 6 for a detailed discussion. ffl ....

....in RAM. See [Vit98] for an overview of external memory algorithms. In this paper, we analyze algorithms based on their I O, RAM, and CPU costs. As an illustrationof the importance of using an algorithm that is cognizant of the hierarchical structure of data, consider the following example from [Yan91] Figure 1 depicts depicts fragments of two program versions that are being compared. A sequence comparison program such as the one in[MM85] compares the inputs line by line and may result in matching program text as suggested by the solid lines in the figure. Given the nested structure of the ....

W. Yang. Identifying syntactic differences between two programs. Software---Practice and Experience, 21(7):739--755, July 1991.

....the problem of comparing tree structured data. This problem has applications in several diverse fields, including molecular biology, natural language processing, image and pattern matching, program analysis, document management, and change management in databases [SZ90, NBR88, WZJS94, WCM 94, Yan91, WSC 97, C3] Our interest in this problem stems from implementing a subscription service that detects database changes by periodically querying an external database and checking the results for new changes [CGL 97] For example, consider a Web site listing local entertainment events ....

....is independent of the cost model used, making our methods for detecting changes useful in diverse application domains. The idea of working with signatures is widely used in the literature of differencing algorithms, in various forms (such as traces or matchings) WF74, Mye86, ZS89, Yan91, CGM97] However, the introduction of move and copy operations makes it hard to recover a script from a signature, and this makes it difficult to detect changes using signatures. To illustrate some of these difficulties, Figure 1(b) shows the traditional signature of the edit script in Figure ....

[Article contains additional citation context not shown here]

W. Yang. Identifying syntactic differences between two programs. Software---Practice and Experience, 21(7):739--755, July 1991.

....Lu treated each subtree as a whole entity and did not allow one subtree to match more than one subtrees in the other tree. Tanaka and Tanaka [1988] introduced the strongly structure preserving mapping and gave an algorithm based on this kind mapping. Their algorithm is the same as Lu s algorithm. Yang [1991] gave an algorithm based on a mapping where two nodes in the mapping implies their parents are in the mapping. Edit distance between unordered tree was considered by Zhang, Statman and Shasha [1992] Jiang, Wang and Zhang [1994] considered the tree alignment distance problem. Tree inclusion ....

Yang, W. [1991]. "Identifying syntactic differences between two programs", Software -- Practice and Experience, 21, (7), pp.739-755.

....between P and P 0 , that shows which components in P 0 are new, which components in P have been deleted, which components in P correspond to which components in P 0 , and which, of these corresponding components, have been modified. One such differencing algorithm is proposed by Yang[44]; this algorithm requires time O(jP j jP 0 j) to compute a correspondence between P and P 0 . An O(max(jP j; jP 0 j) 3 ) algorithm is proposed by Laski and Szermer[24] More efficient comparison methods, such as the UNIX 10 diff utility, may not be precise enough for computing ....

W. Yang. Identifying syntactic differences between two programs. Software---Practice and Experience, 21(7):739-- 755, July 1991.

No context found.

Yang, W., Identifying syntactic differences between two programs, Software---Practice and Experience 21(7) pp. 739-755 (July 1991).

No context found.

W. Yang. Identifying syntactic differences between two programs. Softw. Pract. Exper., 21(7):739--755, 1991.

No context found.

YANG W., "Identifying syntactic differences between two programs", Software - Practice and Experience, 21, (7), , 1991, p. 739-755.

No context found.

W. Yang. Identifying syntactic differences between two programs. Software--Practice and Experience, 21(7):739--755, July 1991. 13

No context found.

W. Yang. Identifying syntactic differences between two programs. Software - Practice and Experience, 21, (7), pages 739--755, 1991.

No context found.

Yang, W., "Identifying syntactic differences between two programs," Software - Practice & Experience 21(7) pp. 739-755 (July 1991).

No context found.

Yang92. Yang, W., "Identifying syntactic differences between two programs," to be published in Software---Practice and Experience (1992).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC