Termination of polynomial programs

DOI10.1007/978-3-540-30579-8_8MaRDI QIDQ5711515zbMATH OpenOpenAlexFDO

Authors Aaron R. Bradley, Zohar Manna, Henny B. Sipma

Publication date 6 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b105073

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Termination of single-path polynomial loop programs
• Symbolic termination analysis of solvable loops
• Termination analysis of linear loop programs
• TERMINATION ANALYSIS OF LINEAR LOOPS
• Discovering non-terminating inputs for multi-path polynomial programs

Cited in

(34)

• Program termination using Z-transform theory
• Self-correcting polynomial programs
• Symbolic termination analysis of solvable loops
• Automated termination analysis of polynomial probabilistic programs
• Termination of polynomial loops
• Discovering non-terminating inputs for multi-path polynomial programs
• A second-order formulation of non-termination
• Algorithms with polynomial interpretation termination proof
• Algebraic Notions of Termination
• An iterative method for generating loop invariants
• Termination of single-path polynomial loop programs
• Proving termination through conditional termination
• A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis
• Recent advances in program verification through computer algebra
• Proving Termination of Integer Term Rewriting
• Automata-Based Termination Proofs
• The Use of Termination Indicators in Computer Programming
• Generating exact nonlinear ranking functions by symbolic-numeric hybrid method
• Proving termination of nonlinear command sequences
• Chapter 6. Algebra of program termination
• Alternation for termination
• scientific article; zbMATH DE number 7453196 (Why is no real title available?)
• Termination of semi-algebraic loop programs
• Tight polynomial worst-case bounds for loop programs
• Proving termination by policy iteration
• A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
• Polynomials over the reals in proofs of termination : from theory to practice
• Ranking functions for linear-constraint loops
• Termination of linear programs with nonlinear constraints
• What else is undecidable about loops?
• Deciding Polynomial Termination Complexity for VASS Programs
• Termination analysis of programs with multiphase control-flow
• On termination of polynomial programs with equality conditions
• Summarization for termination: No return!

This page was built for publication: Termination of polynomial programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711515)