2013 13th International Conference on Computational Science and Its Applications (2011)
June 20, 2011 to June 23, 2011
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICCSA.2011.41
In recent years it has been shown that for many linear algebra operations it is possible to create families of algorithms following a very systematic procedure. We do not refer to the fine tuning of a known algorithm, but to a methodology for the actual generation of both algorithms and routines to solve a given target matrix equation. Although systematic, the methodology relies on complex algebraic manipulations and non-obvious pattern matching, making the procedure challenging to be performed by hand, our goal is the development of a fully automated system that from the sole description of a target equation creates multiple algorithms and routines. We present CL1ck, a symbolic system written in Mathematica, that starts with an equation, decomposes it into multiple equations, and returns a set of loop-invariants for the algorithms -- yet to be generated -- that will solve the equation. In a successive step each loop-invariant is then mapped to its corresponding algorithm and routine. For a large class of equations, the methodology generates known algorithms as well as many previously unknown ones. Most interestingly, the methodology unifies algorithms traditionally developed in isolation. As an example, the five well known algorithms for the LU factorization are for the first time unified under a common root.
Automation, Loop-Invariant, Algorithm Generation, Program Correctness
Diego Fabregat-Traver, Paolo Bientinesi, "Automatic Generation of Loop-Invariants for Matrix Operations", 2013 13th International Conference on Computational Science and Its Applications, vol. 00, no. , pp. 82-92, 2011, doi:10.1109/ICCSA.2011.41