Iteratively Composing Statically Verified Traits
Static verification relying on an automated theorem prover can be very slow and brittle: since static verification is undecidable, correct code may not pass a particular static verifier. In this work we use metaprogramming to generate code that is correct by construction. A theorem prover is used on...
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
Open Publishing Association
2019-08-01
|
| Colección: | Electronic Proceedings in Theoretical Computer Science |
| Acceso en línea: | http://arxiv.org/pdf/1902.09685v2 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|