Loading...
Verifying a Solver for Linear Mixed Integer Arithmetic in Isabelle/HOL
We implement a decision procedure for linear mixed integer arithmetic and formally verify its soundness in Isabelle/HOL. We further integrate this procedure into one application, namely into CeTA, a formally verified certifier to check untrusted termination proofs. This checking involves assertions...
Na minha lista:
| Udgivet i: | NASA Formal Methods |
|---|---|
| Main Authors: | , , , |
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
2020
|
| Fag: | |
| Online adgang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7705985/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-55754-6_14 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|