• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
      • Gl
      • Esim
      • Vl2014
      • Sv
      • Fgl
      • Vwsim
      • Vl
        • Syntax
        • Loader
        • Warnings
        • Getting-started
        • Utilities
        • Printer
        • Kit
        • Mlib
          • Scopestack
          • Hid-tools
          • Filtering-by-name
          • Vl-interface-mocktype
          • Stripping-functions
          • Genblob
          • Expr-tools
          • Extract-vl-types
          • Hierarchy
            • Vl-design-toplevel
            • Vl-remove-unnecessary-elements
            • Vl-necessary-elements-transitive
            • Vl-interfacelist-everinstanced
            • Vl-dependent-elements-transitive
            • Vl-necessary-elements-direct
            • Vl-modulelist-everinstanced
            • Vl-dependent-elements-direct
            • Vl-design-deporder-modules
            • Vl-design-check-complete
            • Vl-design-upgraph
            • Immdeps
            • Vl-design-downgraph
              • Vl-collect-dependencies
              • Vl-hierarchy-free
            • Range-tools
            • Finding-by-name
            • Stmt-tools
            • Modnamespace
            • Flat-warnings
            • Reordering-by-name
            • Datatype-tools
            • Syscalls
            • Allexprs
            • Lvalues
            • Port-tools
          • Transforms
        • X86isa
        • Svl
        • Rtl
      • Software-verification
      • Math
      • Testing-utilities
    • Hierarchy

    Vl-design-downgraph

    Graph of downward dependencies. Fast alist.

    Signature
    (vl-design-downgraph x) → graph
    Arguments
    x — Guard (vl-design-p x).
    Returns
    graph — Maps, e.g., modules to submodules.
        Type (vl-depgraph-p graph).

    Definitions and Theorems

    Function: vl-design-downgraph

    (defun vl-design-downgraph (x)
      (declare (xargs :guard (vl-design-p x)))
      (let ((__function__ 'vl-design-downgraph))
        (declare (ignorable __function__))
        (b* (((vl-immdepgraph graph)
              (vl-design-immdeps x)))
          (make-fast-alist graph.deps))))

    Theorem: vl-depgraph-p-of-vl-design-downgraph

    (defthm vl-depgraph-p-of-vl-design-downgraph
      (b* ((graph (vl-design-downgraph x)))
        (vl-depgraph-p graph))
      :rule-classes :rewrite)

    Theorem: alist-values-are-sets-p-of-vl-design-downgraph

    (defthm alist-values-are-sets-p-of-vl-design-downgraph
      (b* ((graph (vl-design-downgraph x)))
        (depgraph::alist-values-are-sets-p graph))
      :rule-classes :rewrite)

    Theorem: vl-design-downgraph-of-vl-design-fix-x

    (defthm vl-design-downgraph-of-vl-design-fix-x
      (equal (vl-design-downgraph (vl-design-fix x))
             (vl-design-downgraph x)))

    Theorem: vl-design-downgraph-vl-design-equiv-congruence-on-x

    (defthm vl-design-downgraph-vl-design-equiv-congruence-on-x
      (implies (vl-design-equiv x x-equiv)
               (equal (vl-design-downgraph x)
                      (vl-design-downgraph x-equiv)))
      :rule-classes :congruence)