Polynomial formal verification: Ensuring correctness under resource constraints
R Drechsler, A Mahzoon - Proceedings of the 41st IEEE/ACM …, 2022 - dl.acm.org
Recently, a lot of effort has been put into develo** formal verification approaches by both
academic and industrial research. In practice, these techniques often give satisfying results …
academic and industrial research. In practice, these techniques often give satisfying results …
Synthesizing specifications
K Park, L D'Antoni, T Reps - Proceedings of the ACM on Programming …, 2023 - dl.acm.org
Every program should be accompanied by a specification that describes important aspects
of the code's behavior, but writing good specifications is often harder than writing the code …
of the code's behavior, but writing good specifications is often harder than writing the code …
RefSCAT: Formal Verification of Logic-Optimized Multipliers via Automated Reference Multiplier Generation and SCA-SAT Synergy
Formally verifying logic-optimized integer multipliers remains a crucial yet insufficiently
addressed problem in both industry and academia, presenting significant verification …
addressed problem in both industry and academia, presenting significant verification …
[PDF][PDF] Divider verification using symbolic computer algebra and delayed don't care optimization
Recent methods based on Symbolic Computer Algebra (SCA) have shown great success in
formal verification of multipliers and–more recently–of dividers as well. In this paper we …
formal verification of multipliers and–more recently–of dividers as well. In this paper we …
[HTML][HTML] Polynomial calculus for optimization
MaxSAT is the problem of finding an assignment satisfying the maximum number of clauses
in a CNF formula. We consider a natural generalization of this problem to generic sets of …
in a CNF formula. We consider a natural generalization of this problem to generic sets of …
Divider verification using symbolic computer algebra and delayed don't care optimization: theory and practical implementation
Recent methods based on Symbolic Computer Algebra (SCA) have shown great success in
formal verification of multipliers and—more recently—of dividers as well. In this paper we …
formal verification of multipliers and—more recently—of dividers as well. In this paper we …
[PDF][PDF] Polynomial Calculus for MaxSAT
MaxSAT is the problem of finding an assignment satisfying the maximum number of clauses
in a CNF formula. We consider a natural generalization of this problem to generic sets of …
in a CNF formula. We consider a natural generalization of this problem to generic sets of …
Extracting Linear Relations from Gr\" obner Bases for Formal Verification of And-Inverter Graphs
D Kaufmann, J Berthomieu - arxiv preprint arxiv:2411.16348, 2024 - arxiv.org
Formal verification techniques based on computer algebra have proven highly effective for
circuit verification. The circuit, given as an and-inverter graph, is encoded as a set of …
circuit verification. The circuit, given as an and-inverter graph, is encoded as a set of …
[PDF][PDF] Symbolic Computer Algebra for Multipliers Revisited-It's All About Orders and Phases
A Konrad, C Scholl - # …, 2024 - library.oapen.org
Using Symbolic Computer Algebra (SCA) enabled a huge progress in formal verification of
arithmetic circuits in recent years. Several different approaches have been proposed …
arithmetic circuits in recent years. Several different approaches have been proposed …
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
Vanishing sums of roots of unity can be seen as a natural generalization of knapsack from
Boolean variables to variables taking values over the roots of unity. We show that these …
Boolean variables to variables taking values over the roots of unity. We show that these …