{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T07:54:42Z","timestamp":1757577282315},"reference-count":30,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,12,1]],"date-time":"1983-12-01T00:00:00Z","timestamp":439084800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10821,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1983,12]]},"DOI":"10.1016\/0167-6423(83)90022-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:09:22Z","timestamp":1027642162000},"page":"279-311","source":"Crossref","is-referenced-by-count":10,"title":["A structured approach to static semantics correctness"],"prefix":"10.1016","volume":"3","author":[{"given":"R.","family":"Barbuti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Martelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(83)90022-9_BIB1","series-title":"Reference Manual for the ADA Programming Language\u2014Proposed Standard Document","year":"1980"},{"key":"10.1016\/0167-6423(83)90022-9_BIB2","series-title":"Formal Definition of the ADA Programming Language","year":"1980"},{"key":"10.1016\/0167-6423(83)90022-9_BIB3","series-title":"Proc. International Symposium on Programming","first-page":"1","article-title":"Static type checking for languages with parametric types and polymorphic procedures","volume":"83","author":"Barbuti","year":"1980"},{"key":"10.1016\/0167-6423(83)90022-9_BIB4","series-title":"Information Processing 83","first-page":"457","article-title":"A constructive approach to static verification of program properties","author":"Barbuti","year":"1983"},{"key":"10.1016\/0167-6423(83)90022-9_BIB5","article-title":"Programming environments: Deriving language dependent tools from structured denotational semantics","author":"Barbuti","year":"1983","journal-title":"Proc. 7th International Computing Symposium"},{"key":"10.1016\/0167-6423(83)90022-9_BIB6","series-title":"Towards a Formal Description of ADA","volume":"98","year":"1980"},{"issue":"1","key":"10.1016\/0167-6423(83)90022-9_BIB7","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1145\/357062.357069","article-title":"A hierarchical approach to formal semantics with application to the definition of PL\/CS","volume":"1","author":"Constable","year":"1979","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0167-6423(83)90022-9_BIB8","series-title":"Proc. International Symposium on Programming","first-page":"108","article-title":"Static determination of dynamic properties of programs","author":"Cousot","year":"1976"},{"key":"10.1016\/0167-6423(83)90022-9_BIB9","first-page":"12","article-title":"Data types, parameters and type checking","author":"Demers","year":"1980","journal-title":"Proc. Principles of Programming Languages"},{"key":"10.1016\/0167-6423(83)90022-9_BIB10","series-title":"Proc. International Symposium on Programming","first-page":"315","article-title":"Utilization de la semantique denotationelle pour la description d'interpretations Non-Standard: application \u00e0 la validation et a l'optimization des programmes","author":"Donzeau-Gouge","year":"1978"},{"key":"10.1016\/0167-6423(83)90022-9_BIB11","series-title":"Proc. International Symposium on Programming","first-page":"292","article-title":"Une method de verification statique de types. Application au language Pascal","author":"Ermine","year":"1978"},{"key":"10.1016\/0167-6423(83)90022-9_BIB12","series-title":"The Denotational Description of Programming Languages","author":"Gordon","year":"1979"},{"key":"10.1016\/0167-6423(83)90022-9_BIB13","article-title":"Edinburgh LCF","volume":"78","author":"Gordon","year":"1979"},{"key":"10.1016\/0167-6423(83)90022-9_BIB14","series-title":"Proc. Formalization of Programming Concepts","first-page":"292","article-title":"Algebraic denotational semantics using parameterized abstract modules","volume":"107","author":"Goguen","year":"1981"},{"key":"10.1016\/0167-6423(83)90022-9_BIB15","series-title":"Information Processing 77","first-page":"523","article-title":"An approach to compile time type checking","author":"Henderson","year":"1977"},{"issue":"11","key":"10.1016\/0167-6423(83)90022-9_BIB16","doi-asserted-by":"crossref","first-page":"956","DOI":"10.1145\/355606.361876","article-title":"A model for type checking; with an application for ALGOL60","volume":"15","author":"Ledgard","year":"1972","journal-title":"Comm. ACM"},{"issue":"8","key":"10.1016\/0167-6423(83)90022-9_BIB17","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1145\/359763.359789","article-title":"Abstraction mechanisms in CLU","volume":"20","author":"Liscov","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(83)90022-9_BIB18_1","series-title":"Thesis","article-title":"The formal semantics of computer languages and their implementations","author":"Milne","year":"1974"},{"key":"10.1016\/0167-6423(83)90022-9_BIB18_2","series-title":"Technical Microfiche PRG-13","year":"1974"},{"key":"10.1016\/0167-6423(83)90022-9_BIB19","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","article-title":"A theory of type polymorphism in programming","volume":"17","author":"Milner","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0167-6423(83)90022-9_BIB20","series-title":"DAIMI MD-30","article-title":"SIS\u2014Semantics Implementation System, Reference Manual and User Guide","author":"Mosses","year":"1979"},{"key":"10.1016\/0167-6423(83)90022-9_BIB21","series-title":"Proc. International Colloquium on Automata, Languages and Programming","first-page":"449","article-title":"A constructive approach to compiler correctness","volume":"85","author":"Mosses","year":"1980"},{"key":"10.1016\/0167-6423(83)90022-9_BIB22","series-title":"Proc. Formal Description of Semantic Concepts II. IFIP TC-2 Working Conference","first-page":"63","article-title":"Abstract semantic algebras","author":"Mosses","year":"1982"},{"key":"10.1016\/0167-6423(83)90022-9_BIB23","series-title":"Proc. 2nd International Colloquium on Automata, Languages and Programming","first-page":"141","article-title":"On the relation between direct and continuation semantics","author":"Reynolds","year":"1974"},{"issue":"1","key":"10.1016\/0167-6423(83)90022-9_BIB24","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1145\/942578.807086","article-title":"Calculating properties of programs by valuations on specific models","volume":"7","author":"Sintzoff","year":"1972","journal-title":"SIGPLAN Notices"},{"issue":"3","key":"10.1016\/0167-6423(83)90022-9_BIB25","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","article-title":"Data types as lattices","volume":"5","author":"Scott","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6423(83)90022-9_BIB26","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0022-0000(78)90048-X","article-title":"Power domains","volume":"16","author":"Smyth","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0167-6423(83)90022-9_BIB27","series-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory","author":"Stoy","year":"1977"},{"key":"10.1016\/0167-6423(83)90022-9_BIB28","doi-asserted-by":"crossref","unstructured":"J.W. Thatcher, E.G. Wagner, J.B. Wright, More on advice on structuring compilers and proving them correct, Theoret. Comput. Sci. 15 (3) 223-249.","DOI":"10.1016\/0304-3975(81)90080-3"},{"key":"10.1016\/0167-6423(83)90022-9_BIB29","series-title":"An informal definition of Alphard","year":"1978"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642383900229?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642383900229?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:50:13Z","timestamp":1555077013000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642383900229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,12]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,12]]}},"alternative-id":["0167642383900229"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(83)90022-9","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1983,12]]}}}