Rebuilding a tree from its traversals: A case study of program inversion

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2895, Issue , 2003, Pages 265-282

  Mu, Shin Cheng ^a   Bird, Richard ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

PREORDERS; PROGRAM INVERSION;

BINARY TREES;

EID: 0345014830     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40018-9_18     Document Type: Article

References (16)

1. S. M. Abramov and R. Glück. The universal resolving algorithm: inverse computation in a functional language. Science of Computer Programming, 43:193-299, 2002.
2. R. C. Backhouse and P. F. Hoogendijk. Elements of a relational theory of datatypes. In B. Möller, H. A. Partsch, and S. A. Schuman, editors, Formal Program Development. Proc. IFIP TC2/WG 2.1 State of the Art Seminar., number 755 in Lecture Notes in Computer Science, pages 7-42. Springer-Verlag, January 1992.
3. R. S. Bird and O. de Moor. From dynamic programming to greedy algorithms. In B. Möller, editor, Procs. State-of-the-Art Seminar on Formal Program Development, number 755 in Lecture Notes in Computer Science. Springer-Verlag, 1993.
4. R. S. Bird and O. de Moor. Algebra of Programming. International Series in Computer Science. Prentice Hall, 1997.
5. W. Chen and J. T. Udding. Program inversion: more than fun! Science of Computer Programming, 15:1-13, 1990.
6. E. W. Dijkstra. Program inversion. Technical Report EWD671, Eindhoven University of Technology, 1978.
7. D. Gries and J. L. van de Snepscheut. Inorder traversal of a binary tree and its inversion. In E. W. Dijkstra, editor, Formal Development of Programs and Proofs, pages 37-42. Addison Wesley, 1990.
8. P. G. Harrison and H. Khoshnevisan. On the synthesis of function inverses. Acta Informatica, 29:211-239, 1992.
9. R. Hinze. Constructing tournament representations: An exercise in pointwise relational programming. In E. Boiten and B. Möller, editors, Sixth International Conference on Mathematics of Program Construction, number 2386 in Lecture Notes in Computer Science, Dagstuhl, Germany, July 2002. Springer-Verlag.
10. D. E. Knuth. The Art of Computer Programming Volume 1: Fundamental Algorithms, 3rd Edition. Addison Wesley, 1997.
11. O. de Moor and J. Gibbons. Pointwise relational programming. In Proceedings of Algebraic Methodology and Software Technology 2000, number 1816 in Lecture Notes in Computer Science, pages 371-390. Springer-Verlag, May 2000.
12. S.-C. Mu. A Calculational Approach to Program Inversion. PhD thesis, Oxford University Computing Laboratory, 2003.
13. S.-C. Mu and R. S. Bird. Inverting functions as folds. In E. Boiten and B. Möller, editors, Sixth International Conference on Mathematics of Program Construction, number 2386 in Lecture Notes in Computer Science, pages 209-232. Springer-Verlag, July 2002.
14. B. Schoenmakers. Inorder traversal of a binary heap and its inversion in optimal time and space. In Mathematics of Program Construction 1992, number 669 in Lecture Notes in Computer Science, pages 291-301. Springer-Verlag, 1993.
15. J. L. van de Snepscheut. Inversion of a recursive tree traversal. Technical Report JAN 171a, California Institute of Technology, May 1991. Available online at ftp://ftp.cs.caltech.edu/tr/cs-tr-91-07.ps.Z.
16. J. von Wright. Program inversion in the refinement calculus. Information Processing Letters, 37:95-100, 1991.