2021
DOI: 10.48550/arxiv.2102.02679
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Certifying Differential Equation Solutions from Computer Algebra Systems in Isabelle/HOL

Abstract: The Isabelle/HOL proof assistant has a powerful library for continuous analysis, which provides the foundation for verification of hybrid systems. However, Isabelle lacks automated proof support for continuous artifacts, which means that verification is often manual. In contrast, Computer Algebra Systems (CAS), such as Mathematica and SageMath, contain a wealth of efficient algorithms for matrices, differential equations, and other related artifacts. Nevertheless, these algorithms are not verified, and thus th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 19 publications
0
3
0
Order By: Relevance
“…Existing verification techniques for CAS often focus on specific subroutines or functions [6,7,13,21,25,26,30,31], such as a specific theorems [28], differential equations [23], or the implementation of the math.h library [29]. Most common are verification approaches that rely on intermediate verification languages [6,21,23,25,26], such as Boogie [2,30] or Why3 [5,26], which, in turn, rely on proof assistants and theorem provers, such as Coq [4,6], Isabelle [23,33], or HOL Light [20,21,25]. Kaliszyk and Wiedijk [25] proposed on entire new CAS which is built on top of the proof assistant HOL Light so that each simplification step can be proven by the underlying architecture.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Existing verification techniques for CAS often focus on specific subroutines or functions [6,7,13,21,25,26,30,31], such as a specific theorems [28], differential equations [23], or the implementation of the math.h library [29]. Most common are verification approaches that rely on intermediate verification languages [6,21,23,25,26], such as Boogie [2,30] or Why3 [5,26], which, in turn, rely on proof assistants and theorem provers, such as Coq [4,6], Isabelle [23,33], or HOL Light [20,21,25]. Kaliszyk and Wiedijk [25] proposed on entire new CAS which is built on top of the proof assistant HOL Light so that each simplification step can be proven by the underlying architecture.…”
Section: Related Workmentioning
confidence: 99%
“…For [11, (18.17.47)], WED (Mathematica's kernel) ran into a segmentation fault (core dumped) for n > 1. The kernel of the full version of Mathematica gracefully died without returning an output 23 .…”
Section: Error Analysismentioning
confidence: 99%
“…While the proof methods so far describe the second workflow using framed versions of the inference rule of dL, the first workflow of the framework [4] supports verification with certified solutions (flows), which can be supplied using a CAS [37]. We have developed a proof method called local-flow for certifying that a flow is the unique solution to an ODE.…”
Section: Local-flowmentioning
confidence: 99%