Verification of Galois field based circuits by formal reasoning based on computational algebraic geometry
DOI10.1007/S10703-014-0206-ZzbMATH Open1303.94146OpenAlexW1984603142MaRDI QIDQ479832FDOQ479832
Authors: Alexey Lvov, Luis A. Lastras-Montaño, Viresh Paruthi, Robert Shadowen, Ali El-Zein, Barry Trager 
Publication date: 5 December 2014
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-014-0206-z
Recommendations
- Formal Approach for Verifying Galois Field Arithmetic Circuits of Higher Degrees
- scientific article; zbMATH DE number 1796154
- Formal Verification of Integer Multiplier Circuits Using Algebraic Reasoning: A Survey
- A formal verification method of error correction code processors over Galois-field arithmetic
- Artificial Intelligence and Symbolic Computation
- scientific article; zbMATH DE number 524110
- On validated computing in algebraic number fields
- Formal verification of n-bit ALU using theorem proving
- Incremental column-wise verification of arithmetic circuits using computer algebra
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Analytic circuit theory (94C05) Decoding (94B35)
Cites Work
Cited In (5)
- An Algebraic Approach for Proving Data Correctness in Arithmetic Data Paths
- Verification, Model Checking, and Abstract Interpretation
- Title not available (Why is that?)
- Verified Erasure Correction in Coq with MathComp and VST
- A formal verification method of error correction code processors over Galois-field arithmetic
Uses Software
This page was built for publication: Verification of Galois field based circuits by formal reasoning based on computational algebraic geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479832)
