Good-enough synthesis
From MaRDI portal
Publication:2226757
DOI10.1007/978-3-030-53291-8_28zbMath1478.68141arXiv2109.03594OpenAlexW3042524226MaRDI QIDQ2226757
Shaull Almagor, Orna Kupferman
Publication date: 9 February 2021
Full work available at URL: https://arxiv.org/abs/2109.03594
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct, Synthesizing Computable Functions from Rational Specifications Over Infinite Words
