• DocumentCode
    2210713
  • Title

    The use of PROLOG for connectivity verification

  • Author

    Papaspyridis, Alexander C.

  • Author_Institution
    Dept. of Electr. Eng., Imperial Coll., London, UK
  • fYear
    1988
  • fDate
    7-9 Jun 1988
  • Firstpage
    1433
  • Abstract
    The authors presents a connectivity verification program called VERCON implemented in PROLOG, that can handle both NMOS and CMOS designs. This system works by extracting the circuit hierarchy from the transistor level description. Verification is achieved when the top-level object is extracted and no redundant objects exist. Since no assumptions are made about the circuit topology, VERCON always works, something never achieved before. Also, problems due to symmetric circuits that plagued conventional approaches are handled automatically by VERCON
  • Keywords
    CMOS integrated circuits; MOS integrated circuits; PROLOG; circuit CAD; CMOS; NMOS; PROLOG; VERCON; circuit hierarchy; circuit topology; connectivity verification; connectivity verification program; redundant objects; symmetric circuits; top-level object; transistor level description; Capacitance; Circuit simulation; Circuit topology; Data mining; Educational institutions; Heuristic algorithms; Iterative algorithms; Layout; Matched filters; Partitioning algorithms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1988., IEEE International Symposium on
  • Conference_Location
    Espoo
  • Type

    conf

  • DOI
    10.1109/ISCAS.1988.15198
  • Filename
    15198