• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
      • Apt
      • Zfc
      • Acre
      • Milawa
      • Smtlink
      • Abnf
      • Vwsim
      • Isar
      • Wp-gen
      • Dimacs-reader
      • Pfcs
      • Legacy-defrstobj
      • Proof-checker-array
      • Soft
      • C
        • Syntax-for-tools
        • Atc
        • Language
          • Abstract-syntax
          • Integer-ranges
          • Implementation-environments
          • Dynamic-semantics
          • Static-semantics
          • Grammar
          • Integer-formats
          • Types
          • Portable-ascii-identifiers
          • Values
          • Integer-operations
          • Computation-states
            • Write-object
            • Objdesign-of-var
            • Compustate-scopes-numbers
            • Create-var
            • Read-object
            • Compustate
              • Compustatep
              • Compustate-fix
              • Compustate-equiv
                • Make-compustate
                • Compustate->frames
                • Change-compustate
                • Compustate->static
                • Compustate->heap
              • Frame
              • Enter-scope
              • Compustate-scopes-numbers-aux
              • Compustate-option
              • Push-frame
              • Exit-scope
              • Compustate-frames-number
              • Compustate-option-result
              • Scope-list-result
              • Pop-frame
              • Compustate-result
              • Scope-result
              • Compustate-top-frame-scopes-number
              • Top-frame
              • Heap
              • Scope
              • Scope-list
              • Frame-list
            • Object-designators
            • Operations
            • Errors
            • Tag-environments
            • Function-environments
            • Character-sets
            • Flexible-array-member-removal
            • Arithmetic-operations
            • Pointer-operations
            • Bytes
            • Keywords
            • Real-operations
            • Array-operations
            • Scalar-operations
            • Structure-operations
          • Representation
          • Transformation-tools
          • Insertion-sort
          • Pack
        • Farray
        • Rp-rewriter
        • Instant-runoff-voting
        • Imp-language
        • Sidekick
        • Leftist-trees
        • Java
        • Taspi
        • Bitcoin
        • Riscv
        • Des
        • Ethereum
        • X86isa
        • Sha-2
        • Yul
        • Zcash
        • Proof-checker-itp13
        • Regex
        • ACL2-programming-language
        • Json
        • Jfkr
        • Equational
        • Cryptography
        • Poseidon
        • Where-do-i-place-my-book
        • Axe
        • Bigmems
        • Builtins
        • Execloader
        • Aleo
        • Solidity
        • Paco
        • Concurrent-programs
        • Bls12-377-curves
      • Debugging
      • Std
      • Proof-automation
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Math
      • Testing-utilities
    • Compustate

    Compustate-equiv

    Basic equivalence relation for compustate structures.

    Definitions and Theorems

    Function: compustate-equiv$inline

    (defun compustate-equiv$inline (acl2::x acl2::y)
      (declare (xargs :guard (and (compustatep acl2::x)
                                  (compustatep acl2::y))))
      (equal (compustate-fix acl2::x)
             (compustate-fix acl2::y)))

    Theorem: compustate-equiv-is-an-equivalence

    (defthm compustate-equiv-is-an-equivalence
      (and (booleanp (compustate-equiv x y))
           (compustate-equiv x x)
           (implies (compustate-equiv x y)
                    (compustate-equiv y x))
           (implies (and (compustate-equiv x y)
                         (compustate-equiv y z))
                    (compustate-equiv x z)))
      :rule-classes (:equivalence))

    Theorem: compustate-equiv-implies-equal-compustate-fix-1

    (defthm compustate-equiv-implies-equal-compustate-fix-1
      (implies (compustate-equiv acl2::x x-equiv)
               (equal (compustate-fix acl2::x)
                      (compustate-fix x-equiv)))
      :rule-classes (:congruence))

    Theorem: compustate-fix-under-compustate-equiv

    (defthm compustate-fix-under-compustate-equiv
      (compustate-equiv (compustate-fix acl2::x)
                        acl2::x)
      :rule-classes (:rewrite :rewrite-quoted-constant))

    Theorem: equal-of-compustate-fix-1-forward-to-compustate-equiv

    (defthm equal-of-compustate-fix-1-forward-to-compustate-equiv
      (implies (equal (compustate-fix acl2::x) acl2::y)
               (compustate-equiv acl2::x acl2::y))
      :rule-classes :forward-chaining)

    Theorem: equal-of-compustate-fix-2-forward-to-compustate-equiv

    (defthm equal-of-compustate-fix-2-forward-to-compustate-equiv
      (implies (equal acl2::x (compustate-fix acl2::y))
               (compustate-equiv acl2::x acl2::y))
      :rule-classes :forward-chaining)

    Theorem: compustate-equiv-of-compustate-fix-1-forward

    (defthm compustate-equiv-of-compustate-fix-1-forward
      (implies (compustate-equiv (compustate-fix acl2::x)
                                 acl2::y)
               (compustate-equiv acl2::x acl2::y))
      :rule-classes :forward-chaining)

    Theorem: compustate-equiv-of-compustate-fix-2-forward

    (defthm compustate-equiv-of-compustate-fix-2-forward
      (implies (compustate-equiv acl2::x (compustate-fix acl2::y))
               (compustate-equiv acl2::x acl2::y))
      :rule-classes :forward-chaining)