Towards verifying nonlinear integer arithmetic

DOI10.1007/978-3-319-63390-9_13zbMath1494.68161arXiv1705.04302OpenAlexW2613484140MaRDI QIDQ2164225

Vincent Liew, P. W. Beame

Publication date: 12 August 2022

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.04302

zbMATH Keywords

SAT solversresolution proofsmultiplier verification

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Complexity of proofs (03F20) Networks and circuits as models of computation; circuit complexity (68Q06) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (3)

Incremental column-wise verification of arithmetic circuits using computer algebra ⋮ Formal Verification of Integer Multiplier Circuits Using Algebraic Reasoning: A Survey ⋮ Verifying Whiley programs with Boogie

This page was built for publication: Towards verifying nonlinear integer arithmetic