Proving unrealizability for syntax-guided synthesis

DOI10.1007/978-3-030-25540-4_18arXiv1905.05800OpenAlexW2961192361MaRDI QIDQ6194585

Loris D'Antoni, Thomas W. Reps, Jason Breck, Qinheping Hu, John Cyphert

Publication date: 16 February 2024

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.05800

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (1)

Approximate bit dependency analysis to identify program synthesis problems as infeasible

This page was built for publication: Proving unrealizability for syntax-guided synthesis