Reducing bounded realizability analysis to reachability checking

DOI10.1007/978-3-319-24537-9_13zbMath1471.68154OpenAlexW2404999800MaRDI QIDQ1675160

Masaya Shimakawa, Shigeki Hagihara, Naoki Yonezaki

Publication date: 27 October 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-24537-9_13

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Tableaux for realizability of safety specifications, Encodings of Bounded Synthesis