Reducing Bounded Realizability Analysis to Reachability Checking-Reference-Cited by-同舟云学术

Reducing Bounded Realizability Analysis to Reachability Checking

Published:2015 Issue: Volume: Page:140-152
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Shimakawa Masaya,Hagihara Shigeki,Yonezaki Naoki

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-24537-9_13

Reference27 articles.

1. Lecture Notes in Computer Science;M Abadi,1989

2. Aoshima, T., Yonezaki, N.: Verification of reactive system specifications with outer event conditional formula. In: Proc. International Symposium on Principles of Software Evolution, pp. 189–193 (2000)

3. Armoni, R., Fix, L., Fraer, R., Huddleston, S., Piterman, N., Vardi, M.Y.: SAT-based induction for temporal safety properties. Electr. Notes Theor. Comput. Sci. 119(2), 3–16 (2005)

4. Lecture Notes in Computer Science;A Biere,1999

5. Boas, P.V.E.: The convenience of tilings. In: Complexity, Logic, and Recursion Theory. Lecture Notes in Pure and Applied Mathematics, vol. 187, pp. 331–363 (1997)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Tableaux for Realizability of Safety Specifications;Formal Methods;2023

2. Towards Interpretation of Abstract Instructions Using Declarative Constraints in Temporal Logic;Proceedings of the 2020 9th International Conference on Software and Computer Applications;2020-02-18

3. Towards Efficient Implementation of Realizability Checking for Reactive System Specifications;Proceedings of the 2019 8th International Conference on Software and Computer Applications;2019-02-19

4. Efficiency of the strong satisfiability checking procedure for reactive system specifications;AIP Conference Proceedings;2018

5. Encodings of Bounded Synthesis;Tools and Algorithms for the Construction and Analysis of Systems;2017