• Top
  • Documentation
  • Books
  • Recursion-and-induction
  • Boolean-reasoning
  • Debugging
  • Projects
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
    • Gl
    • Esim
    • Vl2014
    • Sv
      • Svex-stvs
      • Svex-fixpoint-decomposition-methodology
      • Sv-versus-esim
      • Svex-decomp
      • Svex-compose-dfs
      • Moddb
      • Svex-compilation
      • Svmods
        • Address
        • Wire
        • Module
        • Lhs
        • Svar-add-namespace
        • Path
        • Design
        • Modinst
        • Lhs-add-namespace
        • Modalist
        • Path-add-namespace
        • Modname->submodnames
        • Name
        • Svex-alist-addr-p
        • Constraintlist-addr-p
        • Svar-map-addr-p
        • Lhspairs-addr-p
        • Assigns-addr-p
        • Modname
        • Lhs-addr-p
        • Lhatom-addr-p
        • Modhier-measure
        • Modhier-list-measure
        • Attributes
        • Modhier-list-measure-aux
        • Modhier-loopfreelist-p
        • Modhier-loopfree-p
      • Svstmt
      • Sv-tutorial
      • Expressions
      • Symbolic-test-vector
      • Vl-to-svex
    • Fgl
    • Vl
    • X86isa
    • Svl
    • Rtl
  • Software-verification
  • Testing-utilities
  • Math

• Svmods

Modname->submodnames

Signature

(modname->submodnames x modalist) → modnames

Arguments

modalist — Guard (modalist-p modalist).

Returns

modnames — Type (modnamelist-p modnames).

Definitions and Theorems

Function: modname->submodnames

(defun modname->submodnames (x modalist)
       (declare (xargs :guard (modalist-p modalist)))
       (let ((__function__ 'modname->submodnames))
            (declare (ignorable __function__))
            (b* ((mod (modalist-lookup x modalist))
                 ((unless mod) nil))
                (modinstlist->modnames (module->insts mod)))))

Theorem: modnamelist-p-of-modname->submodnames

(defthm modnamelist-p-of-modname->submodnames
        (b* ((modnames (modname->submodnames x modalist)))
            (modnamelist-p modnames))
        :rule-classes :rewrite)

Theorem: modname->submodnames-implies-lookup

(defthm modname->submodnames-implies-lookup
        (implies (modname->submodnames x modalist)
                 (modalist-lookup x modalist)))

Theorem: modname->submodnames-of-modalist-fix-modalist

(defthm modname->submodnames-of-modalist-fix-modalist
        (equal (modname->submodnames x (modalist-fix modalist))
               (modname->submodnames x modalist)))

Theorem: modname->submodnames-modalist-equiv-congruence-on-modalist

(defthm modname->submodnames-modalist-equiv-congruence-on-modalist
        (implies (modalist-equiv modalist modalist-equiv)
                 (equal (modname->submodnames x modalist)
                        (modname->submodnames x modalist-equiv)))
        :rule-classes :congruence)