Reports techniques to solve ∃∀ non-linear polynomial inequalities over naturals for termination analysis without relying on absolute positiveness.
Testing Positiveness of Polynomials
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2verdicts
UNVERDICTED 2representative 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.
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.