Back to Search
Start Over
Decidable Synthesis of Programs with Uninterpreted Functions
- Publication Year :
- 2019
-
Abstract
- 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 yield decidable verification. We formulate a powerful grammar-restricted (syntax-guided) synthesis problem for coherent uninterpreted programs, and we show the problem to be decidable, identify its precise complexity, and also study several variants of the problem.
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.1910.09744
- Document Type :
- Working Paper
- Full Text :
- https://doi.org/10.1007/978-3-030-53291-8_32