Generalized homogeneous polynomials for efficient template-based nonlinear invariant synthesis
From MaRDI portal
Publication:5915714
DOI10.1007/978-3-662-53413-7_14zbMath1394.68076arXiv1604.07201OpenAlexW2460148525MaRDI QIDQ5915714
Kensuke Kojima, Minoru Kinoshita, Kohei Suenaga
Publication date: 27 August 2018
Published in: Theoretical Computer Science, Static Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.07201
Symbolic computation and algebraic computation (68W30) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (1)
Uses Software
Cites Work
- Smooth parametrizations for several cases of the Positivstellensatz
- Computing polynomial program invariants
- Generating all polynomial invariants in simple loops
- A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
- Generating Non-linear Interpolants by Semidefinite Programming
- Hyperstream processing systems
- Programming with Infinitesimals: A While-Language for Hybrid System Modeling
- Non-linear loop invariant generation using Gröbner bases
- Constraint-Based Approach for Analysis of Hybrid Systems
- Sharper and Simpler Nonlinear Interpolants for Program Verification
- Generalized homogeneous polynomials for efficient template-based nonlinear invariant synthesis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Generalized homogeneous polynomials for efficient template-based nonlinear invariant synthesis