{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T03:05:29Z","timestamp":1648609529847},"reference-count":27,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"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":7351,"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":[[1993,6]]},"DOI":"10.1016\/0167-6423(93)90016-i","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:09:22Z","timestamp":1027656562000},"page":"253-289","source":"Crossref","is-referenced-by-count":1,"title":["On the mathematics of sequential decompositions"],"prefix":"10.1016","volume":"20","author":[{"given":"Jules","family":"Desharnais","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Mili","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fatma","family":"Mili","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(93)90016-I_BIB1","series-title":"Program Construction and Verification","author":"Backhouse","year":"1986"},{"key":"10.1016\/0167-6423(93)90016-I_BIB2","series-title":"XXXVIII Banach Center Semesters on Algebraic Methods in Logic and Their Computer Science Applications","article-title":"Relational Specifications","author":"Berghammer","year":"1992"},{"key":"10.1016\/0167-6423(93)90016-I_BIB3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0304-3975(86)90172-6","article-title":"Relational algebraic semantics of deterministic and nondeterministic programs","volume":"43","author":"Berghammer","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-6423(93)90016-I_BIB4","series-title":"Ph.D. Dissertation","article-title":"Abstract relational semantics","author":"Desharnais","year":"1989"},{"key":"10.1016\/0167-6423(93)90016-I_BIB5","article-title":"Conjugate kernels: an operator for program construction","volume":"113","author":"Desharnais","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-6423(93)90016-I_BIB6","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0167-6423(93)90016-I_BIB7","series-title":"A Method of Programming","author":"Dijkstra","year":"1988"},{"key":"10.1016\/0167-6423(93)90016-I_BIB8","series-title":"The Science of Programming","author":"Gries","year":"1981"},{"key":"10.1016\/0167-6423(93)90016-I_BIB9","series-title":"The Logic of Programming","author":"Hehner","year":"1986"},{"key":"10.1016\/0167-6423(93)90016-I_BIB10","article-title":"A practical theory of programming","author":"Hehner","year":"1991","journal-title":"Private correspondence"},{"key":"10.1016\/0167-6423(93)90016-I_BIB11_1","first-page":"51","article-title":"The weakest prespecification","volume":"IX","author":"Hoare","year":"1986","journal-title":"Fund. Inform."},{"key":"10.1016\/0167-6423(93)90016-I_BIB11_2","first-page":"217","article-title":"The weakest prespecification","volume":"IX","author":"Hoare","year":"1986","journal-title":"Fund. Inform."},{"key":"10.1016\/0167-6423(93)90016-I_BIB12","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0020-0190(87)90106-2","article-title":"The weakest prespecification","volume":"24","author":"Hoare","year":"1987","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/0167-6423(93)90016-I_BIB13","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0304-3975(91)90335-Y","article-title":"Pseudo-invertibility, a measure of regularity of relations","volume":"79","author":"Jaoua","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-6423(93)90016-I_BIB14","series-title":"Systematic Software Development Using VDM","author":"Jones","year":"1986"},{"key":"10.1016\/0167-6423(93)90016-I_BIB15","article-title":"An introduction to the theory of specification and refinement","author":"Josephs","year":"1987","journal-title":"IBM Research Report RC 12993"},{"key":"10.1016\/0167-6423(93)90016-I_BIB16","series-title":"Mathematical Theory of Computation","author":"Manna","year":"1974"},{"key":"10.1016\/0167-6423(93)90016-I_BIB17","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF00264277","article-title":"A relational approach to the design of deterministic programs","volume":"20","author":"Mili","year":"1983","journal-title":"Acta Inform."},{"key":"10.1016\/0167-6423(93)90016-I_BIB18","series-title":"An Introduction to Program Fault Tolerance: A Structured Programming Approach","author":"Mili","year":"1990"},{"issue":"3","key":"10.1016\/0167-6423(93)90016-I_BIB19","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1145\/27632.28054","article-title":"Formal models of stepwise refinement of programs","volume":"18","author":"Mili","year":"1987","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/0167-6423(93)90016-I_BIB20","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF00265990","article-title":"Relational heuristics for the design of deterministic programs","volume":"24","author":"Mili","year":"1987","journal-title":"Acta Inform."},{"key":"10.1016\/0167-6423(93)90016-I_BIB21","author":"Mili","year":"1992","journal-title":"On the construction of programs: a heuristic relational approach"},{"key":"10.1016\/0167-6423(93)90016-I_BIB22","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6423(92)90034-9","article-title":"Heuristics for constructing while loops","volume":"18","author":"Mili","year":"1992","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(93)90016-I_BIB23","series-title":"Constructing Programs from Specifications","author":"Morgan","year":"1990"},{"issue":"1","key":"10.1016\/0167-6423(93)90016-I_BIB24","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0012-365X(85)90064-0","article-title":"Relation algebras: concept of point and representability","volume":"54","author":"Schmidt","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/0167-6423(93)90016-I_BIB25","series-title":"Relationen und Graphen","author":"Schmidt","year":"1989"},{"issue":"3","key":"10.1016\/0167-6423(93)90016-I_BIB26","doi-asserted-by":"crossref","first-page":"73","DOI":"10.2307\/2268577","article-title":"On the calculus of relations","volume":"6","author":"Tarski","year":"1941","journal-title":"J. Symbolic Logic"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764239390016I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764239390016I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T17:55:15Z","timestamp":1555091715000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016764239390016I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["016764239390016I"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(93)90016-i","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}