This work, a tribute to renowned researcher Robert Paige, is a collection of revised papers published in his honor in the Higher-Order and Symbolic Computation Journal in 2003 and 2005. Among them there are two key papers: a retrospective view of his research lines, and a proposal for future studies in the area of the automatic program derivation. The book also includes some papers by members of the IFIP Working Group 2.1 of which Bob was an active member.

In this book the author presents some techniques for exploring trees and graphs. He illustrates the linear search technique and the backtracking technique, and as instances of tree exploration methods he presents various algorithms for parsing subclasses of context-free languages. He also illustrates some tree and graph exploration and manipulation methods by presenting, among others, algorithms for visiting trees, evaluating Boolean expressions, proving propositional formulas, computing paths in graphs, and performing string matching. This book has been used for advanced undergraduate and graduate courses on automata and formal languages, and assumes some prior exposure to the basic notions in that area. Sample programs are presented in Java and Prolog.

Automatic Program Development is a tribute to Robert Paige (1947-1999), our accomplished and respected colleague, and moreover our good friend, whose untimely passing was a loss to our academic and research community. We have collected the revised, updated versions of the papers published in his honor in the Higher-Order and Symbolic Computation Journal in the years 2003 and 2005.

Among them there are two papers by Bob: (i) a retrospective view of his research lines, and (ii) a proposal for future studies in the area of the automatic program derivation. The book also includes some papers by members of the IFIP Working Group 2.1 of which Bob was an active member. All papers are related to some of the research interests of Bob and, in particular, to the transformational development of programs and their algorithmic derivation from formal specifications. Automatic Program Development offers a renewed stimulus for continuing and deepening Bob's research visions.

A familiar touch is given to the book by some pictures kindly provided to us by his wife Nieba, the personal recollections of his brother Gary and some of his colleagues and friends."

This book constitutes the thoroughly refereed post-proceedings of the 11th International Workshop on Logic-Based Program Synthesis and Transformation, LOPSTR 2001, held in Paphos, Cyprus, in November 2001.The 13 revised full papers presented together with an invited paper were carefully selected and improved during two rounds of reviewing and revision. The papers are organized in topical sections on program transformation and equivalence, program verification, program analysis, program development, and program synthesis.

This volume contains lectures and papers delivered at Meta 92, the Third International Workshop on Metaprogramming in Logic, held in Uppsala, Sweden, June 1992. The topics covered include foundations of metaprogramming in logic, proposals for metaprogramming languages, techniques for knowledgerepresentation and belief systems, and program transformation and analysis in logic. Particular topics include belief revision systems, intensionaldeduction, belief systems and metaprogramming, principles of partial deduction, termination in logic programs, semantics of the "vanilla" metainterpreter, a complete resolution method for metaprogramming, semanticsof "demo," hierarchical metalogics, the naming relation in metalevel systems, modules, reflective agents, compiler optimizations, metalogic and object-oriented facilities, parallel logic languages, the use of metaprogramming for legal reasoning, representing objects and inheritance, transformation of normal programs, negation in automatically generated logic programs, reordering of literals in deductive databases, abstract interpretations, and interarguments in constraint logic programs.

In this book the author presents some techniques for exploring trees and graphs. He illustrates the linear search technique and the backtracking technique, and as instances of tree exploration methods he presents various algorithms for parsing subclasses of context-free languages. He also illustrates some tree and graph exploration and manipulation methods by presenting, among others, algorithms for visiting trees, evaluating Boolean expressions, proving propositional formulas, computing paths in graphs, and performing string matching. This book has been used for advanced undergraduate and graduate courses on automata and formal languages, and assumes some prior exposure to the basic notions in that area. Sample programs are presented in Java and Prolog.