• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
      • Gl
      • Esim
      • Vl2014
      • Sv
        • Svex-stvs
        • Svex-decomposition-methodology
        • Sv-versus-esim
        • Svex-decomp
        • Svex-compose-dfs
        • Svex-compilation
          • Alias-normalization
          • Svex-design-flatten-and-normalize
          • Svex-design-compile
          • Svex-composition
          • Compile.lisp
            • Svex-normalize-assigns
            • Svex-design-flatten
            • Svex-override-lhrange
            • Svex-override-lhs
            • Aliases-indexed->named-aux
            • Svex-compose-assigns/delays
            • Svex-alist-truncate-by-var-decls
            • Svar-map-truncate-by-var-decls
            • Aliases-to-var-decl-map-aux
            • Aliases-indexed->named
            • Svar-indexed->named-memo
            • Lhs-indexed->named
            • Svar-register-indnamememo
            • Svarlist-indexed->named
            • Maybe-svar-fix
            • Lhs-register-indnamememo
            • Maybe-indname-result
            • Aliases-to-var-decl-map
            • Svar-indexed->named
            • Aliases-boundedp-aux
              • Svex-apply-overrides
              • Indnamememo-to-var-decl-map
              • Indname-result
              • Assigns-compose
              • Delay-svarlist->delays
              • Indnamememo
              • Svex-override-vars
              • Delay-svar->delays
              • Assigns-to-overrides
              • Svarlist-collect-delays
              • Svex-overridelist-vars
              • Svex-overridelist-keys
              • Assigns-to-overrides-nrev
              • Var-decl-map
              • Cap-length
            • Assign->segment-drivers
            • Segment-driver-map-resolve
            • Assigns->segment-drivers
          • Moddb
          • Svmods
          • Svstmt
          • Sv-tutorial
          • Expressions
          • Symbolic-test-vector
          • Vl-to-svex
        • Fgl
        • Vwsim
        • Vl
        • X86isa
        • Svl
        • Rtl
      • Software-verification
      • Math
      • Testing-utilities
    • Compile.lisp

    Aliases-boundedp-aux

    Signature
    (aliases-boundedp-aux n aliases bound) → *
    Arguments
    n — Guard (natp n).
    bound — Guard (natp bound).

    Definitions and Theorems

    Function: aliases-boundedp-aux

    (defun aliases-boundedp-aux (n aliases bound)
     (declare (xargs :stobjs (aliases)))
     (declare (xargs :guard (and (natp n) (natp bound))))
     (declare (xargs :guard (<= (lnfix n) (aliass-length aliases))))
     (let ((__function__ 'aliases-boundedp-aux))
       (declare (ignorable __function__))
       (b* (((when (mbe :logic (zp (- (aliass-length aliases) (nfix n)))
                        :exec (eql (aliass-length aliases) n)))
             t))
         (and (svarlist-boundedp (lhs-vars (get-alias n aliases))
                                 bound)
              (aliases-boundedp-aux (1+ (lnfix n))
                                    aliases bound)))))

    Theorem: aliases-boundedp-aux-of-update-less

    (defthm aliases-boundedp-aux-of-update-less
      (implies (< (nfix m) (nfix n))
               (equal (aliases-boundedp-aux n (update-nth m val aliases)
                                            bound)
                      (aliases-boundedp-aux n aliases bound))))

    Theorem: aliases-boundedp-aux-when-normordered

    (defthm aliases-boundedp-aux-when-normordered
      (implies (and (aliases-normorderedp aliases)
                    (<= (len aliases) (nfix bound)))
               (aliases-boundedp-aux n aliases bound)))

    Theorem: aliases-boundedp-aux-of-nfix-n

    (defthm aliases-boundedp-aux-of-nfix-n
      (equal (aliases-boundedp-aux (nfix n)
                                   aliases bound)
             (aliases-boundedp-aux n aliases bound)))

    Theorem: aliases-boundedp-aux-nat-equiv-congruence-on-n

    (defthm aliases-boundedp-aux-nat-equiv-congruence-on-n
      (implies (nat-equiv n n-equiv)
               (equal (aliases-boundedp-aux n aliases bound)
                      (aliases-boundedp-aux n-equiv aliases bound)))
      :rule-classes :congruence)

    Theorem: aliases-boundedp-aux-of-lhslist-fix-aliases

    (defthm aliases-boundedp-aux-of-lhslist-fix-aliases
      (equal (aliases-boundedp-aux n (lhslist-fix aliases)
                                   bound)
             (aliases-boundedp-aux n aliases bound)))

    Theorem: aliases-boundedp-aux-lhslist-equiv-congruence-on-aliases

    (defthm aliases-boundedp-aux-lhslist-equiv-congruence-on-aliases
      (implies (lhslist-equiv aliases aliases-equiv)
               (equal (aliases-boundedp-aux n aliases bound)
                      (aliases-boundedp-aux n aliases-equiv bound)))
      :rule-classes :congruence)

    Theorem: aliases-boundedp-aux-of-nfix-bound

    (defthm aliases-boundedp-aux-of-nfix-bound
      (equal (aliases-boundedp-aux n aliases (nfix bound))
             (aliases-boundedp-aux n aliases bound)))

    Theorem: aliases-boundedp-aux-nat-equiv-congruence-on-bound

    (defthm aliases-boundedp-aux-nat-equiv-congruence-on-bound
      (implies (nat-equiv bound bound-equiv)
               (equal (aliases-boundedp-aux n aliases bound)
                      (aliases-boundedp-aux n aliases bound-equiv)))
      :rule-classes :congruence)