The SemGuS Toolkit
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910470376521728 |
|---|---|
| author | Johnson, Keith J. C. Reynolds, Andrew Reps, Thomas D'Antoni, Loris |
| author_facet | Johnson, Keith J. C. Reynolds, Andrew Reps, Thomas D'Antoni, Loris |
| contents | Semantics-Guided Synthesis (SemGuS) is a programmable framework for defining synthesis problems in a domain- and solver-agnostic way. This paper presents the standardized SemGuS format, together with an open-source toolkit that provides a parser, a verifier, and enumerative SemGuS solvers. The paper also describes an initial set of SemGuS benchmarks, which form the basis for comparing SemGuS solvers, and presents an evaluation of the baseline enumerative solvers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_01792 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The SemGuS Toolkit Johnson, Keith J. C. Reynolds, Andrew Reps, Thomas D'Antoni, Loris Programming Languages Semantics-Guided Synthesis (SemGuS) is a programmable framework for defining synthesis problems in a domain- and solver-agnostic way. This paper presents the standardized SemGuS format, together with an open-source toolkit that provides a parser, a verifier, and enumerative SemGuS solvers. The paper also describes an initial set of SemGuS benchmarks, which form the basis for comparing SemGuS solvers, and presents an evaluation of the baseline enumerative solvers. |
| title | The SemGuS Toolkit |
| topic | Programming Languages |
| url | https://arxiv.org/abs/2406.01792 |