• DocumentCode
    1579459
  • Title

    Invariant-Strengthened Elimination of Dependent State Elements

  • Author

    Case, Michael L. ; Mishchenko, Alan ; Brayton, Robert K. ; Baumgartner, Jason ; Mony, Hari

  • Author_Institution
    Dept. of EECS, California Univ., Berkeley, CA
  • fYear
    2008
  • Firstpage
    1
  • Lastpage
    9
  • Abstract
    This work presents a technology-independent synthesis optimization that is effective in reducing the total number of state elements of a design. It works by identifying and eliminating dependent state elements which may be expressed as functions of other registers. For scalability, we rely exclusively on SAT- based analysis in this process. To enable optimal identification of all dependent state elements, we integrate an inductive invariant generation framework. We introduce numerous techniques to heuristically enhance the reduction potential of our method, and experiments confirm that our approach is scalable and is able to reduce state element count by 12% on average in large industrial designs, even after other aggressive optimizations such as min- register retiming have been applied. The method is effective in simplifying later verification efforts.
  • Keywords
    computability; formal verification; SAT-based analysis; dependent state elements; invariant-strengthened elimination; registers; technology-independent synthesis optimization; Algorithm design and analysis; Boolean functions; Computational modeling; Data structures; Design optimization; Induction generators; Law; Legal factors; Logic design; Scalability;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Formal Methods in Computer-Aided Design, 2008. FMCAD '08
  • Conference_Location
    Portland, OR
  • Print_ISBN
    978-1-4244-2735-2
  • Electronic_ISBN
    978-1-4244-2736-9
  • Type

    conf

  • DOI
    10.1109/FMCAD.2008.ECP.6
  • Filename
    4689165