A state-of-the-art survey on software merging
Top Cited Papers
- 7 August 2002
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 28 (5) , 449-462
- https://doi.org/10.1109/tse.2002.1000449
Abstract
Software merging is an essential aspect of the maintenance and evolution of large-scale software systems. This paper provides a comprehensive survey and analysis of available merge approaches. Over the years, a wide variety of different merge techniques has been proposed. While initial techniques were purely based on textual merging, more powerful approaches also take the syntax and semantics of the software into account. There is a tendency towards operation-based merging because of its increased expressiveness. Another tendency is to try to define merge techniques that are as general, accurate, scalable, and customizable as possible, so that they can be used in any phase in the software life-cycle and detect as many conflicts as possible. After comparing the possible merge techniques, we suggest a number of important open problems and future research directions.Keywords
This publication has 43 references indexed in Scilit:
- Semantic Diff: a tool for summarizing the effects of modificationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1994
- Operation-based mergingPublished by Association for Computing Machinery (ACM) ,1992
- Heterogeneous configuration management with DSEEPublished by Association for Computing Machinery (ACM) ,1991
- Structure-oriented merging of revisions of software documentsPublished by Association for Computing Machinery (ACM) ,1991
- Change oriented versioning in a software engineering databaseACM SIGSOFT Software Engineering Notes, 1989
- Rcs — a system for version controlSoftware: Practice and Experience, 1985
- Program SlicingIEEE Transactions on Software Engineering, 1984
- Computer-Aided Software Engineering in a distributed workstation environmentPublished by Association for Computing Machinery (ACM) ,1984
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- On Closed Elements in Closure AlgebrasAnnals of Mathematics, 1946