{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T01:56:54Z","timestamp":1778723814887,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540205364","type":"print"},{"value":"9783540400189","type":"electronic"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40018-9_18","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:03:20Z","timestamp":1283727800000},"page":"265-282","source":"Crossref","is-referenced-by-count":5,"title":["Rebuilding a Tree from Its Traversals:"],"prefix":"10.1007","author":[{"given":"Shin-Cheng","family":"Mu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Bird","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0167-6423(02)00023-0","volume":"43","author":"S.M. Abramov","year":"2002","unstructured":"Abramov, S.M., Gl\u00fcck, R.: The universal resolving algorithm: inverse computation in a functional language. Science of Computer Programming\u00a043, 193\u2013299 (2002)","journal-title":"Science of Computer Programming"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/3-540-57499-9_15","volume-title":"Formal Program Development","author":"R.C. Backhouse","year":"1993","unstructured":"Backhouse, R.C., Hoogendijk, P.F.: Elements of a relational theory of datatypes. In: M\u00f6ller, B., Schuman, S., Partsch, H. (eds.) Formal Program Development. LNCS, vol.\u00a0755, pp. 7\u201342. Springer, Heidelberg (1993)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-56625-2","volume-title":"Formal Program Development","author":"R.S. Bird","year":"1993","unstructured":"Bird, R.S., de Moor, O.: From dynamic programming to greedy algorithms. In: M\u00f6ller, B., Schuman, S., Partsch, H. (eds.) Formal Program Development. LNCS, vol.\u00a0755, Springer, Heidelberg (1993)"},{"key":"18_CR4","series-title":"International Series in Computer Science","volume-title":"Algebra of Programming","author":"R.S. Bird","year":"1997","unstructured":"Bird, R.S., de Moor, O.: Algebra of Programming. International Series in Computer Science. Prentice Hall, Englewood Cliffs (1997)"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6423(90)90042-C","volume":"15","author":"W. Chen","year":"1990","unstructured":"Chen, W., Udding, J.T.: Program inversion: more than fun! Science of Computer Programming\u00a015, 1\u201313 (1990)","journal-title":"Science of Computer Programming"},{"key":"18_CR6","unstructured":"Dijkstra, E.W.: Program inversion. Technical Report EWD671, Eindhoven University of Technology (1978)"},{"key":"18_CR7","first-page":"37","volume-title":"Formal Development of Programs and Proofs","author":"D. Gries","year":"1990","unstructured":"Gries, D., van de Snepscheut, J.L.: Inorder traversal of a binary tree and its inversion. In: Dijkstra, E.W. (ed.) Formal Development of Programs and Proofs, pp. 37\u201342. Addison Wesley, Reading (1990)"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01185679","volume":"29","author":"P.G. Harrison","year":"1992","unstructured":"Harrison, P.G., Khoshnevisan, H.: On the synthesis of function inverses. Acta Informatica\u00a029, 211\u2013239 (1992)","journal-title":"Acta Informatica"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-45442-X_9","volume-title":"Mathematics of Program Construction","author":"R. Hinze","year":"2002","unstructured":"Hinze, R.: Constructing tournament representations: An exercise in pointwise relational programming. In: Boiten, E.A., M\u00f6ller, B. (eds.) MPC 2002. LNCS, vol.\u00a02386, p. 131. Springer, Heidelberg (2002)"},{"key":"18_CR10","volume-title":"The Art of Computer Programming: Fundamental Algorithms","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming: Fundamental Algorithms, 3rd edn., vol.\u00a01. Addison Wesley, Reading (1997)","edition":"3"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-45499-3_27","volume-title":"Algebraic Methodology and Software Technology","author":"O. Moor de","year":"2000","unstructured":"de Moor, O., Gibbons, J.: Pointwise relational programming. In: Rus, T. (ed.) AMAST 2000. LNCS, vol.\u00a01816, pp. 371\u2013390. Springer, Heidelberg (2000)"},{"key":"18_CR12","unstructured":"Mu, S.-C.: A Calculational Approach to Program Inversion. PhD thesis, Oxford University Computing Laboratory (2003)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/3-540-45442-X_13","volume-title":"Mathematics of Program Construction","author":"S.-C. Mu","year":"2002","unstructured":"Mu, S.-C., Bird, R.S.: Inverting functions as folds. In: Boiten, E.A., M\u00f6ller, B. (eds.) MPC 2002. LNCS, vol.\u00a02386, pp. 209\u2013232. Springer, Heidelberg (2002)"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/3-540-56625-2_19","volume-title":"Mathematics of Program Construction","author":"B. Schoenmakers","year":"1993","unstructured":"Schoenmakers, B.: Inorder traversal of a binary heap and its inversion in optimal time and space. In: Bird, R.S., Woodcock, J.C.P., Morgan, C.C. (eds.) MPC 1992. LNCS, vol.\u00a0669, pp. 291\u2013301. Springer, Heidelberg (1993)"},{"key":"18_CR15","unstructured":"van de Snepscheut, J.L.: Inversion of a recursive tree traversal. Technical Report JAN 171a, California Institute of Technology (May 1991), Available online at \n                    \n                      ftp:\/\/ftp.cs.caltech.edu\/tr\/cs-tr-91-07.ps.Z"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0190(91)90141-4","volume":"37","author":"J. Wright von","year":"1991","unstructured":"von Wright, J.: Program inversion in the refinement calculus. Information Processing Letter\u00a037, 95\u2013100 (1991)","journal-title":"Information Processing Letter"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40018-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:41:33Z","timestamp":1558302093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40018-9_18"}},"subtitle":["A Case Study of Program Inversion"],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540205364","9783540400189"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40018-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}