Formal Software Verification Measures Up: Verified coding techniques use mathematical proofs to ensure code is error-free and hacker-resistant. Can the approach revolutionize software?
The article examines whether the use of mathematical proofs in the process of verified coding can be applied to error-free coding and computer hacker resistance in order to improve and advance the development of computer software.
| Publicado en: | Communications of the ACM Vol. 64; no. 7; pp. 13 - 16 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Jul2021
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| Sumario: | The article examines whether the use of mathematical proofs in the process of verified coding can be applied to error-free coding and computer hacker resistance in order to improve and advance the development of computer software. |
|---|