Affiliation:
1. Ben-Gurion University of the Negev, Beersheba, Israel
2. University of Sheffield, Sheffield, United Kingdom
3. Royal Holloway University of London, London, United Kingdom
Abstract
Cyclic proof systems, in which induction is managed implicitly, are a promising approach to automatic
verification. The soundness of cyclic proof graphs is ensured by checking them against a trace-based Infinite Descent property. Although the problem of checking Infinite Descent is known to be PSPACE-complete, this leaves much room for variation in practice. Indeed, a number of different approaches are employed across the various cyclic proof systems described in the literature. In this paper, we study criteria for Infinite Descent in an abstract, logic-independent setting. We look at criteria based on Büchi automata encodings and relational abstractions, and determine their parameterized time complexities in terms of natural dimensions of cyclic proofs: the numbers of vertices of the proof-tree graphs, and the vertex width—an upper bound on the number of components (e.g., formulas) of a sequent that can be simultaneously tracked for descent. We identify novel algorithms that improve upon the parameterised complexity of the existing algorithms. We implement the studied criteria and compare their performance on various benchmarks.
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,Software
Reference53 articles.
1. Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing
2. Abstract Cyclic Proofs
3. Dana Angluin and Dana Fisman. 2020. Polynomial Time Algorithms for Inclusion and Equivalence of Deterministic Omega Acceptors. CoRR, abs/2002.03191 (2020), arxiv:2002.03191. arxiv:2002.03191
4. Program termination analysis in polynomial time