Formal Verification of Integer Multipliers by Combining Gröbner Basis With Logic Reduction

doi 10.3850/9783981537079_0248
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Research Publishing Services

Related search

Combining Problem Structure With Basis Reduction to Solve a Class of Hard Integer Programs

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2002English

Fast Gröbner Basis Computation and Polynomial Reduction for Generic Bivariate Ideals

Applicable Algebra in Engineering, Communications and Computing
Applied MathematicsNumber TheoryAlgebra
2019English

Automated Logic-Based Technique for Formal Verification of Security Protocols

Journal of Advances in Computer Networks
2018English

An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming

ORSA Journal on Computing
1993English

Programming by Combining General Logic Programs

Journal of Logic and Computation
ArtsHumanitiesHardwareArchitectureLogicTheoretical Computer ScienceSoftware
1999English

Automatic Verification of Recursive Procedures With One Integer Parameter

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2003English

Formal Verification of Pipelined Processors

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Formal Verification of NTRUEncrypt Scheme

International Journal of Computer Network and Information Security
2016English

Formal Verification by Symbolic Evaluation of Partially-Ordered Trajectories

Formal Methods in System Design
HardwareTheoretical Computer ScienceArchitectureSoftware
1995English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy