Skip to main content
SpringerLink
Log in

On merging software extensions

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

The problem of combining independent updates to a program is examined in the context of applicative programs. A partial semantic merge rule is given together with the conditions under which it is guaranteed to be correct, and the conditions under which a string merge corresponds to a semantic merge are examined. The theoretical work reported here contains initial steps towards a solution of the software merging problem and is not sufficient for producing a practical system.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Goldstein, I.P., Bobrow, D.G.: Descriptions for a Programming Environment. Proc. Conf. of the National Association for Artificial Intelligence, 187–189 (1980)

  2. Rochkind, M.J.: The Source Code Control System. IEEE Trans. Software Eng. SE-1, 364–370 (1975)

    Google Scholar 

  3. Ivie, E.L.: The Programmer's Workbench — A Machine for Software Development. CACM 20, 746–753 (1977)

    Google Scholar 

  4. Tichy, W.F.: Design, Implementation, and Evaluation of a Revision Control System. Proc. of the 6th Int. Conf. on Software Engineering, IEEE, 58–67 (1982)

  5. Scott, D.: The Lattice of Flow Diagrams. Technical Monograph PRG-3, Oxford University 1970

  6. Moriconi, M.S.: A Designer/Verifier's Assistant. IEEE Trans. Software Eng. SE-5, 387–401 (1979)

    Google Scholar 

  7. Scott, D.: Data Types as Lattices. SIAM J. Comput. 5, 522–587 (1976)

    Google Scholar 

  8. Stoy, J.: Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. Cambridge: MIT Press 1977

    Google Scholar 

  9. Milne, R., Strachey, C.: A Theory of Programming Language Semantics. Sommerset, NJ: Halstead Press 1976

    Google Scholar 

  10. Birkhoff, G., Lipson, J.D.: Heterogeneous Algebras. J. Comb. Theory 8, 115–133 (1970)

    Google Scholar 

  11. McCarthy, J.: A Basis for a Mathematical Theory of Computation. Computer Programming and Formal Systems. Amsterdam, London: North Holland 1963

    Google Scholar 

  12. Manna, Z., Ness, S., Vuillemin, J.: Inductive Methods for Proving Properties of Programs. CACM 16, 491–502 (1973)

    Google Scholar 

  13. Knuth, D.E., Bendix, P.B.: Simple Word Problems in Universal Algebras. Computational Problems in Abstract Algebra, pp. 263–297. New York: Pergamon Press 1970

    Google Scholar 

  14. Huet, G.: A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm. J. Comput. Syst. Sci. 23, 11–21 (1981)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Minnesota, 55455, Minneapolis, MN, USA

    Valdis Berzins

Authors
  1. Valdis Berzins
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Berzins, V. On merging software extensions. Acta Informatica 23, 607–619 (1986). https://doi.org/10.1007/BF00264309

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00264309

Keywords

Search

Navigation