Reducing bounded realizability analysis to reachability checking

DOI10.1007/978-3-319-24537-9_13MaRDI QIDQ1675160zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Bounded model checking of infinite state systems
• Bounded model checking for timed automata
• Verification, Model Checking, and Abstract Interpretation
• Bounded synthesis of reactive programs
• Model checking techniqes for the analysis of reactive systems

Cited in

(3)

• Theoretical Computer Science
• Tableaux for realizability of safety specifications
• Encodings of bounded synthesis

This page was built for publication: Reducing bounded realizability analysis to reachability checking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675160)