Verified Solving and Asymptotics of Linear Recurrences
Linear recurrences with constant coefficients are an interesting class of recurrence equations that can be solved explicitly. The most famous example are certainly the Fibonacci numbers with the equation f(n) = f(n-1) + f(n-2) and the quite non-obvious closed form (φ^n - (-φ)^(-n)) / sqrt(5) where φ is the golden ratio. The work presented here builds on existing tools in Isabelle/HOL – such as formal power series and polynomial factorisation algorithms – to develop a theory of these recurrences and derive a fully executable solver for them that can be exported to programming languages like Haskell. Based on this development, I also provide an efficient method to prove ‘Big-O’ asymptotics of a solution automatically without explicitly finding the closed-form solution first.
Tue 15 Jan Times are displayed in time zone: (GMT+01:00) Greenwich Mean Time : Belfast change
|16:00 - 16:30|
Yannick ForsterSaarland University, Dominik KirstSaarland University, Gert SmolkaSaarland UniversityDOI
|16:30 - 17:00|
Manuel EberlTechnische Universität MünchenDOI
|17:00 - 17:30|