Abstract
AbstractDigital mathematical libraries assemble the knowledge of years of mathematical research. Numerous disciplines (e.g., physics, engineering, pure and applied mathematics) rely heavily on compendia gathered findings. Likewise, modern research applications rely more and more on computational solutions, which are often calculated and verified by computer algebra systems. Hence, the correctness, accuracy, and reliability of both digital mathematical libraries and computer algebra systems is a crucial attribute for modern research. In this paper, we present a novel approach to verify a digital mathematical library and two computer algebra systems with one another by converting mathematical expressions from one system to the other. We use our previously developed conversion tool (referred to as
"Image missing"
) to translate formulae from the NIST Digital Library of Mathematical Functions to the computer algebra systems and . The contributions of our presented work are as follows: (1) we present the most comprehensive verification of computer algebra systems and digital mathematical libraries with one another; (2) we significantly enhance the performance of the underlying translator in terms of coverage and accuracy; and (3) we provide open access to translations for and of the formulae in the NIST Digital Library of Mathematical Functions.
Publisher
Springer International Publishing
Reference36 articles.
1. Aguirregabiria, J.M., Hernández, A.M., Rivas, M.: Are we careful enough when using computer algebra? Computers in Physics 8(1), 56–61 (1994). https://doi.org/10.1063/1.4823260
2. Barnett, M., Chang, B.Y.E., DeLine, R., Jacobs, B., Leino, K.R.M.: Boogie: A modular reusable verifier for object-oriented programs. In: Formal Methods for Components and Objects, pp. 364–387. Springer Berlin Heidelberg (2006). https://doi.org/10.1007/11804192_17
3. Bertot, Y., Castéran, P.: Interactive Theorem Proving and Program Development - Coq’Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. An EATCS Series, Springer Berlin Heidelberg (2004)
4. Bobot, F., Filliâtre, J.C., Marché, C., Paskevich, A.: Why3: Shepherd your herd of provers. Boogie 2011: First International Workshop on Intermediate Verification Languages pp. 53–64 (5 2011), https://hal.inria.fr/hal-00790310/document
5. Boulmé, S., Hardin, T., Hirschkoff, D., Ménissier-Morain, V., Rioboo, R.: On the way to certify computer algebra systems. Electronic Notes in Theoretical Computer Science 23(3), 370–385 (1999). https://doi.org/10.1016/S1571-0661(05)80609-7, cALCULEMUS 99, Systems for Integrated Computation and Deduction (associated to FLoC’99, the 1999 Federated Logic Conference)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献