{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:22:02Z","timestamp":1725456122212},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540100270"},{"type":"electronic","value":"9783540381945"}],"license":[{"start":{"date-parts":[[1980,1,1]],"date-time":"1980-01-01T00:00:00Z","timestamp":315532800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1980]]},"DOI":"10.1007\/bfb0022492","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T00:49:12Z","timestamp":1132706952000},"page":"1-21","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Formal description of programming concepts"],"prefix":"10.1007","author":[{"given":"Dines","family":"Bj\u00f8rner","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"1_CR1","unstructured":"J.R.Abrial: \u201cA Low Level File Handler Design\u201d, Oxford Univ.Comp.Lab.,PRG, April 1980."},{"key":"1_CR2","unstructured":"J.A.Goguen,J.W.Thatcher,E.G.Wagner & J.B.Wright: \u201cAn Initial Algebra Approach to the Specification, Correctness & Implementation of Abstract Data Types\u201d,in \u2018Current Trends in Programming Methodology\u2019 \u201cData Structuring\u201d,ed.R.Yeh,Prentice-Hall,1978."},{"issue":"1","key":"1_CR3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/359046.359057","volume":"22","author":"J.R. Arsac","year":"1979","unstructured":"J.R. Arsac: \u201cSyntactic Source to Source Transforms and Program Manipulation\u201d,CACM, vol.22,No.1,1979,pp 43\u201354.","journal-title":"CACM"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"H. Beki\u0107 & K. Walk: \u201cFormalization of Storage Properties\u201d,in: \u2018Formal Semantics of Algorithmic Languages', ed. E. Engeler, Springer-Verlag, LN in Math., vol.188,1971.","DOI":"10.1007\/BFb0059692"},{"key":"1_CR5","series-title":"IBM Techn.Rpt.","volume-title":"A Formal Definition of a PL\/I Subset","author":"H. Beki\u0107","year":"1974","unstructured":"H. Beki\u0107,D. Bj\u00f8rner,W,Henhapl,C.B. Jones & P. Lucas: \u201cA Formal Definition of a PL\/I Subset\u201d,IBM Techn.Rpt.TR25.139,IBM Vienna Lab.,Austria,1974."},{"key":"1_CR6","unstructured":"D.Bj\u00f8rner: \u201cProgramming Languages:Linguistics & Semantics\u201d,in:European ACM Int'1.Comp.Symp.,North Holland,1977,pp 521\u2013536."},{"key":"1_CR7","unstructured":"\u2014: \u201cProgramming Languages:Formal Development of Interpreters and Compilers\u201d,ibid,pp 1\u201321."},{"key":"1_CR8","unstructured":"\u2014: \u201cThe Vienna Development Method:Software Abstraction & Program Synthesis\u201d, in: \u2018Math.Stud.in Inform.Proc.', eds. E. Blum et al., Springer-Verlag, LNCS 75, 1979."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"\u2014 & C.B.Jones: \u201cThe Vienna Development Method:The Meta-Language\u201d, (eds.),Springer-Verlag,LNCS61,1978. D.Bj\u00f8rner: \u201cProgramming in the Meta-Language \u2014 A Tutorial\u201d pp 24\u2013217,& 'software Abstr.Principles\u2019,pp 337\u2013374.","DOI":"10.1007\/3-540-08766-4_9"},{"key":"1_CR10","unstructured":"\u2014: \u201cThe Systematic Development of a Compiling Algorithm\u201d,in'state of the Art of Compiling\u2019,eds.Amirchahy & Neel,IRIA Publ.,1979."},{"key":"1_CR11","unstructured":"\u2014: \u201cAbstract Software Specifications\u201d (ed.), Springer-Verlag,LNCS 86,1980 \u2014 this volume is referred to below."},{"key":"1_CR12","unstructured":"\u2014 et al.: \u201cA Formal Model of Abstractions & Realizations of IMS\u201d, Techn.Rept.,Comp.Sci.Dept.,Techn.Univ.of Denmark,1979\u20131980."},{"key":"1_CR13","unstructured":"\u2014: \u201cExperiments in Block-Structured GOTO-Modelling:Exits vs.Continuations\u201d, in [Bj\u00f8rner80a], pp 216\u2013247."},{"key":"1_CR14","unstructured":"\u2014: \u201cFormalization of Data Base Models\u201d,in [Bj\u00f8rner80a], pp 144\u2013215."},{"key":"1_CR15","unstructured":"\u2014: \u201cA Multi-Micro-Processor Ring Implementation of a CSP-like Language for Parallel Programming\u201d, Techn.Note,Dept.Comp.Sci.,Techn.Univ. of Denmark,1980 \u2014 see also:[Folkj\u00e6r]."},{"key":"1_CR16","unstructured":"P.Brinch Hansen: \u201cThe Architecture of Concurrent Programs\u201d, Prentice-Hall, 1977."},{"key":"1_CR17","unstructured":"H.Burge: \u201cRecursive Programming Techniques\u201d, 'systems Programming Series', Addison-Wesley,1975."},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"R.Burstall & J.Goguen: \u201cThe Semantics of CLEAR:A Specification Language\u201d, in [Bj\u00f8rner80a],pp 292\u2013232.","DOI":"10.1007\/3-540-10007-5_41"},{"key":"1_CR19","unstructured":"DDC80\/2-3-5:D.Bj\u00f8rner & O.Oest: \u201cThe DDC ADA Compiler Project Development Method\u201d,DDC80\/11:H.H.L\u00f8vengreen et al.: \u201cA Formal Model of ADA Storage\u201d, DDC80\/13:0.Dommergaard: \u201cThe Design,and a Formal Definition,of a Virtual (A-Code) Machine for ADA\u201d,DDC80\/14:O.Oest & J.Storbank: \u201cSystematic Derivation of an A-Code Compiling Algorithm from a Denotational Semantics of ADA\u201d,DDC80\/15:H.H.L\u00f8vengreen & P.Folkj\u00e6r: \u201cFormal Models of ADA Tasking & Tasking Primitives\u201d,1980.DDC:Danish Datamatics Centre,Techn.Univ.Denmark."},{"key":"1_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00264597","volume":"11","author":"J. Darlington","year":"1978","unstructured":"J. Darlington: \u201cA Synthesis of Several Sorting Algorithms\u201d,Acta Informatica, vol.11,pp 1\u201330, 1978.","journal-title":"Acta Informatica"},{"key":"1_CR21","unstructured":"P.Folkj\u00e6r & D.Bj\u00f8rner: \u201cA Formal Model of a Generalized CSP-like Language\u201d,Proc.IFIP80 World Congress,Melbourne,Oct.1980,North-Holland,1980."},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"M.Gordon,R.Milner,C.Wadsworth: \u201cEdinburgh LCF\u201d,Springer-Verlag,LNCS78,1980.","DOI":"10.1007\/3-540-09724-4"},{"key":"1_CR23","unstructured":"P.Henderson: \u201cFunctional Programming:Application & Implementation\u201d,Prentice-Hall Int'l.,1980."},{"key":"1_CR24","unstructured":"P.Haff,D.Bj\u00f8rner et al.: \u201cThe Formal CCITT Definition of CHILL\u201d,to be publ.as CCITT Recommendation Z200,Geneva,Switzerland,1980."},{"key":"1_CR25","unstructured":"A.Hansal: \u201cA Formal Definition of a Relational Data Base System\u201d, IBM UK Sci.Ctr.,Techn.Rpt. UKSC 0080, June 1976."},{"key":"1_CR26","unstructured":"K.W.Hansen: \u201cAbstraction & Realization of SQL\u201d, M.Sc.Thesis,Dept.Comp.Sci., Techn.Univ.Denmark,1979."},{"key":"1_CR27","volume-title":"Some Ideas in Algebraic Semantics","author":"J. Goguen","year":"1978","unstructured":"J. Goguen: \u201cSome Ideas in Algebraic Semantics\u201d,Naropa Inst.,Boulder,Co., UCLA Dept.Comp.Sci.,Los Angeles,Calif.,USA,1978."},{"key":"1_CR28","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: \u201cProof of Correctness of Data Representation\u201d,Acta Informatica, vol.1,pp 271\u2013281,1972.","journal-title":"Acta Informatica"},{"issue":"8","key":"1_CR29","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C.A.R. Hoare","year":"1978","unstructured":"\u2014: \u201cCommunicating Sequential Processes\u201d, CACM, vol.21, Aug.78, no.8, pp 666\u2013677,1978.","journal-title":"CACM"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"C.B.Jones: \u201cDenotational Semantics of GOTO: An Exit Formulation and its relation to Continuations\u201d, in Bj\u00f8rner78',pp 278\u2013304, 1978.","DOI":"10.1007\/3-540-08766-4_11"},{"key":"1_CR31","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF00264020","volume":"11","author":"C.B. Jones","year":"1979","unstructured":"\u2014: \u201cConstructing a Theory of a Data Structure as an Aid to Program Development\u201d,Acta Informatica,vol.11,pp 119\u2013137,1979.","journal-title":"Acta Informatica"},{"key":"1_CR32","unstructured":"\u2014: \u201cSoftware Development: A Rigorous Approach\u201d,Prentice-Hall Int'l., 1980."},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"\u2014: \u201cModels of Programming Language Concepts\u201d,in [Bj\u00f8rner80a],pp 100\u2013143,1980.","DOI":"10.1007\/3-540-10007-5_36"},{"issue":"8","key":"1_CR34","first-page":"424","volume":"22","author":"Kowalski","year":"1978","unstructured":"Kowalski: \u201cAlgorithm = Logic + Control\u201d,CACM,vol.22,no.8,Aug.,pp 424\u2013436, 1978.","journal-title":"CACM"},{"key":"1_CR35","volume-title":"A Formal Specification of PASCAL\/R-A Relational Data Type extension of PASCAL","author":"W. Lamersdorf","year":"1979","unstructured":"W. Lamersdorf & D. Bj\u00f8rner: \u201cA Formal Specification of PASCAL\/R-A Relational Data Type extension of PASCAL\u201d,Techn.Rpt.Depts.Comp.Sci.:Techn.Univ. of Denmark & Hamburg Univ.,Germany,1979."},{"key":"1_CR36","unstructured":"H.H.L\u00f8vengreen: \u201cVarieties of Storage Models\u201d,Techn.Note,Dept.Comp.Sci., Techn.Univ.of Denmark,April 1980."},{"key":"1_CR37","unstructured":"R.Milner: \u201cAlgebraic Concurrency \/ Concurrent Behaviour Language \/ Behaviour Algebra\u201d,Lect.Notes,Dept.Comp.Sci.,\u00c5rhus Univ.,Denmark,Fall 1979, subm. for publ.: Springer-V erlag,LNCS(?),1980(?)."},{"key":"1_CR38","unstructured":"F.L.Bauer & M.Broy (eds.): \u201cProgram Construction\u201d, Springer-Verlag,LNCS 69,1979."},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"M.Sintzhoff: \u201cSuggestions for Composing & Specifying Program Design Decisions\u201d, in \u20184th Int'l.Colloq.on \u201cProgramming\u201d', Springer-Verlag,LNCS83, April 1980, Paris.","DOI":"10.1007\/3-540-09981-6_22"},{"key":"1_CR40","unstructured":"J.E.Stoy: \u201cDenotational Semantics:The Scott-Strachey Approach to Programming Language Theory\u201d,MIT Press,1977."},{"key":"1_CR41","doi-asserted-by":"crossref","unstructured":"\u2014: \u201cFoundations of Denotational Semantics\u201d,in [Bj\u00f8rner80], pp 43\u201399, 1980.","DOI":"10.1007\/3-540-10007-5_35"},{"key":"1_CR42","doi-asserted-by":"crossref","unstructured":"W.Henhapl & C.B.Jones: \u201cA Formal Definition of ALGOL60 as Described in the 1975 Modified Report\u201d,in [Bj\u00f8rner78'],pp 305\u2013336,1978.","DOI":"10.1007\/3-540-08766-4_12"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1980"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022492","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:23:21Z","timestamp":1578525801000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022492"}},"subtitle":["A software engineering viewpoint"],"short-title":[],"issued":{"date-parts":[[1980]]},"ISBN":["9783540100270","9783540381945"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/bfb0022492","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1980]]},"assertion":[{"value":"9 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}