Learning Minimal Separating DFA’s for Compositional Verification-Reference-Cited by-同舟云学术

Learning Minimal Separating DFA’s for Compositional Verification

Published:2009 Issue: Volume: Page:31-45
ISSN:0302-9743
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

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

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-00768-2_3

Reference18 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. Angluin, D.: Negative results for equivalence queries. Machine Learning 5(2), 121–150 (1990)

4. Barringer, H., Giannakopoulou, D., Păsăreanu, C.S.: Proof rules for automated compositional verification through learning. In: SAVCBS 2003, pp. 14–21 (2003)

5. Lecture Notes in Computer Science;S. Chaki,2005

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

1. DFAMiner: Mining Minimal Separating DFAs from Labelled Samples;Lecture Notes in Computer Science;2024-09-13

2. Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages;Lecture Notes in Computer Science;2024

3. LTL Learning on GPUs;Lecture Notes in Computer Science;2024

4. Towards Strengthening Formal Specifications with Mutation Model Checking;Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2023-11-30

5. Assume, guarantee or repair: a regular framework for non regular properties;International Journal on Software Tools for Technology Transfer;2022-09-29