Identifying the semantic and textual differences between two versions of a program
- 1 June 1990
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 25 (6), 234-245
- https://doi.org/10.1145/93548.93574
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Efficient comparison of program slicesActa Informatica, 1991
- Simple Fast Algorithms for the Editing Distance between Trees and Related ProblemsSIAM Journal on Computing, 1989
- Integrating noninterfering versions of programsACM Transactions on Programming Languages and Systems, 1989
- The program dependence graph and its use in optimizationACM Transactions on Programming Languages and Systems, 1987
- The string-to-string correction problem with block movesACM Transactions on Computer Systems, 1984
- A longest common subsequence algorithm suitable for similar text stringsActa Informatica, 1982
- The Tree-to-Tree Correction ProblemJournal of the ACM, 1979
- The tree-to-tree editing problemInformation Processing Letters, 1977
- The String-to-String Correction ProblemJournal of the ACM, 1974
- Matching Sequences under Deletion/Insertion ConstraintsProceedings of the National Academy of Sciences of the United States of America, 1972