[Paper Review] Bounded Termination of Monotonicity-Constraint Transition Systems

Amir M. Ben-Amram, Michael Vainer|arXiv (Cornell University)|Feb 20, 2012

Logic, programming, and type systems65 references3 citations

TL;DR

This paper introduces a decidable bounded termination problem for Monotonicity Constraint Transition Systems (MC-TS), proving that if a bound exists, it must be polynomial. The authors show the problem is PSPACE-complete and demonstrate how bounds on abstract programs can infer complexity classes like PTIME, PSPACE, or EXPTIME for concrete programs.

ABSTRACT

Intuitively, if we can prove that a program terminates, we expect some conclusion regarding its complexity. But the passage from termination proofs to complexity bounds is not always clear. In this work we consider Monotonicity Constraint Transition Systems, a program abstraction where termination is decidable (based on the size-change termination principle). We show that these programs also have a decidable complexity property: one can determine whether the length of all transition sequences can be bounded in terms of the initial state. This is the Bounded Termination problem. Interestingly, if a bound exists, it must be polynomial. We prove that the bounded termination problem is PSPACE-complete. We also discuss, theoretically, the use of bounds on the abstract program to infer conclusions on a concrete program that has been abstracted. The conclusion maybe a polynomial time bound, or in other cases polynomial space or exponential time. We argue that the monotonicity-constraint abstraction promises to be useful for practical complexity analysis of programs.

Motivation & Objective

• To extend termination analysis in Monotonicity Constraint Transition Systems (MC-TS) to complexity analysis by studying bounded termination.
• To determine whether the length of all transition sequences in MC-TS can be bounded in terms of the initial state.
• To investigate the theoretical connection between bounds on abstract programs and complexity classes (e.g., PTIME, PSPACE, EXPTIME) of concrete programs.
• To establish the computational complexity of the bounded termination problem within the MC-TS framework.

Proposed method

• Formalize Monotonicity Constraint Transition Systems (MC-TS) as infinite-state transition systems with finite control flow and monotonicity constraints over integer variables.
• Define bounded termination as the existence of a uniform bound on all transition sequences, parameterized by the initial state.
• Prove that if a bound exists, it must be polynomial in the initial values, using structural and algebraic properties of monotonicity constraints.
• Reduce the bounded termination problem to a decision problem over integer constraints and prove it is PSPACE-complete via reductions from known PSPACE-complete problems.
• Use the abstract program's bound to infer complexity classes for the original concrete program, based on the semantics of resource consumption (time, space, etc.).
• Leverage existing results on ranking functions and constraint systems to analyze termination and complexity in a unified framework.

Experimental results

Research questions

• RQ1 Is the bounded termination problem decidable for Monotonicity Constraint Transition Systems?
• RQ2 What is the computational complexity of determining whether a transition system has a uniform bound on transition sequences?
• RQ3 Can a bound on an abstract program (MC-TS) be used to infer concrete complexity classes (e.g., PTIME, PSPACE, EXPTIME) for the original program?
• RQ4 If a bound exists, is it necessarily polynomial in the initial state values?
• RQ5 How does the MC-TS abstraction compare to other approaches in cost analysis, particularly in terms of decidability and expressiveness?

Key findings

• The bounded termination problem for MC-TS is decidable and PSPACE-complete.
• If a bound exists, it must be polynomial in the initial state values, meaning no exponential or higher bounds are possible.
• The abstraction allows inference of complexity classes: a polynomial bound on the abstract program may correspond to PTIME, PSPACE, or EXPTIME in the concrete program.
• The results extend the utility of MC-TS beyond termination analysis to complexity analysis, offering a theoretically sound foundation.
• The work establishes a theoretical bridge between abstract program bounds and concrete program resource usage, supporting modular static analysis.
• An open problem is the computation of precise explicit bounds, which may be feasible in polynomial space.