{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:02:54Z","timestamp":1648980174825},"publisher-location":"Berlin, Heidelberg","reference-count":45,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540525134","type":"print"},{"value":"9783540470069","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52513-0_2","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:34:21Z","timestamp":1330205661000},"page":"12-28","source":"Crossref","is-referenced-by-count":6,"title":["An algebraic approach to refinement"],"prefix":"10.1007","author":[{"given":"Joseph A.","family":"Goguen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"2_CR1","unstructured":"Andr\u00e9 Arnold, P. Naudin, and Maurice Nivat. On semantics of nondeterministic recursive program schemes. In Algebraic Methods in Semantics, pages 1\u201333. Cambridge University Press, 1985."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Christoph Beierle and Angelika Voss. Implementation specifications. In Hans-J\u00f6rg Kreowski, editor, Recent Trends in Data Type Specification, volume Informatik-Fachberichte 116, pages 39\u201352. Springer-Verlag, 1985. Selected papers from the Third Workshop on Theory and Applications of Abstract Data Types.","DOI":"10.1007\/978-3-662-09691-8_5"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Jan Bergstra and John Tucker. Characterization of computable data types by means of a finite equational specification method. In Automata, Languages and Programming, Seventh Colloquium, pages 76\u201390. Springer-Verlag, 1980. Lecture Notes in Computer Science, Volume 81.","DOI":"10.1007\/3-540-10003-2_61"},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1017\/S0305004100013463","volume":"31","author":"G. Birkhoff","year":"1935","unstructured":"Garrett Birkhoff. On the structure of abstract algebras. Proceedings of the Cambridge Philosophical Society, 31:433\u2013454, 1935.","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"key":"2_CR5","unstructured":"Rod Burstall and Joseph Goguen. Putting theories together to make specifications. In Raj Reddy, editor, Proceedings, Fifth International Joint Conference on Artificial Intelligence, pages 1045\u20131058. Department of Computer Science, Carnegie-Mellon University, 1977."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Rod Burstall and Joseph Goguen. The semantics of Clear, a specification language. In Dines Bjorner, editor, Proceedings, 1979 Copenhagen Winter School on Abstract Software Specification, pages 292\u2013332. Springer-Verlag, 1980. Lecture Notes in Computer Science, Volume 86; based on unpublished notes handed out at the Symposium on Algebra and Applications, Stefan Banach Center, Warszawa, Poland.","DOI":"10.1007\/3-540-10007-5_41"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Rod Burstall and Joseph Goguen. Algebras, theories and freeness: An introduction for computer scientists. In Manfred Wirsing and Gunther Schmidt, editors, Theoretical Foundations of Programming Methodology, pages 329\u2013350. Reidel, 1982. Proceedings, 1981 Marktoberdorf NATO Summer School, NATO Advanced Study Institute Series, Volume C91.","DOI":"10.1007\/978-94-009-7893-5_11"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Paul M. Cohn. Universal Algebra. Harper and Row, 1965. Revised edition 1980.","DOI":"10.1007\/978-94-009-8399-1"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Bruno Courcelle and Maurice Nivat. The algebraic semantics of recursive program schemes. In Proceedings, Mathematical Foundations of Computer Science. Springer-Verlag, 1978. Lecture Notes in Computer Science, Volume 64.","DOI":"10.1007\/3-540-08921-7_53"},{"key":"2_CR10","volume-title":"The SIMULA 67 common base language. Technical report","author":"O. Dahl","year":"1970","unstructured":"Ole-Johan Dahl, B. Myhrhaug, and Kristen Nygaard. The SIMULA 67 common base language. Technical report, Norwegian Computing Center, Oslo, 1970. Publication S-22."},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Hans-Dieter Ehrich, Amilcar Sernadas, and Christina Sernadas. Objects, object types, and object identification. In Hartmut Ehrig et al., editors, Categorical Methods in Computer Science with Aspects from Topology, pages 142\u2013156. Springer-Verlag, 1989. Lecture Notes in Computer Science, Volume 393.","DOI":"10.1007\/3-540-51722-7_9"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Kokichi Futatsugi, Joseph Goguen, Jean-Pierre Jouannaud, and Jos\u00e9 Meseguer. Principles of OBJ2. In Brian Reid, editor, Proceedings, 12th ACM Symposium on Principles of Programming Languages, pages 52\u201366. Association for Computing Machinery, 1985.","DOI":"10.1145\/318593.318610"},{"key":"2_CR13","unstructured":"Joseph Goguen. Semantics of concurrent interacting objects using sheaf theory. Lecture given at U.K.-Japan Symposium on Computation, Oxford, September 1989; paper in preparation."},{"key":"2_CR14","unstructured":"Joseph Goguen. Types as theories. Lecture given at Symposium on General Topology and Applications, Oxford, June 1989; to appear in proceedings, Oxford University Press."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Joseph Goguen. Mathematical representation of hierarchically organized systems. In E. Attinger, editor, Global Systems Dynamics, pages 112\u2013128. S. Karger, 1971.","DOI":"10.1159\/000389460"},{"key":"2_CR16","unstructured":"Joseph Goguen and Rod Burstall. Institutions: Abstract model theory for specification and programming. Report ECS-LFCS-90-106, Department of Computer Science, University of Edinburgh, January 1990, and submitted for publication 1989; preliminary version in Report CSLI-85-30, Center for the Study of Language and Information, Stanford University, 1985, and a remote ancestor in \u201cIntroducing Institutions,\u201d in Proceedings, Logics of Programming Workshop, Edward Clarke and Dexter Kozen, editors, Springer-Verlag Lecture Notes in Computer Science, Volume 164, pages 221\u2013256, 1984."},{"key":"2_CR17","unstructured":"Joseph Goguen and Rod Burstall. CAT, a system for the structured elaboration of correct programs from structured specifications. Technical Report Technical Report CSL-118, SRI Computer Science Lab, October 1980."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Joseph Goguen, Jean-Pierre Jouannaud, and Jos\u00e9 Meseguer. Operational semantics of order-sorted algebra. In W. Brauer, editor, Proceedings, 1985 International Conference on Automata, Languages and Programming. Springer-Verlag, 1985. Lecture Notes in Computer Science, Volume 194.","DOI":"10.1007\/BFb0015747"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Joseph Goguen and Jos\u00e9 Meseguer. Universal realization, persistent interconnection and implementation of abstract modules. In M. Nielsen and E.M. Schmidt, editors, Proceedings, 9th International Conference on Automata, Languages and Programming, pages 265\u2013281. Springer-Verlag, 1982. Lecture Notes in Computer Science, Volume 140.","DOI":"10.1007\/BFb0012775"},{"issue":"3","key":"2_CR20","first-page":"307","volume":"11","author":"J. Goguen","year":"1985","unstructured":"Joseph Goguen and Jos\u00e9 Meseguer. Completeness of many-sorted equational logic. Houston Journal of Mathematics, 11(3):307\u2013334, 1985. Preliminary versions have appeared in: SIGPLAN Notices, July 1981, Volume 16, Number 7, pages 24\u201337; SRI Computer Science Lab Technical Report CSL-135, May 1982; and Report CSLI-84-15, Center for the Study of Language and Information, Stanford University, September 1984.","journal-title":"Houston Journal of Mathematics"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Joseph Goguen and Jos\u00e9 Meseguer. Eqlog: Equality, types, and generic modules for logic programming. In Douglas DeGroot and Gary Lindstrom, editors, Logic Programming: Functions, Relations and Equations, pages 295\u2013363. Prentice-Hall, 1986. An earlier version appears in Journal of Logic Programming, Volume 1, Number 2, pages 179\u2013210, September 1984.","DOI":"10.1016\/0743-1066(84)90004-9"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Joseph Goguen and Jos\u00e9 Meseguer. Unifying functional, object-oriented and relational programming, with logical semantics. In Bruce Shriver and Peter Wegner, editors, Research Directions in Object-Oriented Programming, pages 417\u2013477. MIT Press, 1987. Preliminary version in SIGPLAN Notices, Volume 21, Number 10, pages 153\u2013162, October 1986.","DOI":"10.1145\/323648.323755"},{"key":"2_CR23","unstructured":"Joseph Goguen and Jos\u00e9 Meseguer. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Technical Report SRI-CSL-89-10, SRI International, Computer Science Lab, July 1989. Given as lecture at Seminar on Types, Carnegie-Mellon University, June 1983; many draft versions exist."},{"key":"2_CR24","unstructured":"Joseph Goguen, James Thatcher, and Eric Wagner. An initial algebra approach to the specification, correctness and implementation of abstract data types. Technical Report RC 6487, IBM T.J. Watson Research Center, October 1976. In Current Trends in Programming Methodology, IV, Raymond Yeh, editor, Prentice-Hall, 1978, pages 80\u2013149."},{"key":"2_CR25","unstructured":"Joseph Goguen, James Thatcher, Eric Wagner, and Jesse Wright. Abstract data types as initial algebras and the correctness of data representations. In Alan Klinger, editor, Computer Graphics, Pattern Recognition and Data Structure, pages 89\u201393. IEEE Press, 1975."},{"issue":"1","key":"2_CR26","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"J. Goguen","year":"1977","unstructured":"Joseph Goguen, James Thatcher, Eric Wagner, and Jesse Wright. Initial algebra semantics and continuous algebras. Journal of the Association for Computing Machinery, 24(1):68\u201395, January 1977. an early version appears as \u201cInitial Algebra Semantics\u201d, with James Thatcher, IBM T.J. Watson Research Center Report RC 4865, May 1974.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"2_CR27","unstructured":"Joseph Goguen and Timothy Winkler. Introducing OBJ3. Technical Report SRI-CSL-88-9, SRI International, Computer Science Lab, August 1988."},{"key":"2_CR28","unstructured":"Robert Goldblatt. Topoi, the Categorial Analysis of Logic. North-Holland, 1979."},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Irene Guessarian. Algebraic Semantics. Springer-Verlag, 1981. Lecture Notes in Computer Science, Volume 99.","DOI":"10.1007\/3-540-10284-1"},{"key":"2_CR30","unstructured":"John Guttag. The Specification and Application to Programming of Abstract Data Types. PhD thesis, University of Toronto, 1975. Computer Science Department, Report CSRG-59."},{"key":"2_CR31","unstructured":"Ian Hayes and Cliff Jones. Specifications are not (necessarily) executable. Technical Report UMCS-89-12-1, University of Manchester, Computer Science Department, December 1989."},{"key":"2_CR32","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF00289507","volume":"1","author":"C.A.R. Hoare","year":"1972","unstructured":"C.A.R. Hoare. Proof of correctness of data representation. Acta Informatica, 1:271\u2013281, 1972.","journal-title":"Acta Informatica"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"C.A.R. Hoare. Communicating sequential processes. Communications of the ACM, pages 666\u2013677, August 1978.","DOI":"10.1145\/359576.359585"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Saunders Mac Lane. Categories for the Working Mathematician. Springer-Verlag, 1971.","DOI":"10.1007\/978-1-4612-9839-7"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Ernest Manes and Michael Arbib. Algebraic Approaches to Program Semantics. Springer-Verlag, 1986.","DOI":"10.1007\/978-1-4612-4962-7"},{"key":"2_CR36","unstructured":"Jos\u00e9 Meseguer and Joseph Goguen. Initiality, induction and computability. In Maurice Nivat and John Reynolds, editors, Algebraic Methods in Semantics, pages 459\u2013541. Cambridge University Press, 1985."},{"key":"2_CR37","unstructured":"Bertrand Meyer. Object-Oriented Software Construction. Prentice-Hall, 1988."},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"Robin Milner. A Calculus of Communicating Systems. Springer-Verlag, 1980. Lecture Notes in Computer Science, Volume 92.","DOI":"10.1007\/3-540-10235-3"},{"key":"2_CR39","unstructured":"Carroll Morgan. Programming from Specifications. Prentice Hall, 1990."},{"key":"2_CR40","doi-asserted-by":"crossref","unstructured":"Peter Mosses. Unified algebras and action semantics. In Proceedings, Symposium on Theoretical Aspects of Computer Science. Springer-Verlag, 1989. Lecture Notes in Computer Science, Volume 349.","DOI":"10.1007\/BFb0028970"},{"key":"2_CR41","doi-asserted-by":"crossref","unstructured":"Peter Mosses. Unified algebras and institutions. Technical Report DAIMI PB-274, Computer Science Department, Aarhus University, 1989.","DOI":"10.7146\/dpb.v18i274.7628"},{"key":"2_CR42","first-page":"255","volume":"15","author":"M. Nivat","year":"1975","unstructured":"Maurice Nivat. On the interpretation of recursive polyadic program schemes. Symposium Mathematica, 15:255\u2013281, 1975.","journal-title":"Symposium Mathematica"},{"key":"2_CR43","first-page":"165","volume":"76","author":"D. Sannella","year":"1988","unstructured":"Donald Sannella and Andrzej Tarlecki. Building specifications in an arbitrary institution. Information and Control, 76:165\u2013210, 1988. Earlier version in Proceedings, International Symposium on the Semantics of Data Types, Lecture Notes in Computer Science, Volume 173, Springer-Verlag, 1985.","journal-title":"Information and Control"},{"key":"2_CR44","unstructured":"J. Michael Spivey. Understanding Z. Cambridge University Press, 1988."},{"key":"2_CR45","unstructured":"Steven Zilles. Abstract specification of data types. Technical Report 119, Computation Structures Group, Massachusetts Institute of Technology, 1974."}],"container-title":["Lecture Notes in Computer Science","VDM '90 VDM and Z \u2014 Formal Methods in Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52513-0_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:24:21Z","timestamp":1605648261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52513-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540525134","9783540470069"],"references-count":45,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-52513-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[1990]]}}}