Nalaganje...
What’s Decidable About Program Verification Modulo Axioms?
We consider the decidability of the verification problem of programs modulo axioms — automatically verifying whether programs satisfy their assertions, when the function and relation symbols are interpreted as arbitrary functions and relations that satisfy a set of first-order axioms. Though verific...
Shranjeno v:
| izdano v: | Tools and Algorithms for the Construction and Analysis of Systems |
|---|---|
| Main Authors: | , , |
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
2020
|
| Teme: | |
| Online dostop: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7480692/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-45237-7_10 |
| Oznake: |
Označite
Brez oznak, prvi označite!
|