ACM Home Page
Please provide us with feedback. Feedback
Guiding simulation with increasingly refined abstract traces
Full text PdfPdf (610 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 43rd annual Design Automation Conference table of contents
San Francisco, CA, USA
SESSION: Session 42: simulation assisted formal verification table of contents
Pages: 737 - 742  
Year of Publication: 2006
ISBN:1-59593-381-6
Authors
Kuntal Nanshi  University of Colorado at Boulder
Fabio Somenzi  University of Colorado at Boulder
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 31,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1146909.1147097
What is a DOI?

ABSTRACT

We combine abstraction refinement and simulation to provide a more efficient approach to checking invariant properties whose only counterexamples are very long traces. We allow each transition of an abstract error trace to map to multiple transitions of the concrete error trace and simulate pseudorandom vectors to build segments of the concrete trace. This approach addresses the capacity limitation of the formal verification engine as well as the short-sightedness of the simulator, thus providing a more effective technique for deep, subtle bugs.


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
 
3
 
4
 
5
 
6
Y. Choueka. Theories of automata on Ω-tapes: A simplified approach. J. Comput. Syst. Sci., 8:117--141, 1974.
 
7
 
8
 
9
 
10
11
12
 
13
 
14
URL: http://www.cad.polito.it/tools/itc99.html.
 
15
 
16
B. Li, C. Wang, and F. Somenzi. A satisfiability-based approach to abstraction refinement in model checking. ENTCS, 89(4), BMC 2003.
 
17
K. L. McMillan and N. Amla. Automatic abstraction without counterexamples. In TACAS, pages 2--17, Apr. 2003.
 
18
S. Shyam and V. Bertacco. Guido: Hybrid verification by distance-guided simulation. IWLS 2005.
19
 
20
URL: http://vlsi.colorado.edu/~vis.
 
21
 
22
 
23
24
25


Collaborative Colleagues:
Kuntal Nanshi: colleagues
Fabio Somenzi: colleagues