PURRS swMATH ID: 5465 Software Authors: Roberto Bagnara; Andrea Pescetti; Alessandro Zaccagnini; Enea Zaffanella; Tatiana Zolo Description: PURRS (the Parma University’s Recurrence Relation Solver) is a C++ library for the (possibly approximate) solution of recurrence relations. To be more precise, the PURRS will solve: (a) linear constant coefficient recurrence relations of finite order (when the order is 1, parametric coefficients will be allowed); (b) linear recurrence relations of the first order with variable coefficients; (c) systems of linear recurrence relations with constant coefficients; (d) some non-linear recurrence relations of finite order; (e) some linear recurrence relations of infinite order and other generalized recurrences, like those arising from the complexity analysis of algorithms. Homepage: http://www.cs.unipr.it/purrs/ Programming Languages: C++ Keywords: Software Development; Scientific/Engineering; Mathematics; Libraries Related Software: ACE; LoAT; GitHub; z3; StarExec; CiaoPP; Ciao; PPL; FAST; Princess; iRankFinder; Isabelle; HOL; Isabelle/HOL; Aspic; Apron; BoogiePL; net.datastructures; Refal; COSTA Cited in: 9 Publications all top 5 Cited by 18 Authors 4 Albert, Elvira 4 Genaim, Samir 3 Arenas, Puri 3 Frohn, Florian 3 Puebla, Germán 2 Giesl, Jürgen 1 Barnes, Janet 1 Brockschmidt, Marc 1 Chan, Hing-Lun 1 Chapman, Roderick 1 Cook, Andrew W. 1 Ellis, Bill J. 1 Hensel, Jera 1 Ireland, Andrew 1 Masud, Abu Naser 1 Naaf, Matthias 1 Norrish, Michael 1 Zanardini, Damiano Cited in 2 Serials 3 Journal of Automated Reasoning 1 Theoretical Computer Science Cited in 4 Fields 9 Computer science (68-XX) 1 Mathematical logic and foundations (03-XX) 1 Number theory (11-XX) 1 Operations research, mathematical programming (90-XX) Citations by Year