• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
      • Apt
      • Zfc
      • Acre
      • Milawa
      • Smtlink
      • Abnf
      • Vwsim
      • Isar
      • Wp-gen
      • Dimacs-reader
      • Pfcs
      • Legacy-defrstobj
      • C
        • Syntax-for-tools
        • Atc
        • Transformation-tools
          • Simpadd0
          • Proof-generation
          • Split-gso
          • Wrap-fn
          • Constant-propagation
          • Specialize
          • Split-fn
          • Split-fn-when
          • Split-all-gso
          • Copy-fn
          • Variables-in-computation-states
          • Rename
          • Utilities
            • Free-vars
            • Abstract-syntax-rename-fn
            • Call-graphs
              • Qualified-ident
              • Call-graph-transitive-closure
              • Qualified-ident-option
              • Call-graph-transitive-closure0
              • Call-graph-init-declor-list
              • Call-graph-fundef
              • Call-graph-statassert
              • Call-graph-init-declor
              • Call-graph-declon
              • Call-graph-const-expr
              • Call-graph-transunit
              • Call-graph-ext-declon-list
              • Call-graph-ext-declon
              • Call-graph-update
              • Qualify-ident
              • Exists-call-pathp
                • Uncertain-call-pathp
                • Recursivep
                • Direct-recursivep
                • Call-graph-filepath-transunit-map
                • Call-graph-transunit-ensemble
                • Call-graph
                • Qualified-ident-option-set
                • Direct-fun-refp
              • Fresh-ident-utility
              • Collect-idents
              • Subst-free
            • Proof-generation-theorems
            • Input-processing
          • Language
          • Representation
          • Insertion-sort
          • Pack
        • Proof-checker-array
        • Soft
        • Farray
        • Rp-rewriter
        • Instant-runoff-voting
        • Imp-language
        • Sidekick
        • Ethereum
        • Leftist-trees
        • Java
        • Riscv
        • Taspi
        • Bitcoin
        • Zcash
        • Des
        • X86isa
        • Sha-2
        • Yul
        • Proof-checker-itp13
        • Regex
        • ACL2-programming-language
        • Json
        • Jfkr
        • Equational
        • Cryptography
        • Axe
        • Poseidon
        • Where-do-i-place-my-book
        • Aleo
        • Bigmems
        • Builtins
        • Execloader
        • Solidity
        • Paco
        • Concurrent-programs
        • Bls12-377-curves
      • Debugging
      • Community
      • Std
      • Proof-automation
      • Macro-libraries
      • ACL2
      • Interfacing-tools
      • Hardware-verification
      • Software-verification
      • Math
      • Testing-utilities
    • Call-graphs

    Exists-call-pathp

    Check for the existence of a call path from the destination to the target.

    Signature
    (exists-call-pathp from to call-graph) → *
    Arguments
    from — Guard (qualified-identp from).
    to — Guard (qualified-ident-optionp to).
    call-graph — Guard (call-graphp call-graph).

    That is, the function checks whether to is in from's transitive closure. See call-graph-transitive-closure.

    Definitions and Theorems

    Function: exists-call-pathp

    (defun exists-call-pathp (from to call-graph)
      (declare (xargs :guard (and (qualified-identp from)
                                  (qualified-ident-optionp to)
                                  (call-graphp call-graph))))
      (let ((__function__ 'exists-call-pathp))
        (declare (ignorable __function__))
        (in to
            (call-graph-transitive-closure from call-graph))))