Create and prove equivalence of affine indexing hardware using recurrence relations encoded in scans
Functional Recurrence-based Affine Indexing Language
Express multiple hardware implementations of the same affine indexing generator with recurrence relations. Then prove that the implementations equivalence! A mix of scans (from functional programming) and SMT make this all possible.
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.