Create and prove equivalence of affine indexing hardware using recurrence relations encoded in scans
pip install frail==0.0.3
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.
The Tidelift Subscription provides access to a continuously curated stream of human-researched and maintainer-verified data on open source packages and their licenses, releases, vulnerabilities, and development practices.
Learn more →
Something wrong with this page? Make a suggestion
Export .ABOUT file for this package
Last synced: 2021-02-15 16:34:03 UTC
Login to resync this project