Software merge
Author:
Open Access
- 1 November 1994
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 16 (6) , 1875-1903
Abstract
We present a language-independent semantic model of the process of combining changes to programs. This model extends the domains used in denotational semantics (complete partial orders) to Boolean algebras, and represents incompatible modifications as well as compatible extensions. The model is used to define the intended semantics of change-merging operations on programs and to establish some general properties of software merging. We determine conditions under which changes to subprograms of a software system can be merged independently and illustrate cases where this is not possible.Keywords
This publication has 11 references indexed in Scilit:
- Automated merging of software prototypesJournal of Systems Integration, 1994
- Compositional semantics of a real-time prototyping languageIEEE Transactions on Software Engineering, 1993
- Using transformations in specification-based prototypingIEEE Transactions on Software Engineering, 1993
- A graph model for software evolutionIEEE Transactions on Software Engineering, 1990
- Integrating noninterfering versions of programsACM Transactions on Programming Languages and Systems, 1989
- A prototyping language for real-time softwareIEEE Transactions on Software Engineering, 1988
- On merging software extensionsActa Informatica, 1986
- A Couple of Novelties in the Propositional CalculusMathematical Logic Quarterly, 1985
- On Closed Elements in Closure AlgebrasAnnals of Mathematics, 1946
- Partially ordered setsTransactions of the American Mathematical Society, 1937