| Full text | |
| Author(s): |
Marcilio, Gabriel
;
Santos, Luiz C. V.
;
Albertini, Bruno
;
Rigo, Sandro
;
IEEE
Total Authors: 5
|
| Document type: | Journal article |
| Source: | DAC: 2009 46TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, VOLS 1 AND 2; v. N/A, p. 2-pg., 2009-01-01. |
| Abstract | |
Post-partitioning verification has to deal with abstract data, implementation artifacts, and the order of events may not be preserved in the DUV due to the concurrency treatment in the golden model. Existing techniques are limited either by the use of greedy heuristics (jeopardizing verification guarantees) or by black-box approaches (impairing observability). This work proposes a novel white-box technique that overcomes those limitations by casting the problem as an extended bipartite graph matching. By relying on proven properties, solid verification guarantees are provided. Experimental validation was performed upon platforms built around contemporary real-life applications. (AU) | |