System level verification of digital signal processing applications based on the polynomial abstraction technique

Authors:
T. Raudvere;A. K. Singh;I. Sander;A. Jantsch
Affiliations:
R. Inst. of Technol., Stockholm, Sweden;R. Inst. of Technol., Stockholm, Sweden;R. Inst. of Technol., Stockholm, Sweden;R. Inst. of Technol., Stockholm, Sweden
Venue:
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Year:
2005

Citing 5
Cited 3

Model checking and abstraction

ACM Transactions on Programming Languages and Systems (TOPLAS)
Polynomial methods for component matching and verification

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
The small model property: how small can it be?

Information and Computation
Combining Symbolic Model Checking with Uninterpreted Functions for Out-of-Order Processor Verification

FMCAD '98 Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design
Automatic Datapath Abstraction In Hardware Systems

Proceedings of the 7th International Conference on Computer Aided Verification

Equivalence verification of arithmetic datapaths with multiple word-length operands

Proceedings of the conference on Design, automation and test in Europe: Proceedings
Simulation bounds for equivalence verification of polynomial datapaths using finite ring algebra

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Formal verification of high-level data-flow synthesis designs using relational modeling and symbolic computation

Integration, the VLSI Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Polynomial abstraction has been developed for data abstraction of sequential circuits, where the functionality can be expressed as polynomials. The method, based on the fundamental theorem of algebra, abstracts a possibly infinite domain of input values, into a much smaller and finite one, whose size is calculated according to the degree of the respective polynomial. The abstract model preserves the system's control and data properties, which can be verified by model checking. Experiments show that our approach does not only allow an automatic verification, but also gives considerably better results than existing methods.