Towards Efficient Verification of Arithmetic Algorithms over Galois Fields GF(2m)
Abstract elided by the publisher.
Related papers
- Automated Verification of Correctness for Masked Arithmetic Programs CAV 2023
- Fault tolerant high performance computing by a coding approach PPoPP 2005
- The Golem Horn Solver CAV 2023
- On the Hardness of Analyzing Quantum Programs Quantitatively ESOP 2024
- A reflexive tactic for polynomial positivity using numerical solvers and floating-point computations CPP 2017
- Disjunctive Interpolants for Horn-Clause Verification CAV 2013
- A Galois connection calculus for abstract interpretation POPL 2014
- Quantitative Verification of Masked Arithmetic Programs Against Side-Channel Attacks TACAS 2019