Skip to main content

A Comment on the Presentation and Testing of CALGO Codes and a Remark on Algorithm 639: To Integrate Some Infinite Oscillating Tails

Hopkins, Tim (2002) A Comment on the Presentation and Testing of CALGO Codes and a Remark on Algorithm 639: To Integrate Some Infinite Oscillating Tails. ACM Transactions on Mathematical Software, 28 (3). pp. 285-300. ISSN 0098-3500. (doi:10.1145/569147.569148) (KAR id:13723)

Abstract

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.

Note: This is being made available as UKC Technical Report No: 4-02 (March 2002), DOI: http://doi.acm.org/10.1145/569147.569148

Item Type: Article
DOI/Identification number: 10.1145/569147.569148
Uncontrolled keywords: Software Re-engineering; Fortran 95; Testing; Debugging
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 17:59 UTC
Last Modified: 16 Nov 2021 09:51 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/13723 (The current URI for this page, for reference purposes)

University of Kent Author Information

Hopkins, Tim.

Creator's ORCID:
CReDIT Contributor Roles:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.