• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
  • Debugging
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
    • Gl
    • Esim
    • Vl2014
      • Warnings
      • Primitives
      • Use-set
      • Syntax
      • Getting-started
      • Utilities
      • Loader
      • Transforms
        • Expression-sizing
        • Occform
        • Oprewrite
        • Expand-functions
        • Delayredux
        • Unparameterization
        • Caseelim
        • Split
        • Selresolve
        • Weirdint-elim
        • Vl-delta
        • Replicate-insts
        • Rangeresolve
        • Propagate
          • Vl-modulelist-propagate
          • Too-hard-to-propagate
          • Vl-maybe-driven-by-modinsts
          • Vl-maybe-driven-by-gateinsts
          • Vl-driven-by-assigns
          • Propagate-limits-p
          • Vl-maybe-driven-by-args
          • Candidates-for-propagation
          • Remove-simple-assigns-to
          • Propagation-sigma
          • Vl-propagation-round
          • Vl-propagation-fixpoint
          • Vl-maybe-driven-by-modinst
          • Vl-maybe-driven-by-gateinst
          • Vl-module-propagate
          • Propagate-expr-limits-okp
          • Vl-driven-by-assign
          • Vl-design-propagate
        • Clean-selects
        • Clean-params
        • Blankargs
        • Inline-mods
        • Expr-simp
        • Trunc
        • Always-top
        • Gatesplit
        • Gate-elim
        • Expression-optimization
        • Elim-supplies
        • Wildelim
        • Drop-blankports
        • Clean-warnings
        • Addinstnames
        • Custom-transform-hooks
        • Annotate
        • Latchcode
        • Elim-unused-vars
        • Problem-modules
      • Lint
      • Mlib
      • Server
      • Kit
      • Printer
      • Esim-vl
      • Well-formedness
    • Sv
    • Vwsim
    • Fgl
    • Vl
    • X86isa
    • Svl
    • Rtl
  • Software-verification
  • Math
  • Testing-utilities

• Propagate

Vl-maybe-driven-by-modinsts

(vl-maybe-driven-by-modinsts x) applies vl-maybe-driven-by-modinst to every member of the list x, and appends together all the resulting lists.

This is an ordinary defmapappend.

Function: vl-maybe-driven-by-modinsts

(defun vl-maybe-driven-by-modinsts (x)
  (declare (xargs :guard (vl-modinstlist-p x)))
  (mbe :logic
       (if (consp x)
           (append (vl-maybe-driven-by-modinst (car x))
                   (vl-maybe-driven-by-modinsts (cdr x)))
         nil)
       :exec (reverse (vl-maybe-driven-by-modinsts-exec x nil))))

Definitions and Theorems

Function: vl-maybe-driven-by-modinsts-exec

(defun vl-maybe-driven-by-modinsts-exec (x acc)
  (declare (xargs :guard (vl-modinstlist-p x)))
  (if (consp x)
      (vl-maybe-driven-by-modinsts-exec
           (cdr x)
           (revappend (vl-maybe-driven-by-modinst (car x))
                      acc))
    acc))

Function: vl-maybe-driven-by-modinsts

(defun vl-maybe-driven-by-modinsts (x)
  (declare (xargs :guard (vl-modinstlist-p x)))
  (mbe :logic
       (if (consp x)
           (append (vl-maybe-driven-by-modinst (car x))
                   (vl-maybe-driven-by-modinsts (cdr x)))
         nil)
       :exec (reverse (vl-maybe-driven-by-modinsts-exec x nil))))

Theorem: vl-maybe-driven-by-modinsts-exec-removal

(defthm vl-maybe-driven-by-modinsts-exec-removal
  (equal (vl-maybe-driven-by-modinsts-exec acl2::x acl2::acc)
         (revappend (vl-maybe-driven-by-modinsts acl2::x)
                    acl2::acc))
  :rule-classes ((:rewrite)))

Theorem: set-equiv-congruence-over-vl-maybe-driven-by-modinsts

(defthm set-equiv-congruence-over-vl-maybe-driven-by-modinsts
  (implies (set-equiv acl2::x acl2::y)
           (set-equiv (vl-maybe-driven-by-modinsts acl2::x)
                      (vl-maybe-driven-by-modinsts acl2::y)))
  :rule-classes ((:congruence)))

Theorem: subsetp-of-vl-maybe-driven-by-modinsts-when-subsetp

(defthm subsetp-of-vl-maybe-driven-by-modinsts-when-subsetp
  (implies (subsetp acl2::x acl2::y)
           (subsetp (vl-maybe-driven-by-modinsts acl2::x)
                    (vl-maybe-driven-by-modinsts acl2::y)))
  :rule-classes ((:rewrite)))

Theorem: member-in-vl-maybe-driven-by-modinsts

(defthm member-in-vl-maybe-driven-by-modinsts
  (implies (and (member acl2::k
                        (vl-maybe-driven-by-modinst acl2::j))
                (member acl2::j acl2::x))
           (member acl2::k
                   (vl-maybe-driven-by-modinsts acl2::x)))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-driven-by-modinsts-of-list-fix

(defthm vl-maybe-driven-by-modinsts-of-list-fix
  (equal (vl-maybe-driven-by-modinsts (list-fix acl2::x))
         (vl-maybe-driven-by-modinsts acl2::x))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-driven-by-modinsts-of-append

(defthm vl-maybe-driven-by-modinsts-of-append
  (equal (vl-maybe-driven-by-modinsts (append acl2::a acl2::b))
         (append (vl-maybe-driven-by-modinsts acl2::a)
                 (vl-maybe-driven-by-modinsts acl2::b)))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-driven-by-modinsts-when-not-consp

(defthm vl-maybe-driven-by-modinsts-when-not-consp
  (implies (not (consp acl2::x))
           (equal (vl-maybe-driven-by-modinsts acl2::x)
                  nil))
  :rule-classes ((:rewrite)))

Theorem: vl-maybe-driven-by-modinsts-of-cons

(defthm vl-maybe-driven-by-modinsts-of-cons
  (equal (vl-maybe-driven-by-modinsts (cons acl2::a acl2::b))
         (append (vl-maybe-driven-by-modinst acl2::a)
                 (vl-maybe-driven-by-modinsts acl2::b)))
  :rule-classes ((:rewrite)))