Computer Aids for VLSI Design
Steven M. Rubin
Copyright © 1994

Chapter 5: Static Analysis Tools

Section 6 of 6

5.6 Summary

This chapter has illustrated a number of techniques for the data-free examination of VLSI circuits. Such static analyses require a full topological description of the circuit that is often a product of node extraction. Geometric design rules check the layout of a circuit, and electrical rules check the topology. Verification tools check individual specifications to ensure that the design will perform as intended. The next chapter deals with actual performance considerations that can be analyzed by treating a circuit dynamically.


  1. What is the problem with raster-based design-rule checking that does not occur with raster-based node extraction?
  2. How can network-comparison methods fully describe the differences between dissimilar networks?
  3. How would you program a preprocessor to convert design rules into state-based design-rule checking tables?
  4. Why is timing verification more user-intensive than is design-rule checking?
  5. Why is the functional verification of asynchronous circuits so difficult?
  6. Why are rule-based systems an ideal choice for implementation of electrical-rule checkers?
  7. What is the drawback of hierarchical design rule checking?


Prev Previous     Contents Table of Contents     Next Next    
Steven M. Rubin
    Static Free Software SFS