@article{Pettorossi:1982vv,
    Abstract = {Using the program transformation technique we derive some algorithms for evaluating linear recurrence relations in logarithmic time. The particular case of the Fibonacci function is first considered and a comparison with the conventional matrix exponentiation algorithm is made. This comparison allows us also to contrast the transformation technique and the stepwise refinement technique underlining some interesting features of the former one. Through the examples given we also explain why those features are interesting for a useful and reliable program construction methodology.},
    Author = {Pettorossi, A. and Burstall, R. M.},
    File = {Deriving very Efficient Algorithms for Evaluating Linear Recurrence Relations Using the Program Transformation Technique - Pettorossi-Burstall1982\_Article\_DerivingVeryEfficientAlgorithm - v - v.pdf},
    ISBN = {1432-0525},
    Journal = {Acta Informatica},
    Number = {2},
    Pages = {181--206},
    Title = {Deriving very efficient algorithms for evaluating linear recurrence relations using the program transformation technique},
    URL = {https://doi.org/10.1007/BF00264438},
    Volume = {18},
    Year = {1982},
    bdsk-url-1 = {https://doi.org/10.1007/BF00264438},
    da = {1982/11/01},
    date-added = {2021-03-28 09:16:45 +0200},
    date-modified = {2021-03-28 09:16:45 +0200},
    id = {Pettorossi1982},
    ty = {JOUR},
    doi = {10.1007/BF00264438}
}

@article{Pettorossi:1982vv, Abstract = {Using the program transformation technique we derive some algorithms for evaluating linear recurrence relations in logarithmic time. The particular case of the Fibonacci function is first considered and a comparison with the conventional matrix exponentiation algorithm is made. This comparison allows us also to contrast the transformation technique and the stepwise refinement technique underlining some interesting features of the former one. Through the examples given we also explain why those features are interesting for a useful and reliable program construction methodology.}, Author = {Pettorossi, A. and Burstall, R. M.}, File = {Deriving very Efficient Algorithms for Evaluating Linear Recurrence Relations Using the Program Transformation Technique - Pettorossi-Burstall1982_Article_DerivingVeryEfficientAlgorithm - v - v.pdf}, ISBN = {1432-0525}, Journal = {Acta Informatica}, Number = {2}, Pages = {181--206}, Title = {Deriving very efficient algorithms for evaluating linear recurrence relations using the program transformation technique}, URL = {https://doi.org/10.1007/BF00264438}, Volume = {18}, Year = {1982}, bdsk-url-1 = {https://doi.org/10.1007/BF00264438}, da = {1982/11/01}, date-added = {2021-03-28 09:16:45 +0200}, date-modified = {2021-03-28 09:16:45 +0200}, id = {Pettorossi1982}, ty = {JOUR}, doi = {10.1007/BF00264438} }