Generating exact nonlinear ranking functions by symbolic-numeric hybrid method

DOI10.1007/s11424-013-1004-1zbMath1282.90123OpenAlexW1998724430WikidataQ57533599 ScholiaQ57533599MaRDI QIDQ394460

Mohammad Hasan, H. S. Yoon

Publication date: 27 January 2014

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-013-1004-1

zbMATH Keywords

semidefinite programmingranking functionprogram verificationsymbolic-numeric hybrid method

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Related Items

Reachable set estimation and safety verification of nonlinear systems via iterative sums of squares programming ⋮ Proving total correctness and generating preconditions for loop programs via symbolic-numeric computation methods ⋮ Synthesizing ranking functions for loop programs via SVM

Uses Software

• RAGlib
• Sostools
• SeDuMi
• YALMIP
• DISCOVERER

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recent advances in program verification through computer algebra
• Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
• On the complexity of Putinar's Positivstellensatz
• Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems
• The Computational Complexity of Simultaneous Diophantine Approximation Problems
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Computer Aided Verification
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation
• Termination of Integer Linear Programs
• On Computable Numbers, with an Application to the Entscheidungsproblem
• CONCUR 2005 – Concurrency Theory
• Verification, Model Checking, and Abstract Interpretation