Reports techniques to solve ∃∀ non-linear polynomial inequalities over naturals for termination analysis without relying on absolute positiveness.
Analyzing Program Termination and Complexity Automatically with AProVE
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
fields
cs.LO 4verdicts
UNVERDICTED 4representative citing papers
Automatic techniques derive upper and lower bounds on parallel complexity of term rewriting by reusing sequential methods, with sufficient criteria for confluence of the parallel-innermost relation, shown via AProVE extension and benchmarks.
PaSTTeL is a new parallel framework that unifies termination and non-termination analysis for lasso programs through concurrent strategy execution and modular design.
Experiments compare model finding strategies for semantic labelling in termination proofs using Matchbox and MnM.
citing papers explorer
-
Beyond Absolute Positiveness for Universally Quantified Non-Linear Polynomial Constraints
Reports techniques to solve ∃∀ non-linear polynomial inequalities over naturals for termination analysis without relying on absolute positiveness.
-
On Complexity Bounds and Confluence of Parallel Term Rewriting
Automatic techniques derive upper and lower bounds on parallel complexity of term rewriting by reusing sequential methods, with sufficient criteria for confluence of the parallel-innermost relation, shown via AProVE extension and benchmarks.
-
PaSTTeL: Parallel analysiS framework for Termination and non-Termination of Lasso programs
PaSTTeL is a new parallel framework that unifies termination and non-termination analysis for lasso programs through concurrent strategy execution and modular design.
-
Semantic Labelling in Practice
Experiments compare model finding strategies for semantic labelling in termination proofs using Matchbox and MnM.