Formalization of an Algorithm for Greedily Computing Associative Aggregations on Sliding Windows

Title:	Formalization of an Algorithm for Greedily Computing Associative Aggregations on Sliding Windows
Authors:	Lukas Heimes, Dmitriy Traytel and Joshua Schneider
Submission date:	2020-04-10
Abstract:	Basin et al.'s sliding window algorithm (SWA) is an algorithm for combining the elements of subsequences of a sequence with an associative operator. It is greedy and minimizes the number of operator applications. We formalize the algorithm and verify its functional correctness. We extend the algorithm with additional operations and provide an alternative interface to the slide operation that does not require the entire input sequence.
BibTeX:	@article{Sliding_Window_Algorithm-AFP, author = {Lukas Heimes and Dmitriy Traytel and Joshua Schneider}, title = {Formalization of an Algorithm for Greedily Computing Associative Aggregations on Sliding Windows}, journal = {Archive of Formal Proofs}, month = apr, year = 2020, note = {\url{http://isa-afp.org/entries/Sliding_Window_Algorithm.html}, Formal proof development}, ISSN = {2150-914x}, }
License:	BSD License
Status: [ok]	This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.