Skip to main content

Create and prove equivalence of affine indexing hardware using recurrence relations encoded in scans

Project description

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.

Project details

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.3.tar.gz (9.3 kB view hashes)

Uploaded source

Built Distribution

frail-0.0.3-py3-none-any.whl (12.1 kB view hashes)

Uploaded py3

Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page