{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:09Z","timestamp":1725663189562},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540100034"},{"type":"electronic","value":"9783540393467"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1980]]},"DOI":"10.1007\/3-540-10003-2_87","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:00:32Z","timestamp":1330189232000},"page":"394-408","source":"Crossref","is-referenced-by-count":2,"title":["Semantics :Algebras,fixed points,axioms"],"prefix":"10.1007","author":[{"given":"Mila E.","family":"Majster-Cederbaum","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"unstructured":"Lucas, P.: Formal Definition of Programming Languages and Systems. IFIP Congress, 71, August 1971.","key":"34_CR1"},{"unstructured":"Lucas, P., P. Lauer, H. Stigleither: Method and Notation for the Formal Definition of Programming Languages. Technical Report TR-250-87. IBM, Vienna Laboratories, 1970.","key":"34_CR2"},{"unstructured":"Lucas, P., K. Walk: On the Formal Definition of PL\/I. Annual Review in Automatic Programming 6. Eds: M. Halpern and C. Shaw. Pergamon Press, 1971.","key":"34_CR3"},{"doi-asserted-by":"crossref","unstructured":"Wegner, P.: The Vienna Definition Language. Computing Surveys 4, 1. March 1972.","key":"34_CR4","DOI":"10.1145\/356596.356598"},{"doi-asserted-by":"crossref","unstructured":"Knuth, D.: Semantics of Context-free Languages. Mathematical Systems Theory 2, 1968.","key":"34_CR5","DOI":"10.1007\/BF01692511"},{"unstructured":"McCarthy, J.: A Formal Definition of a Subset of Algol. Formal Language Description Language for Computer Programming, Proceedings of IFIP Working Conference on Formal Language Description Language. North-Holland Publ., 1966.","key":"34_CR6"},{"unstructured":"Lauer, P.: Consistent and Complementary Formal Definitions of Programming Languages. Techn. Report TR 25-121. IBM, Vienna Laboratory, 1971.","key":"34_CR7"},{"unstructured":"Landin, P.: A Formal Description of Algol 60. Formal Language Description Language for Computer Programming. Proceedings of IFIP Working Conference on Formal Language Description Languages. North-Holland, 1966.","key":"34_CR8"},{"doi-asserted-by":"crossref","unstructured":"Landin, P.: A Lambda-Calculus Approach. Advances in Programming and Nonnumerical Computation. Ed.: L. Fox., Pergamon Press, 1966.","key":"34_CR9","DOI":"10.1016\/B978-0-08-011356-2.50008-2"},{"unstructured":"McCarthy, J.: Towards a Mathematical Theory of Computation. IFIP Congress 1962. North-Holland, 1962.","key":"34_CR10"},{"unstructured":"McCarthy, J.: A Basis for a Mathematical Theory of Computation. Computer Programming and Formal Systems. Eds.: P. Braffort and D. Hirschberg. North-Holland, 1963.","key":"34_CR11"},{"unstructured":"Strachey, C.: Towards Formal Semantics. Formal Language Description Language for Computer Programming. Proceedings of IFIP Working Conference on Formal Language Description Languages. North-Holland, 1966.","key":"34_CR12"},{"unstructured":"Scott, D.: Outline of a Mathematical Theory of Computation. Proceedings of the Fourth Annual Princeton Conference on Information Science and Systems, 1970.","key":"34_CR13"},{"unstructured":"Scott, D.: Continuous Lattices. Technical Monograph PR 6-7, Oxford University, August, 1971.","key":"34_CR14"},{"unstructured":"Scott, D.: Lattice Theory, Data Types and Formal Semantics. NYU Symposium on Formal Semantics. Prentice Hall, 1972.","key":"34_CR15"},{"unstructured":"Scott, D.: C. Strachey: Towards a Mathematical Semantics for Computer Languages. Computers and Automata. Ed.: J. Fox, John Wiley, 1972.","key":"34_CR16"},{"unstructured":"Scott, D.: The Lattice of Flow Diagrams. Semantics of Algorithmic Languages. Ed.: E. Engeler. Springer Notes in Mathematics, vol. 188.","key":"34_CR17"},{"doi-asserted-by":"crossref","unstructured":"Floyd, R.: Assigning Meaning to Programs. Proceedings of Symposia in Applied Mathematics, vol. 19, Mathematical Aspects of Computer Science, 1967.","key":"34_CR18","DOI":"10.1090\/psapm\/019\/0235771"},{"doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R.: An Axiomatic Approach to Computer Programming. CACM 12, 10, October, 1969.","key":"34_CR19","DOI":"10.1145\/363235.363259"},{"key":"34_CR20","first-page":"2","volume":"3","author":"C. A. R. R. Hoare","year":"1974","unstructured":"Hoare, C.A.R., P.E. Lauer: Consistent and Complementary Formal Theories of The Semantics of Programming Languages. Acta Informatica, 3, 2, 1974.","journal-title":"Acta Informatica"},{"key":"34_CR21","volume-title":"A Simple Axiomatic Basis for Programming Language Constructs. EWD 72","author":"E. W. Dijkstra","year":"1973","unstructured":"Dijkstra, E.W.: A Simple Axiomatic Basis for Programming Language Constructs. EWD 72. Technological University, Eindhoven, 1973."},{"doi-asserted-by":"crossref","unstructured":"Goguen, J.A.: Semantics of Computation. Proceedings of the First International Symposium on Category Theory Applied to Computation and Control. Lecture Notes in Computer Science 25. Springer, 1975.","key":"34_CR22","DOI":"10.1007\/3-540-07142-3_75"},{"doi-asserted-by":"crossref","unstructured":"Burstall, R.M.: Proving Properties of Programs by Structural Induction. Computer Journal 12, 1969.","key":"34_CR23","DOI":"10.1093\/comjnl\/12.1.41"},{"unstructured":"Burstall, R.M., P.J. Laudin: Programs and their Proofs: an Algebraic Approach. Machine Intelligence, 4. Edinburgh Press, 1969.","key":"34_CR24"},{"key":"34_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321992.321997","volume":"24","author":"J. A. Goguen","year":"1977","unstructured":"Goguen, J.A., J.W. Thatcher, E.E. Wagner, J.B. Wright: Initial Algebra Semantics and Continuous Algebras. JACM 24, 1 1977.","journal-title":"JACM"},{"key":"34_CR26","volume-title":"Proc. ACM Conference and Proving Assertions about Programs","author":"R. M. Burstall","year":"1972","unstructured":"Burstall, R.M.: An algebraic description of Programs with Assertions, Verification and Simulation. Proc. ACM Conference and Proving Assertions about Programs. Las Cruces, New Mexico, 1972."},{"unstructured":"Reynolds, J.C.: Formal Semantics. Preliminary Draft for COSIRS, 1976.","key":"34_CR27"},{"unstructured":"Chirica, L. D.F. Martin: An Algebraic Formulation of Knuthian Semantics. Proc. 17th Annual IEEE Symposium on Formulations of Computer Science, Houston, Texas, 1978.","key":"34_CR28"},{"doi-asserted-by":"crossref","unstructured":"Cook, S.A.: Soundness and Completeness of an Axiom System for Program Verification. SIAM J. on Computing vol. 7, no. 1, 1978.","key":"34_CR29","DOI":"10.1137\/0207005"},{"unstructured":"Donahue, J.E.: Complementary Definitions of Programming Language Semantics. Springer Lecture Notes in Computer Science, 42, 1976.","key":"34_CR30"},{"doi-asserted-by":"crossref","unstructured":"Majster, M.E.: Data Types, Abstract Data Types and their Specification Problem. Theoretical Computer Science, 8, 1979.","key":"34_CR31","DOI":"10.1016\/0304-3975(79)90059-8"},{"unstructured":"Goguen, J.A., J.W. Thatcher, E.G. Wagner: An Initial Approach to the Specification Correctness and Implementation of Abstract Data Types. Corrent Trends in Programming Methodology, vol. 4, Data Structuring. Ed.: R. Yeh. Prentice Hall, 1978.","key":"34_CR32"},{"unstructured":"Majster, M.E.: A unified view of semantics, Technical Report TR79-394, Cornell University (1979). Also submitted for publication.","key":"34_CR33"},{"key":"34_CR34","first-page":"1","volume":"19","author":"E. M. Clarke","year":"1978","unstructured":"Clarke, E.M.: Program invariants as fixed points, Computing 19, 1, 1978.","journal-title":"Computing"},{"unstructured":"de Bakker, J.W.: Fixed point semantics and Dijkstra's fundamental invariance theorem, Mathematical Centre, January 1975.","key":"34_CR35"},{"doi-asserted-by":"crossref","unstructured":"de Bakker, J.W., Meerteus, L.G.L.: On the completeness of the induction assertion method, Mathematical Centre, December 1975.","key":"34_CR36","DOI":"10.1016\/S0022-0000(75)80056-0"},{"unstructured":"Majster, M.E.: General properties of semantics. Technical Report in preparation.","key":"34_CR37"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10003-2_87.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T01:07:17Z","timestamp":1640912837000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10003-2_87"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980]]},"ISBN":["9783540100034","9783540393467"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/3-540-10003-2_87","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1980]]}}}