Detection of ranking functions of polynomial loop programs

DOI10.13328/J.CNKI.JOS.005567MaRDI QIDQ3306912zbMATH OpenFDO

Authors Yi Li, Yong Feng

Publication date 12 August 2020

Full work available at URL https://doi.org/10.13328/J.CNKI.JOS.005567

zbMATH Keywords

multi-path loop programranking functionterminationtrusted computing

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• SVM-based method for detecting ranking functions in polynomial loop programs
• Automata, Languages and Programming
• A new look at the automatic synthesis of linear ranking functions
• Computer Aided Verification
• Verification, Model Checking, and Abstract Interpretation

Cited in

(6)

• Synthesizing ranking functions for loop programs via SVM
• Tight worst-case bounds for polynomial loop programs
• Proving total correctness and generating preconditions for loop programs via symbolic-numeric computation methods
• Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems
• Generating exact nonlinear ranking functions by symbolic-numeric hybrid method
• SVM-based method for detecting ranking functions in polynomial loop programs

This page was built for publication: Detection of ranking functions of polynomial loop programs

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