A Framework for Constrained Functional Verification

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers

Volumn , Issue , 2003, Pages 142-145

  Yuan, Jun ^a   Pixley, Carl ^b   Aziz, Adnan ^c   Albin, Ken ^d  

^a Verplex Systems   (United States)

^b SYNOPSYS INC   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^d MOTOROLA INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DESIGN UNDER VERIFICATION (DUV); MULTIPLE CLOCK DOMAINS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONSTRAINT THEORY; DATABASE SYSTEMS; INDUSTRIAL APPLICATIONS; PROBABILITY; RANDOM PROCESSES; VECTORS;

COMPUTER AIDED DESIGN;

EID: 0346148492     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On the desirability of acyclic database schemes. J. ACM, 30(3):479-513, 1983.
2. T. Bengtsson, A. Martinelli, and E. Dubrova. A Fast Heuristic Algorithm for Disjoint Decomposition of Boolean Functions. Proc. Intl. Workshop on Logic Synthesis, pages 51-55, 2002.
3. V. Bertacco and M. Damiani, The Disjunctive Decomposition of Logic Functions. Proc. Intl. Conf. on Computer-Aided Design, pages 78-82, 1997.
4. D. Bochmann, F. Dresig, and B. Steinbach. A New Decomposition Method for Multilevel Circuit Design. Proc. European Design Automation Conf., pages 374-377, 1991.
5. O. Coudert and J. C. Madre. A Unified Framework for the Formal Verification of Sequential Circuits. In Proc. Intl. Conf. on Computer-Aided Design, pages 126-129, November 1990.
6. E. V. Dubrova, J. C. Muzio, and B. von Stengel. Finding Composition Trees for Multiple-valued Functions. Proceedings of the 27th International Symposium on Multiple-Valued Logic (ISMVL '97), pages 19-26, 1997.
7. G. Gottlob, N. Leone, and F. Scarcello. A comparison of structural csp decomposition methods. IJCAI, 1999.
8. M. Gyssens, P. Jeavons, and D. Cohen. Decomposing Constraint Satisfaction Problems Using Database Techniques. Artificial Intelligence, pages 57-89, 1994.
9. J.H. Kukula and T.R. Shiple. Building circuits from relations. Proc. of the Computer Aided Verification Conf., 2000.
10. C. Pixley. Integrating Model Checking Into the Semiconductor Design Flow. Computer Design 's Electronic Systems journal, pages 67-74, March 1999.
11. S. Regimbai, J-F. Lemire, Y. Savaria, G. Bois, E-M. Aboulhamid, and A. Baron. Applying aspect-oriented programming to hardware verification with e. Proceedings of HDLCON, 2002.
12. N. Robertson and P. D. Seymour. Graph minors, ii. algorithmic aspects of tree-width. Journal of Algorithms, pages 7:309-322, 1986.
13. Karma Shimizu and David Dill. Deriving a simulation input generator and a coverage metric from a formal specification. Proc. of the Design Automation Conf., pages 801-806, June 2002.
14. R. E. Tarjan and M. Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs. SIAM J. Comput., 13(3):566-579, 1984.
15. J. Yuan, A. Aziz, K. Albin, and C. Pixley. Simplifying boolean constraint solving for random simulation-vector generation. Proc. Intl. Conf. on Computer-Aided Design, pages 123-127, 2002.
16. J. Yuan, A. Aziz, K. Albin, and C. Pixley. Constraint synthesis for environment modeling in functional verification. Proc. of the Design Automation Conf., 2003.
17. J. Yuan, K. Shultz, C. Pixley, H. Miller, and A. Aziz. Modeling Design Constraints and Biasing in Simulation Using BDDs. Proc. Intl. Conf. on Computer-Aided Design, pages 584-589, 1999.