Wird geladen...
Decidable Synthesis of Programs with Uninterpreted Functions
We identify a decidable synthesis problem for a class of programs of unbounded size with conditionals and iteration that work over infinite data domains. The programs in our class use uninterpreted functions and relations, and abide by a restriction called coherence that was recently identified to y...
Gespeichert in:
| Veröffentlicht in: | Computer Aided Verification |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
2020
|
| Schlagworte: | |
| Online Zugang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7363337/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-53291-8_32 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|