{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T18:31:46Z","timestamp":1693852306910},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1986,11,1]],"date-time":"1986-11-01T00:00:00Z","timestamp":531187200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1986,11]]},"DOI":"10.1007\/bf00264309","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T06:07:21Z","timestamp":1096438041000},"page":"607-619","source":"Crossref","is-referenced-by-count":34,"title":["On merging software extensions"],"prefix":"10.1007","volume":"23","author":[{"given":"Valdis","family":"Berzins","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Goldstein, I.P., Bobrow, D.G.: Descriptions for a Programming Environment. Proc. Conf. of the National Association for Artificial Intelligence, 187?189 (1980)"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1109\/TSE.1975.6312866","volume":"SE-1","author":"M.J. Rochkind","year":"1975","unstructured":"Rochkind, M.J.: The Source Code Control System. IEEE Trans. Software Eng. SE-1, 364?370 (1975)","journal-title":"IEEE Trans. Software Eng."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1145\/359842.359856","volume":"20","author":"E.L. Ivie","year":"1977","unstructured":"Ivie, E.L.: The Programmer's Workbench ? A Machine for Software Development. CACM 20, 746?753 (1977)","journal-title":"CACM"},{"key":"CR4","unstructured":"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)"},{"key":"CR5","unstructured":"Scott, D.: The Lattice of Flow Diagrams. Technical Monograph PRG-3, Oxford University 1970"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1109\/TSE.1979.234206","volume":"SE-5","author":"M.S. Moriconi","year":"1979","unstructured":"Moriconi, M.S.: A Designer\/Verifier's Assistant. IEEE Trans. Software Eng. SE-5, 387?401 (1979)","journal-title":"IEEE Trans. Software Eng."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"D. Scott","year":"1976","unstructured":"Scott, D.: Data Types as Lattices. SIAM J. Comput. 5, 522?587 (1976)","journal-title":"SIAM J. Comput."},{"key":"CR8","volume-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory","author":"J. Stoy","year":"1977","unstructured":"Stoy, J.: Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. Cambridge: MIT Press 1977"},{"key":"CR9","volume-title":"A Theory of Programming Language Semantics","author":"R. Milne","year":"1976","unstructured":"Milne, R., Strachey, C.: A Theory of Programming Language Semantics. Sommerset, NJ: Halstead Press 1976"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0021-9800(70)80014-X","volume":"8","author":"G. Birkhoff","year":"1970","unstructured":"Birkhoff, G., Lipson, J.D.: Heterogeneous Algebras. J. Comb. Theory 8, 115?133 (1970)","journal-title":"J. Comb. Theory"},{"key":"CR11","volume-title":"A Basis for a Mathematical Theory of Computation. Computer Programming and Formal Systems","author":"J. McCarthy","year":"1963","unstructured":"McCarthy, J.: A Basis for a Mathematical Theory of Computation. Computer Programming and Formal Systems. Amsterdam, London: North Holland 1963"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1145\/355609.362336","volume":"16","author":"Z. Manna","year":"1973","unstructured":"Manna, Z., Ness, S., Vuillemin, J.: Inductive Methods for Proving Properties of Programs. CACM 16, 491?502 (1973)","journal-title":"CACM"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/B978-0-08-012975-4.50028-X","volume-title":"Simple Word Problems in Universal Algebras. Computational Problems in Abstract Algebra","author":"D.E. Knuth","year":"1970","unstructured":"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"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0022-0000(81)90002-7","volume":"23","author":"G. Huet","year":"1981","unstructured":"Huet, G.: A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm. J. Comput. Syst. Sci. 23, 11?21 (1981)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264309.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00264309\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264309","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T17:14:46Z","timestamp":1554311686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00264309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,11]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1986,11]]}},"alternative-id":["BF00264309"],"URL":"https:\/\/doi.org\/10.1007\/bf00264309","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,11]]}}}