Distribution of mathematical software via electronic mail
Communications of the ACM
Algorithm 715: SPECFUN–a portable FORTRAN package of special function routines and test drivers
ACM Transactions on Mathematical Software (TOMS)
Algorithm 639: To integrate some infinite oscillating tails
ACM Transactions on Mathematical Software (TOMS) - The MIT Press scientific computation series
Communications of the ACM
Software unit test coverage and adequacy
ACM Computing Surveys (CSUR)
Self-adapting Fortran 77 machine constants: comment on Algorithm 528
ACM Transactions on Mathematical Software (TOMS)
Algorithm 528: Framework for a Portable Library [Z]
ACM Transactions on Mathematical Software (TOMS)
Renovating the collected algorithms from ACM
ACM Transactions on Mathematical Software (TOMS)
Renovating the collected algorithms from ACM
ACM Transactions on Mathematical Software (TOMS)
Applying software testing metrics to lapack
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
| Hi-index | 0.01 |
We report on a number of coding problems that occur frequently in published CALGO software and are still appearing in new algorithm submissions. Using Algorithm 639 as an extended example, we describe how these types of faults may be almost entirely eliminated using available commercial compilers and software tools. We consider the levels of testing required to instil confidence that code performs reliably. Finally, we look at how the source code may be re-engineered, and thus made more maintainable, by taking account of advances in hardware and language development.