Program Generation, Termination, and Binding-time Analysis (2002)
by
Neil D. Jones
,
Arne J. Glenstrup
| Citations: | 7 - 0 self |
BibTeX
@MISC{Jones02programgeneration,,
author = {Neil D. Jones and Arne J. Glenstrup},
title = {Program Generation, Termination, and Binding-time Analysis},
year = {2002}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Recent research suggests that the goal of fully automatic and reliable program generation for a broad range of applications is coming nearer to feasibility. However, several interesting and challenging problems remain to be solved before it becomes a reality. Solving them is also necessary, if we hope ever to elevate software engineering from its current state (a highly-developed handiwork) into a successful branch of engineering, capable of solving a wide range of new problems by systematic, well-automated and well-founded methods.
