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.

All of the papers are related to the research interests of Dr Paige, who died in 1999, and, in particular, to the transformational development of programs and their algorithmic derivation from formal specifications.

His colleagues, who include Olivier Danvy of the University of Aarhus in Denmark, and Alberto Pettorossi of the University of Rome 'Tor Vergata' in Italy, believe the book provides a renewed stimulus for continuing and deepening Dr Paige's research vision.

Prof. Olivier Danvy is editor in chief of the Higher Order for Symbolic Computation journal.

Review of some techniques for automatic program development Applications of program transformation to algorithm derivation Algorithm design methodology based on systematic derivations and applications in computer science and software engineering

Autorentext

Prof. Olivier Danvy is editor in chief of the Higher Order for Symbolic Computation journal, and is also editor for two books in the LNCS series.

This book is written for Dr. Robert (Bob) Paige. Bob Paige, a professor of computer science and a leading researcher in the area of programming languages and transformational programming. Dr. Paige was the author of many research papers, covering related topics in programming languages, compilers, algorithms, and database design. An invited speaker at conferences and university seminars around the world, he also served regularly as a reviewer of research projects for major government agencies. He was a devoted mentor of PhD students who today hold research positions at leading universities and research centers.

Klappentext

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.

Inhalt
Robert Paige's Research: A Retrospective and A Proposal.- Research Retrospective on Transformational Development of Programs.- A National Science Foundation Proposal.- Robert Paige: Brother, Friend, Colleague.- A Song for My Brother.- Robert Paige: Researcher and Teacher.- An Appreciation of Bob Paige.- Bob Paige and the IFIP Working Group 2.1.- Remembrances of Bob Paige.- Contributed Papers.- Transformational Derivation of an Improved Alias Analysis Algorithm.- Dynamic Programming via Static Incrementalization.- Automatic Program Generation from Formal Specifications using APTS.- Universal Regular Path Queries.- Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism.- Computational Divided Differencing and Divided-Difference Arithmetics.- Least Reflexive Points of Relations.- Relativizations for the Logic-Automata Connection.- Efficient Type Matching.- Aspects as Invariants.- Program Transformations: Some Lessons from the 1980s.