Temporal verification of higher-order functional programs

Akihiro Murase, Tachio Terauchi, Naoki Kobayashi, Ryosuke Sato, Hiroshi Unno

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

We present an automated approach to verifying arbitrary omega regular properties of higher-order functional programs. Previous automated methods proposed for this class of programs could only handle safety properties or termination, and our approach is the first to be able to verify arbitrary omega-regular liveness properties. Our approach is automata-theoretic, and extends our recent work on binary-reachability-based approach to automated termination verification of higher-order functional programs to fair termination published in ESOP 2014. In that work, we have shown that checking disjunctive well-foundedness of (the transitive closure of) the "calling relation" is sound and complete for termination. The extension to fair termination is tricky, however, because the straightforward extension that checks disjunctive well-foundedness of the fair calling relation turns out to be unsound, as we shall show in the paper. Roughly, our solution is to check fairness on the transition relation instead of the calling relation, and propagate the information to determine when it is necessary and sufficient to check for disjunctive well-foundedness on the calling relation. We prove that our approach is sound and complete. We have implemented a prototype of our approach, and confirmed that it is able to automatically verify liveness properties of some non-trivial higher-order programs.

Original languageEnglish
Pages (from-to)57-68
Number of pages12
JournalACM SIGPLAN Notices
Volume51
Issue number1
DOIs
Publication statusPublished - 2016 Apr 8
Externally publishedYes

    Fingerprint

Keywords

  • Automata-theoretic verification
  • Automatic verification
  • Binary reachability analysis
  • CEGAR
  • Higher-order programs
  • Temporal properties

ASJC Scopus subject areas

  • Computer Science(all)

Cite this