Name
Title | ||
|---|---|---|
System level verification of digital signal processing applications based on the polynomial abstraction technique |
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/ICCAD.2005.1560080 | ICCAD |
Keywords | Field | DocType |
data property,system level verification,abstract model,data abstraction,respective polynomial,infinite domain,automatic verification,model checking,better result,polynomial abstraction,digital signal processing application,fundamental theorem,polynomial abstraction technique,sequential circuits,integrated circuit design,polynomials,logic design,digital signal processing,computer and information science | Formal equivalence checking,Abstraction model checking,Digital signal processing,Model checking,Sequential logic,Polynomial,Fundamental theorem of algebra,Computer science,Algorithm,Electronic engineering,Asynchronous circuit | Conference |
ISSN | ISBN | Citations |
1063-6757 | 0-7803-9254-X | 9 |
PageRank | References | Authors |
0.60 | 7 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| T. Raudvere | 1 | 11 | 1.02 |
| A. Singh | 2 | 42 | 8.59 |
| Sander, I. | 3 | 93 | 5.59 |
| A. Jantsch | 4 | 100 | 5.88 |