Takeshi Tsukada
ABSTRACT
This paper studies the hardness of branching-time property verification of Turing-complete programming languages, as well as logical approaches to the verification problem. As these approaches reduce the verification problem to logical problems, e.g. the satisfiability problem of Horn clauses with certain extensions, it is natural to ask whether the logical problems are as hard as the verification problem or strictly harder. This paper reveals that logical problems used in most approaches are far more difficult than the verification problem; the only exception is the validity problem of first-order arithmetic with fixed-point operators. We also answers some other natural questions, for example, whether the extensions of Horn clauses are necessarily.
- Tewodros A. Beyene, Swarat Chaudhuri, Corneliu Popeea, and Andrey Rybalchenko. 2014. A constraint-based approach to solving games on infinite graphs. In The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Suresh Jagannathan and Peter Sewell (Eds.). ACM, 221--234.Google Scholar
Digital Library
- Tewodros A. Beyene, Corneliu Popeea, and Andrey Rybalchenko. 2013. Solving Existentially Quantified Horn Clauses. In The 25th International Conference on Computer Aided Verification (Lecture Notes in Computer Science), Natasha Sharygina and Helmut Veith (Eds.), Vol. 8044. Springer, 869--882.Google Scholar
- Nikolaj Bjørner, Arie Gurfinkel, Kenneth L. McMillan, and Andrey Rybalchenko. 2015. Horn Clause Solvers for Program Verification. In Fields of Logic and Computation II - Essays Dedicated to Yuri Gurevich on the Occasion of His 75th Birthday (Lecture Notes in Computer Science), Lev D. Beklemishev, Andreas Blass, Nachum Dershowitz, Bernd Finkbeiner, and Wolfram Schulte (Eds.), Vol. 9300. Springer, 24--51.Google Scholar
- Julian C. Bradfield. 1998. The Modal μ-Calculus Alternation Hierarchy is Strict. Theor. Comput. Sci. 195, 2 (1998), 133--153.Google ScholarDigital Library
- Julian C. Bradfield. 1999. Fixpoint Alternation and the Game Quantifier. In The 8th EACSL Annual Conference on Computer Science Logic (Lecture Notes in Computer Science), Jörg Flum and Mario Rodríguez-Artalejo (Eds.), Vol. 1683. Springer, 350--361.Google Scholar
- Florian Bruse. 2014. Alternating Parity Krivine Automata. In The 39th International Symposium on Mathematical Foundations of Computer Science (Lecture Notes in Computer Science), Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger, and Zoltán Ésik (Eds.), Vol. 8634. Springer, 111--122.Google Scholar
- Florian Bruse. 2016. Alternation Is Strict For Higher-Order Modal Fixpoint Logic. In Proceedings of the 7th International Symposium on Games, Automata, Logics and Formal Verification (EPTCS), Domenico Cantone and Giorgio Delzanno (Eds.), Vol. 226. 105--119.Google ScholarCross Ref
- Erich Grädel, Wolfgang Thomas, and Thomas Wilke (Eds.). 2002. Automata, Logics, and Infinite Games: A Guide to Current Research. Lecture Notes in Computer Science, Vol. 2500. Springer.Google ScholarDigital Library
- David Harel. 1986. Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness. J. ACM 33, 1 (1986), 224--248.Google ScholarDigital Library
- Thomas John. 1986. Recursion in Kolmogorov's R-Operator and the Ordinal σ3. J. Symb. Log. 51, 1 (1986), 1--11.Google ScholarCross Ref
- Hartley Rogers Jr. 1987. Theory of recursive functions and effective computability. MIT Press.Google Scholar
- Naoki Kobayashi, Étienne Lozes, and Florian Bruse. 2017. On the relationship between higher-order recursion schemes and higher-order fixpoint logic. In The 44th ACM SIGPLAN Symposium on Principles of Programming Languages, Giuseppe Castagna and Andrew D. Gordon (Eds.). ACM, 246--259.Google ScholarDigital Library
- Naoki Kobayashi, Takeshi Nishikawa, Atsushi Igarashi, and Hiroshi Unno. 2019. Temporal Verification of Programs via First-Order Fixpoint Logic. In The 26th Static Analysis Symposium (Lecture Notes in Computer Science), Bor-Yuh Evan Chang (Ed.), Vol. 11822. Springer, 413--436.Google ScholarCross Ref
- Naoki Kobayashi and C.-H. Luke Ong. 2009. A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes. In The 24th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society, 179--188.Google ScholarDigital Library
- Naoki Kobayashi, Takeshi Tsukada, and Keiichi Watanabe. 2017. Higher-Order Program Verification via HFL Model Checking. CoRR abs/1710.08614 (2017). arXiv:1710.08614Google Scholar
- Naoki Kobayashi, Takeshi Tsukada, and Keiichi Watanabe. 2018. Higher-Order Program Verification via HFL Model Checking. In The 27th European Symposium on Programming (Lecture Notes in Computer Science), Amal Ahmed (Ed.), Vol. 10801. Springer, 711--738.Google ScholarCross Ref
- Dexter Kozen. 2006. Theory of Computation. Springer.Google Scholar
- Robert S. Lubarsky. 1993. μ-Definable Sets of Integers. J. Symb. Log. 58, 1 (1993), 291--313.Google ScholarCross Ref
- Yoji Nanjo, Hiroshi Unno, Eric Koskinen, and Tachio Terauchi. 2018. A Fixpoint Logic and Dependent Effects for Temporal Property Verification. In The 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, Anuj Dawar and Erich Grädel (Eds.). ACM, 759--768.Google ScholarDigital Library
- Andreas Podelski and Andrey Rybalchenko. 2004. Transition Invariants. In The 19th IEEE Symposium on Logic in Computer Science. IEEE Computer Society, 32--41.Google Scholar
- Hiroshi Unno, Yuki Satake, and Tachio Terauchi. 2018. Relatively complete refinement type system for verification of higher-order non-deterministic programs. Proc. ACM Program. Lang. 2, POPL (2018), 12:1--12:29.Google ScholarDigital Library
- Moshe Y. Vardi. 1991. Verification of Concurrent Programs: The Automata-Theoretic Framework. Ann. Pure Appl. Log. 51, 1-2 (1991), 79--98.Google ScholarCross Ref
- Mahesh Viswanathan and Ramesh Viswanathan. 2004. A Higher Order Modal Fixed Point Logic. In The 15th International Conference on Concurrency Theory (Lecture Notes in Computer Science), Philippa Gardner and Nobuko Yoshida (Eds.), Vol. 3170. Springer, 512--528.Google ScholarCross Ref
- Igor Walukiewicz. 2019. Lambda Y-Calculus With Priorities. In The 34th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE, 1--13.Google Scholar
- Keiichi Watanabe, Takeshi Tsukada, Hiroki Oshikawa, and Naoki Kobayashi. 2019. Reduction from branching-time property verification of higher-order programs to HFL validity checking. In The 2019 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, Manuel V. Hermenegildo and Atsushi Igarashi (Eds.). ACM, 22--34.Google ScholarDigital Library
Index Terms
- On Computability of Logical Approaches to Branching-Time Property Verification of Programs
Recommendations
Reduction from branching-time property verification of higher-order programs to HFL validity checking
PEPM 2019: Proceedings of the 2019 ACM SIGPLAN Workshop on Partial Evaluation and Program ManipulationVarious methods have recently been proposed for temporal property verification of higher-order programs. In those methods, however, either temporal properties were limited to linear-time ones, or target programs were limited to finite-data programs. In ...
Verification of Boolean programs with unbounded thread creation
Most symbolic software model checkers use abstraction techniques to reduce the verification of infinite-state programs to that of decidable classes. Boolean programs [T. Ball, S.K. Rajamani, Bebop: A symbolic model checker for Boolean programs, in: SPIN ...
A verification system for concurrent programs based on the Boyer-Moore prover
AbstractWe describe a mechanical proof system for concurrent programs, based on a formalization of the temporal framework of Manna and Pnueli as an extension of the computational logic of Boyer and Moore. The system provides a natural representation of ...
Comments