Towards Increased Productivity of Algorithm Implementation
Boehm, Barry and Notkin, David
This paper reports experimental results that support the feasibility of a new transformational approach developed by the authors for implementing complex algorithms correctly and efficiently. The class of algorithms amenable to our methods includes nonnumerical graph algorithms. Experiments were performed to measure how this approach affects productivity (in terms of the number of source lines in the implementation divided by manual programming time) and running times. Comparative benchmarks showed that productivity can be increased over a conventional ad hoc approach by factors ranging from 5.1 to 9.9 Preliminary results also showed that the running time of C code produced by this new approach can be as fast as 1.5 times that of tightly coded high quality Fortran.
J. Cai and R. Paige, "Towards Increased Productivity of Algorithm Implementation," ACM SIGSOFT Software Engineering Notes, Association for Computing Machinery (ACM), Jan 1993.
The definitive version is available at https://doi.org/10.1145/167049.167067
1st ACM SIGSOFT Symposium on Foundations of Software Engineering
Mathematics and Statistics
Article - Conference proceedings
© 1993 Association for Computing Machinery (ACM), All rights reserved.
01 Jan 1993