ABSTRACT
This paper addresses a rule-based method for VLSI design review, constrained by parasitics. Using the new ideas discussed in this paper, extraction from layout is not limited anymore to conventional electrical data, but additionally allows modelling of functional and timing behaviour. An extendable rule based validation algorithm operates on extracted models, decorated with parasitic effects, to formally prove most aspects of design correctness.
- 1.H. De Man, I. Bolsens, E. Vanden Meersch, J. Van Cleynenbreugel. "DIALOG, An Expert Debugging System for MOS-VLSI Design", IEEE transactions on CAD Vol CAD.4, N3, July 1985Google Scholar
- 2.Bryant, R.E., 1980, An algorithm for MOS Logic Simulation, LAMBDA.Google Scholar
- 3.Jorge Rubinstein, Paul Penfield, Marc Horowitz, 1983, "Signal Delay in RC Tree Networks", 1983 IEEEGoogle Scholar
- 4.R.H. Krambeck, C.M. Lee and H-F.S. Law High Speed Compact Circuits with CMOS IEEE Journal of Solid State circuits, June 1982Google Scholar
- 5.Vos Frank, Tmllemans Charles. A tunable symbolic simu lator. Presented at International Working Conference "The Fusion of Hardware Design and Verification". University of Strathclyde, Glasgow Scotland U.K. July 3-6 1988.Google Scholar
- 6.Matson, Mark D. Macromodelling and optimization of Digital MOS VLSI circuits, February 1985. Department of Electrical F.ngineering and Computer Science, M.I.T., Cambridge~ MA. Private Communication.Google Scholar
- 7.Fletcher, R. and Powell, M. "Arapidty convergent descent method for minimization", Computer Journal, Vol. 6,1963.Google Scholar
- 8.gertsekas, D. "Projected Newton methods for optimization problems with simple constraints", SIAM Journal on Control and Optimization, Vol. 20, 1982.Google Scholar
Index Terms
- Rule-based VLSI verification system constrained by layout parasitics
Comments