• Top
  • Documentation
  • Books
  • Recursion-and-induction
  • Boolean-reasoning
  • Projects
  • Debugging
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
    • Gl
    • Esim
      • Symbolic-test-vectors
        • Defstv
        • Stv-compile
        • Symbolic-test-vector-format
        • Stv-implementation-details
        • Compiled-stv-p
        • Stv-run-for-all-dontcares
        • Stv-run
        • Stv-process
          • Processed-stv-p
          • Stv-fully-general-simulation-run
          • Stv-fully-general-in-alists
            • Stv-fully-general-in-alists-aux
            • Stv-fully-general-in-alist-n
          • Stv-run-esim-debug
          • Stv-extract-relevant-signals
          • Stv-fully-general-st-alist
          • Stv-run-esim
        • Stv-run-check-dontcares
        • Symbolic-test-vector-composition
        • Stv-expand
        • Stv-easy-bindings
        • Stv-debug
        • Stv-run-squash-dontcares
        • Stvdata-p
        • Stv-doc
        • Stv2c
        • Stv-widen
        • Stv-out->width
        • Stv-in->width
        • Stv->outs
        • Stv-number-of-phases
        • Stv->ins
        • Stv-suffix-signals
        • Stv->vars
      • Esim-primitives
      • E-conversion
      • Esim-steps
      • Patterns
      • Mod-internal-paths
      • Defmodules
      • Esim-simplify-update-fns
      • Esim-tutorial
      • Esim-vl
    • Vl2014
    • Sv
    • Vwsim
    • Fgl
    • Vl
    • X86isa
    • Svl
    • Rtl
  • Software-verification
  • Testing-utilities
  • Math

• Stv-fully-general-in-alists

Stv-fully-general-in-alist-n

Signature

(stv-fully-general-in-alist-n n flat-ins) → nth-alist

Arguments

n — Guard (natp n).

flat-ins — Guard (symbol-listp flat-ins).

Returns

nth-alist — Type (cons-listp nth-alist).

We memoize this to ensure that we'll get the same fully general alist across different STVs that target the same module for the same numbers of steps.

Definitions and Theorems

Function: stv-fully-general-in-alist-n

(defun
 stv-fully-general-in-alist-n
 (n flat-ins)
 (declare (xargs :guard (and (natp n) (symbol-listp flat-ins))))
 (let
   ((__function__ 'stv-fully-general-in-alist-n))
   (declare (ignorable __function__))
   (pairlis$ flat-ins
             (stv-suffix-signals flat-ins
                                 (str::cat ".P" (str::natstr n))))))

Theorem: cons-listp-of-stv-fully-general-in-alist-n

(defthm cons-listp-of-stv-fully-general-in-alist-n
        (b* ((nth-alist (stv-fully-general-in-alist-n n flat-ins)))
            (cons-listp nth-alist))
        :rule-classes :rewrite)