On formal specification of maple programs

Authors:
Muhammad Taimoor Khan;Wolfgang Schreiner
Affiliations:
Doktoratskolleg Computational Mathematics, Johannes Kepler University, Linz, Austria;Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria
Venue:
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Year:
2012

Citing 2
Cited 1

Applying "Design by Contract"

Computer
Towards the formal specification and verification of maple programs

CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics

Towards the formal specification and verification of maple programs

CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is an example-based demonstration of our initial results on the formal specification of programs written in the computer algebra language MiniMaple (a substantial subset of Maple with slight extensions). The main goal of this work is to define a verification framework for MiniMaple. Formal specification of MiniMaple programs is rather complex task as it supports non-standard types of objects, e.g. symbols and unevaluated expressions, and additional functions and predicates, e.g. runtime type tests etc. We have used the specification language to specify various computer algebra concepts respective objects of the Maple package DifferenceDifferential developed at our institute.