Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages-Reference-Cited by-同舟云学术

Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages

Published: Issue: Volume: Page:2-17
ISSN:
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Farzan Azadeh,Chen Yu-Fang,Clarke Edmund M.,Tsay Yih-Kuen,Wang Bow-Yaw

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-78800-3_2.pdf

Reference21 articles.

1. Lecture Notes in Computer Science;R. Alur,2005

2. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(2), 87–106 (1987)

3. Arnold, A.: A syntactic congruence for rational omega-language. Theoretical Computer Science 39, 333–335 (1985)

4. Büchi, J.R.: On a decision method in restricted second-order arithmetic. In: Proceedings of the 1960 International Congress on Logic, Methodology and Philosophy of Science, pp. 1–11 (1962)

5. Lecture Notes in Computer Science;H. Calbrix,1994

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

1. A Novel Family of Finite Automata for Recognizing and Learning $$\omega $$-Regular Languages;Automated Technology for Verification and Analysis;2023

2. Prophecy Variables for Hyperproperty Verification;2022 IEEE 35th Computer Security Foundations Symposium (CSF);2022-08

3. Learning infinite-word automata with loop-index queries;Artificial Intelligence;2022-06

4. A novel learning algorithm for Büchi automata based on family of DFAs and classification trees;Information and Computation;2021-12

5. Learning real-time automata;Science China Information Sciences;2021-08-05