• 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
      • Lint
      • Mlib
        • Scopestack
        • Filtering-by-name
        • Vl-namefactory
        • Substitution
        • Allexprs
        • Hid-tools
        • Vl-consteval
        • Range-tools
        • Lvalexprs
        • Hierarchy
        • Finding-by-name
        • Expr-tools
          • Vl-expr-widthsfixed-p
          • Vl-make-idexpr-list
          • Vl-exprlist-resolved->vals
          • Vl-idexprlist->names
          • Vl-expr-names
          • Vl-expr-count
            • Vl-exprlist-count
            • Vl-atts-count
          • Vl-idexpr
          • Vl-exprlist-to-plainarglist
          • Vl-expr-atoms
          • Vl-expr-ops
          • Vl-expr-count-noatts
          • Vl-make-index
          • Vl-expr-selects
          • Vl-bitlist-from-nat
          • Vl-pps-expr
          • Vl-expr-add-atts
          • Vl-idexprlist-p
          • Vl-expr-resolved-p
          • Vl-pps-origexpr
          • Vl-expr-funnames
          • Vl-idexpr->name
          • Vl-idexpr-p
          • Vl-exprlist-funnames
          • Vl-resolved->val
          • Vl-exprlist-resolved-p
          • Vl-expr->atts
          • Vl-obviously-true-expr-p
          • Vl-obviously-false-expr-p
          • Vl-exprlist-has-funcalls
          • Vl-expr-has-funcalls
          • Vl-zbitlist-p
          • Vl-zatom-p
          • Vl-exprlist-has-ops
          • Vl-expr-has-ops
          • Vl-expr-varnames
          • Vl-one-bit-constants
        • Expr-slicing
        • Stripping-functions
        • Stmt-tools
        • Modnamespace
        • Vl-parse-expr-from-str
        • Welltyped
        • Reordering-by-name
        • Flat-warnings
        • Genblob
        • Expr-building
        • Datatype-tools
        • Syscalls
        • Relocate
        • Expr-cleaning
        • Namemangle
        • Caremask
        • Port-tools
        • Lvalues
      • Server
      • Kit
      • Printer
      • Esim-vl
      • Well-formedness
    • Sv
    • Fgl
    • Vwsim
    • Vl
    • X86isa
    • Svl
    • Rtl
  • Software-verification
  • Math
  • Testing-utilities

• Expr-tools

Vl-expr-count

A measure for recurring over expressions.

Signature

(vl-expr-count x) → *

Arguments

x — Guard (vl-expr-p x).

This measure has a few nice properties. It respects all of the equivalences for expressions and avoids having a function for vl-maybe-expr-p.

Note that we don't count the attributes of an atom. Normally there's not any reason to descend into their attributes, so this doesn't really matter. We might some day extend this function to also count atom attributes.

Theorem: vl-exprlist-count-of-cons

(defthm vl-exprlist-count-of-cons
  (equal (vl-exprlist-count (cons a x))
         (+ 1 (vl-expr-count a)
            (vl-exprlist-count x))))

Theorem: vl-expr-count-of-car-weak

(defthm vl-expr-count-of-car-weak
  (<= (vl-expr-count (car x))
      (vl-exprlist-count x))
  :rule-classes ((:rewrite) (:linear)))

Theorem: vl-expr-count-of-car-strong

(defthm vl-expr-count-of-car-strong
  (implies (consp x)
           (< (vl-expr-count (car x))
              (vl-exprlist-count x)))
  :rule-classes ((:rewrite) (:linear)))

Theorem: vl-expr-kind-when-vl-expr-count-is-1-fwd

(defthm vl-expr-kind-when-vl-expr-count-is-1-fwd
  (implies (equal (vl-expr-count x) 1)
           (equal (vl-expr-kind x) :atom))
  :rule-classes ((:forward-chaining)))

Theorem: vl-exprlist-count-of-cdr-weak

(defthm vl-exprlist-count-of-cdr-weak
  (<= (vl-exprlist-count (cdr x))
      (vl-exprlist-count x))
  :rule-classes ((:rewrite) (:linear)))

Theorem: vl-exprlist-count-of-cdr-strong

(defthm vl-exprlist-count-of-cdr-strong
  (implies (consp x)
           (< (vl-exprlist-count (cdr x))
              (vl-exprlist-count x)))
  :rule-classes ((:rewrite) (:linear)))

Theorem: vl-atts-count-when-atom

(defthm vl-atts-count-when-atom
  (implies (atom x)
           (equal (vl-atts-count x) 1)))

Theorem: vl-atts-count-of-cons

(defthm vl-atts-count-of-cons
  (equal (vl-atts-count (cons a x))
         (if (atom a)
             (vl-atts-count x)
           (+ 1 (if (cdr a) (vl-expr-count (cdr a)) 0)
              (vl-atts-count x)))))

Theorem: vl-atts-count-of-cdr-weak

(defthm vl-atts-count-of-cdr-weak
  (<= (vl-atts-count (cdr x))
      (vl-atts-count x))
  :rule-classes ((:rewrite) (:linear)))

Theorem: vl-atts-count-of-cdr-strong

(defthm vl-atts-count-of-cdr-strong
  (implies (and (consp x) (consp (car x)))
           (< (vl-atts-count (cdr x))
              (vl-atts-count x)))
  :rule-classes ((:rewrite) (:linear)))

Theorem: vl-expr-count-of-cdar-when-vl-atts-p

(defthm vl-expr-count-of-cdar-when-vl-atts-p
  (implies (and (vl-atts-p x) x)
           (< (vl-expr-count (cdar x))
              (vl-atts-count x)))
  :rule-classes ((:rewrite) (:linear)))

Theorem: vl-exprlist-count-of-vl-nonatom->args-strong

(defthm vl-exprlist-count-of-vl-nonatom->args-strong
  (implies (equal (vl-expr-kind x) :nonatom)
           (< (vl-exprlist-count (vl-nonatom->args x))
              (vl-expr-count x)))
  :rule-classes ((:rewrite) (:linear)))

Theorem: vl-exprlist-count-of-vl-nonatom->atts-strong

(defthm vl-exprlist-count-of-vl-nonatom->atts-strong
  (implies (equal (vl-expr-kind x) :nonatom)
           (< (vl-atts-count (vl-nonatom->atts x))
              (vl-expr-count x)))
  :rule-classes ((:rewrite) (:linear)))

Theorem: vl-expr-count-of-vl-expr-fix-x

(defthm vl-expr-count-of-vl-expr-fix-x
  (equal (vl-expr-count (vl-expr-fix x))
         (vl-expr-count x)))

Theorem: vl-atts-count-of-vl-atts-fix-x

(defthm vl-atts-count-of-vl-atts-fix-x
  (equal (vl-atts-count (vl-atts-fix x))
         (vl-atts-count x)))

Theorem: vl-exprlist-count-of-vl-exprlist-fix-x

(defthm vl-exprlist-count-of-vl-exprlist-fix-x
  (equal (vl-exprlist-count (vl-exprlist-fix x))
         (vl-exprlist-count x)))

Theorem: vl-expr-count-vl-expr-equiv-congruence-on-x

(defthm vl-expr-count-vl-expr-equiv-congruence-on-x
  (implies (vl-expr-equiv x x-equiv)
           (equal (vl-expr-count x)
                  (vl-expr-count x-equiv)))
  :rule-classes :congruence)

Theorem: vl-atts-count-vl-atts-equiv-congruence-on-x

(defthm vl-atts-count-vl-atts-equiv-congruence-on-x
  (implies (vl-atts-equiv x x-equiv)
           (equal (vl-atts-count x)
                  (vl-atts-count x-equiv)))
  :rule-classes :congruence)

Theorem: vl-exprlist-count-vl-exprlist-equiv-congruence-on-x

(defthm vl-exprlist-count-vl-exprlist-equiv-congruence-on-x
  (implies (vl-exprlist-equiv x x-equiv)
           (equal (vl-exprlist-count x)
                  (vl-exprlist-count x-equiv)))
  :rule-classes :congruence)

Subtopics

Vl-exprlist-count

Vl-atts-count