On Formal Specification of Maple Programs
Khan, Muhammad Taimoor, Schreiner, Wolfgang
–arXiv.org Artificial Intelligence
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.
arXiv.org Artificial Intelligence
Jul-10-2012
- Country:
- North America > United States
- New Jersey > Mercer County
- Princeton (0.04)
- Massachusetts > Middlesex County
- Reading (0.04)
- New Jersey > Mercer County
- Europe
- Norway (0.04)
- Denmark (0.04)
- Poland (0.04)
- Sweden > Västmanland County
- Västerås (0.04)
- Germany > Baden-Württemberg
- Karlsruhe Region > Heidelberg (0.04)
- France > Bourgogne-Franche-Comté
- Austria > Upper Austria
- Linz (0.04)
- Asia > Armenia
- North America > United States
- Genre:
- Research Report (0.64)
- Instructional Material (0.46)
- Technology: