Symbolic analysis of computational algorithms with SYDNA. The paper presents SYDNA (SYmbolic-Driven Numerical Analysis), a computer algebra library dedicated to the analysis and synthesis of numerical algorithms. The system provides a framework for expressing different parts of complex problem solving procedures. Numerical algorithms are specified using a higher-order functor system, which maximizes code reusability. Efficient implementations are generated by fully instantiating the functor at compile-time, optimizing specifications through program transformations and code generation.

References in zbMATH (referenced in 1 article , 1 standard article )

Showing result 1 of 1.
Sorted by year (citations)

  1. Zapotinschi, Radu: Symbolic analysis of computational algorithms with SYDNA (1999)