Skip to main content
Log in

Verification of Year 2000 conversion rules using the ACL2 theorem prover

  • Special section an theorem proving
  • Published:
International Journal on Software Tools for Technology Transfer Aims and scope Submit manuscript

Abstract.

The well-publicized Year 2000 problem provides interesting challenges for the remediation of noncompliant code. This paper describes some work done at EDS CIO Services, using the ACL2 theorem prover to formally verify correctness of remediation rules. The rules take into account the possibility of “flag” (non-date) values of date variables. Many of them have been implemented in an in-house tool, COGEN 2000TM, that corrects for noncompliant date-related logic in COBOL programs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kaufmann, M. Verification of Year 2000 conversion rules using the ACL2 theorem prover. STTT 3, 13–19 (2000). https://doi.org/10.1007/PL00010807

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00010807

Navigation