• 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
          • Def-svtv-generalized-thm
          • Override-transparent
          • Def-svtv-to-fsm-thm
          • Svtv-decomposition-choosing-a-method
          • Def-svtv-refinement
          • Def-svtv-ideal
          • Def-override-transparent
          • Sv-versus-esim
          • Svex-decomp
          • Svex-compose-dfs
          • Svex-compilation
          • Moddb
          • Svmods
          • Svstmt
          • Sv-tutorial
          • Expressions
          • Symbolic-test-vector
          • Vl-to-svex
        • Fgl
        • Vwsim
        • Vl
        • X86isa
        • Svl
        • Rtl
      • Software-verification
      • Math
      • Testing-utilities
    • Svex-decomposition-methodology
    • Def-svtv-refinement

    Def-override-transparent

    For a given FSM and set of keys (internal signal names), prove that the FSM is override-transparent with respect to those keys.

    This utility tries to prove that the given FSM is override-transparent with respect to a set of keys, using a syntactic check and, if necessary and the :fgl-semantic-check keyword argument is provided, a semantic check using FGL and equivalence checking.

    Usage:

    (def-override-transparent name-of-theorem-to-prove
       :fsm (my-fsm) :keys (my-keys)
       ;; optional:
       :fgl-semantic-check t                ;; default: nil
       :use-default-aignet-transforms nil)  ;; default: t