Create and prove equivalence of affine indexing hardware using recurrence relations encoded in scans
Project description
Function 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.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
frail-0.0.1.tar.gz
(2.0 kB
view hashes)
Built Distribution
frail-0.0.1-py3-none-any.whl
(3.2 kB
view hashes)