| Handling special constructs in symbolic simulation |
| Full text |
Pdf
(109 KB)
|
| Source
|
Annual ACM IEEE Design Automation Conference
archive
Proceedings of the 39th annual Design Automation Conference
table of contents
New Orleans, Louisiana, USA
SESSION: Formal verification
table of contents
Pages: 105 - 110
Year of Publication: 2002
ISBN ~ ISSN:0738-100X , 1-58113-461-4
|
|
Authors
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 13, Citation Count: 2
|
|
|
ABSTRACT
Symbolic simulation is a formal verification technique which combines the flexibility of conventional simulation with powerful symbolic methods. Some constructs, however, which are easy to handle in conventional simulation need special consideration in symbolic simulation. This paper discusses some special constructs that require unique treatment in symbolic simulation such as the symbolic representation of arrays, an efficient This paper discusses some special constructs that are unique to symbolic simulation such as the symbolic representation of arrays, an efficient symbolic method for storing arrayed instances and the handling of symbolic data-dependent delays. We present results which demonstrate the effectiveness of our symbolic array model in the simulation of highly regular structures like FPGAs, memories or cellular automata.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
F. M. Brown. Boolean Reasoning --- The Logic of Boolean Equations. Kluwer Academic Publishers, 1990.
|
 |
3
|
Randal E. Bryant , Derek L. Beatty , Carl-Johan H. Seger, Formal hardware verification by symbolic ternary trajectory evaluation, Proceedings of the 28th conference on ACM/IEEE design automation, p.397-402, June 17-22, 1991, San Francisco, California, United States
[doi> 10.1145/127601.127701]
|
| |
4
|
|
| |
5
|
|
| |
6
|
|
| |
7
|
Innologic Systems: www.innologic-systems.com, 2001.
|
 |
8
|
|
| |
9
|
B. Lin and F. Somenzi. Minimization of symbolic relations. In IEEE/ACM International Conference on Computer-Aided Design (ICCAD), pages 88--91, Nov. 1990.
|
 |
10
|
|
| |
11
|
|
| |
12
|
|
| |
13
|
|
| |
14
|
|
| |
15
|
Xilinx Product Data Sheets, Virtex 2.5V FPGAs: www.xilinx.com.
|
CITED BY 2
|
|
|
|
|
Hong-Zu Chou , I-Hui Lin , Ching-Sung Yang , Kai-Hui Chang , Sy-Yen Kuo, Enhancing bug hunting using high-level symbolic simulation, Proceedings of the 19th ACM Great Lakes symposium on VLSI, May 10-12, 2009, Boston Area, MA, USA
|
|