{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:13:03Z","timestamp":1775052783697,"version":"3.50.1"},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"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":7290,"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,8]]},"DOI":"10.1016\/0167-6423(93)90008-d","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:09:22Z","timestamp":1027642162000},"page":"57-90","source":"Crossref","is-referenced-by-count":23,"title":["Towards pointer algebra"],"prefix":"10.1016","volume":"21","author":[{"given":"Bernhard","family":"M\u00f6ller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(93)90008-D_BIB1","article-title":"The Munich Project CIP, Volume I: The Wide Spectrum Language CIP-L","volume":"183","author":"Bauer","year":"1985"},{"key":"10.1016\/0167-6423(93)90008-D_BIB2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1109\/32.21743","article-title":"Formal program construction by transformations\u2014computer-aided, intuition-guided programming","volume":"15","author":"Bauer","year":"1989","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0167-6423(93)90008-D_BIB3","first-page":"137","article-title":"Calculating a garbage collector","volume":"544","author":"Berger","year":"1991"},{"key":"10.1016\/0167-6423(93)90008-D_BIB4","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0167-6423(89)90002-6","article-title":"Calculating with pointers","volume":"12","author":"Bijlsma","year":"1988","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(93)90008-D_BIB5","first-page":"23","article-title":"Some techniques for proving correctness of programs which alter data structures","volume":"7","author":"Burstall","year":"1972"},{"key":"10.1016\/0167-6423(93)90008-D_BIB6","series-title":"A Practical Theory of Programming","author":"Hehner","year":"1993"},{"key":"10.1016\/0167-6423(93)90008-D_BIB7","series-title":"Dissertation","article-title":"Functional programming with partially applicable operators","author":"Horsch","year":"1989"},{"key":"10.1016\/0167-6423(93)90008-D_BIB8","series-title":"Software Development: A Rigorous Approach","author":"Jones","year":"1980"},{"key":"10.1016\/0167-6423(93)90008-D_BIB9","series-title":"Dissertation","article-title":"Modale Logiken von geflechtartigen Datenstrukturen und ihre Kombination mit temporaler Programmlogik","author":"Kausche","year":"1989"},{"key":"10.1016\/0167-6423(93)90008-D_BIB10","first-page":"413","article-title":"Verification of programs with data referencing","author":"Levy","year":"1978","journal-title":"Proceedings Troisi\u00e9me Colloque sur la Programmation"},{"key":"10.1016\/0167-6423(93)90008-D_BIB11","series-title":"Mathematical Theory of Computation","author":"Manna","year":"1974"},{"key":"10.1016\/0167-6423(93)90008-D_BIB12","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0167-6423(88)90026-3","article-title":"Verification of programs that destructively manipulate data","volume":"10","author":"Mason","year":"1988","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(93)90008-D_BIB13","first-page":"373","article-title":"Relations as a program development language","author":"M\u00f6ller","year":"1991"},{"key":"10.1016\/0167-6423(93)90008-D_BIB14","doi-asserted-by":"crossref","unstructured":"B. M\u00f6ller, Algebraic calculation of graph and sorting algorithms, in: Proceedings International Conference on Formal Methods in Programming and Their Applications, Nowosibirsk, Lecture Notes in Computer Science (Springer, Berlin, to appear).","DOI":"10.1007\/BFb0039722"},{"key":"10.1016\/0167-6423(93)90008-D_BIB15","series-title":"Report No. 280","article-title":"Derivation of graph and pointer algorithms","author":"M\u00f6ller","year":"1993"},{"key":"10.1016\/0167-6423(93)90008-D_BIB20","article-title":"Formal program development, Proceedings IFIP TC2\/WG 2.1 State of the Art Seminar, Rio de Janeiro","year":"1992"},{"key":"10.1016\/0167-6423(93)90008-D_BIB16","series-title":"Mathematics of Program Construction","first-page":"250","article-title":"Shorter paths to graph algorithms","volume":"669","author":"M\u00f6ller","year":"1993"},{"key":"10.1016\/0167-6423(93)90008-D_BIB17","series-title":"Informatik und Mathematik","first-page":"381","article-title":"Programming with (finite) mappings","author":"Pepper","year":"1991"},{"key":"10.1016\/0167-6423(93)90008-D_BIB18","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1145\/359104.359110","article-title":"Reasoning about arrays","volume":"22","author":"Reynolds","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(93)90008-D_BIB19","series-title":"Report No. 270","article-title":"Hamiltonian sorting","author":"Russling","year":"1992"},{"key":"10.1016\/0167-6423(93)90008-D_BIB20A","series-title":"Relationen und Graphen","author":"Schmidt","year":"1989"},{"key":"10.1016\/0167-6423(93)90008-D_BIB20B","series-title":"EATCS Monographs on Theoretical computer Science","article-title":"Relations and Graphs. Discrete Mathematics for Computer Science","year":"1993"},{"key":"10.1016\/0167-6423(93)90008-D_BIB21","first-page":"1","article-title":"Analysis of pointer rotation","author":"Suzuki","year":"1980","journal-title":"Conference Records Seventh ACM Symposium on Primciples of Programming Languages"},{"key":"10.1016\/0167-6423(93)90008-D_BIB22","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:016764239390008D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764239390008D?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:55:19Z","timestamp":1555077319000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016764239390008D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["016764239390008D"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(93)90008-d","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}