Given the inorder and preorder traversal of a binary tree whose labels are all distinct, one can reconstruct the tree. This article examines two existing algorithms for rebuilding ...
We present a method for automatic program inversion in a first-order functional programming language. We formalize the transformation and illustrate it with several examples inclu...
We describe origami programming methodology based on constraint functional logic programming. The basic operations of origami are reduced to solving systems of equations which desc...
This paper studies the problem of resource availability in the context of mobile code for embedded systems such as smart cards. It presents an architecture dedicated to controlling...
Abstract. Much work has been done in verifying a compiler specification, both in hand-written and mechanical proofs. However, there is still a gap between a correct compiler specif...