Salvato in:
| Autori principali: | , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2504.14561 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915251520274432 |
|---|---|
| author | Riesco, Adrian Ogata, Kazuhiro Nakamura, Masaki Gaina, Daniel Tran, Duong Dinh Futatsugi, Kokichi |
| author_facet | Riesco, Adrian Ogata, Kazuhiro Nakamura, Masaki Gaina, Daniel Tran, Duong Dinh Futatsugi, Kokichi |
| contents | Proof scores can be regarded as outlines of the formal verification of system properties. They have been historically used by the OBJ family of specification languages. The main advantage of proof scores is that they follow the same syntax as the specification language they are used in, so specifiers can easily adopt them and use as many features as the particular language provides. In this way, proof scores have been successfully used to prove properties of a large number of systems and protocols. However, proof scores also present a number of disadvantages that prevented a large audience from adopting them as proving mechanism. In this paper we present the theoretical foundations of proof scores; the different systems where they have been adopted and their latest developments; the classes of systems successfully verified using proof scores, including the main techniques used for it; the main reasons why they have not been widely adopted; and finally we discuss some directions of future work that might solve the problems discussed previously. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_14561 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Proof Scores: A Survey (full version) Riesco, Adrian Ogata, Kazuhiro Nakamura, Masaki Gaina, Daniel Tran, Duong Dinh Futatsugi, Kokichi Logic in Computer Science Proof scores can be regarded as outlines of the formal verification of system properties. They have been historically used by the OBJ family of specification languages. The main advantage of proof scores is that they follow the same syntax as the specification language they are used in, so specifiers can easily adopt them and use as many features as the particular language provides. In this way, proof scores have been successfully used to prove properties of a large number of systems and protocols. However, proof scores also present a number of disadvantages that prevented a large audience from adopting them as proving mechanism. In this paper we present the theoretical foundations of proof scores; the different systems where they have been adopted and their latest developments; the classes of systems successfully verified using proof scores, including the main techniques used for it; the main reasons why they have not been widely adopted; and finally we discuss some directions of future work that might solve the problems discussed previously. |
| title | Proof Scores: A Survey (full version) |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2504.14561 |