Complete Algorithms for Algebraic Strongest Postconditions and Weakest Preconditions in Polynomial ODE’S
From MaRDI portal
Publication:5127191
DOI10.1007/978-3-319-73117-9_31zbMath1450.12004arXiv1708.05377OpenAlexW4253917916MaRDI QIDQ5127191
Publication date: 21 October 2020
Published in: SOFSEM 2018: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.05377
Nonlinear ordinary differential equations and systems (34A34) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Abstract differential equations (12H20) Software, source code, etc. for problems pertaining to ordinary differential equations (34-04)
Related Items (4)
Algebra, Coalgebra, and Minimization in Polynomial Differential Equations ⋮ Automatic pre- and postconditions for partial differential equations ⋮ A linear-algebraic method to compute polynomial PDE conservation laws ⋮ On the Coalgebra of Partial Differential Equations
This page was built for publication: Complete Algorithms for Algebraic Strongest Postconditions and Weakest Preconditions in Polynomial ODE’S
