Automatic HFL(Z) Validity Checking for Program Verification
share
We propose an automated method for checking the validity of a formula of HFL(Z), a higher-order logic with fixpoint operators and integers. Combined with Kobayashi et al.'s reduction from higher-order program verification to HFL(Z) validity checking, our method yields a fully automated verification method for temporal properties of higher-order functional programs. We have implemented our method and obtained promising experimental results.
READ FULL TEXT