Skip to main content
Conference ProceedingsOPEN ACCESS

Formal methods for extensions to CAS

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1709 1758-1777
DOI: 10.1007/3-540-48118-4_43
3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We demonstrate the use of formal methods tools to provide a semantics for the type hierarchy of the AXIOMcomputer algebra system, and a methodology for Aldor program analysis and verification. We give a case study of abstract specifications of AXIOM primitives, and provide an interface between these abstractions and Aldor code.

Cite

CITATION STYLE

APA

Dunstan, M. N., Kelsey, T., Martin, U., & Linton, S. (1999). Formal methods for extensions to CAS. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1709, pp. 1758–1777). Springer Verlag. https://doi.org/10.1007/3-540-48118-4_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free