Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Semidefinite programming (SDP) solvers are increasingly used as primitives in many program verification tasks to synthesize and verify polynomial invariants for a variety of systems including programs, hybrid systems and stochastic models. On one hand, they provide a tractable alternative to reasoning about semi-algebraic constraints. Hover, the results are often unreliable due to " numerical issues " that include a large number of reasons such as floating-point errors, ill-conditioned problems, failure of strict feasibility, and more generally, the specifics of the algorithms used to solve SDPs. These issues influence whether the final numerical results are trustworthy or not. ,  briefly survey the emerging use of SDP solvers in the static analysis community.  report on the perils of using SDP solvers for common invariant synthesis tasks, characterizing the common failures that can lead to unreliable ansrs. Next,  demonstrate existing tools for guaranteed semidefinite programming that often prove inadequate to our needs. Finally,  present a solution for verified semidefinite programming that can be used to check the reliability of the solution output by the solver and a padding procedure that can check the presence of a feasible nearby solution to the one output by the solver.  report on some successful preliminary experiments involving our padding procedure.
['Pierre Roux', 'Yuen-Lam Voronin', 'Sriram Sankaranarayanan']
I am writing a research paper on a idea Validating Numerical Semidefinite Programming Solvers for Polynomial Invariants
[{"from": "human", "value": "I am writing a research paper on a idea Validating Numerical Semidefinite Programming Solvers for Polynomial Invariants"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Semidefinite programming (SDP) solvers are increasingly used as primitives in many program verification tasks to synthesize and verify polynomial invariants for a variety of systems including programs, hybrid systems and stochastic models. On one hand, they provide a tractable alternative to reasoning about semi-algebraic constraints. Hover, the results are often unreliable due to \" numerical issues \" that include a large number of reasons such as floating-point errors, ill-conditioned problems, failure of strict feasibility, and more generally, the specifics of the algorithms used to solve SDPs. These issues influence whether the final numerical results are trustworthy or not. ,  briefly survey the emerging use of SDP solvers in the static analysis community.  report on the perils of using SDP solvers for common invariant synthesis tasks, characterizing the common failures that can lead to unreliable ansrs. Next,  demonstrate existing tools for guaranteed semidefinite programming that often prove inadequate to our needs. Finally,  present a solution for verified semidefinite programming that can be used to check the reliability of the solution output by the solver and a padding procedure that can check the presence of a feasible nearby solution to the one output by the solver.  report on some successful preliminary experiments involving our padding procedure."}]