The Parma Recurrence Relation Solver Credits

Authors

The Parma Recurrence Relation Solver and its documentation have been designed, written, debugged and improved by the following people:

The Parma Recurrencs Relation Solver owes much to several other people and projects and we would like to thank them all:

People using PURRS and telling us about their application and reporting any bugs they find are contributing to the library in a very important way.

Pedro Vasconcelos, supervised by Kevin Hammond, wrote an interface to PURRS for his type and effect system for inferring sizes and costs for functional programs written in Hume. He also provided useful feedback on PURRS and, based on this, we added the capability to solve some multivariate recurrence equations.
Bruny Pitou and Gérard Riviere, supervised by Fred Mesnard and Étienne Payet, produced a version of CASLOG (Complexity Analysis System for LOGic) interfaced to PURRS. This allowed us rectify several problems in the solver's implementation and to better understand the kind of symbolic computation support that complexity analysis of logic programs requires.

This work has been partly supported by the following projects:

University of Parma's FIL scientific research project (ex 60%) ``Pure and Applied Mathematics'';
MURST project ``Abstract Interpretation, Type Systems and Control-Flow Analysis''.
MURST project ``Automatic Aggregate- and Number-Reasoning for Computing: from Decision Algorithms to Constraint Programming with Multisets, Sets, and Maps''.
MIUR project ``Constraint Based Verification of Reactive Systems''.

[Page last updated on January 18, 2013, 09:58:05.]