arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2011.07630cs.FLcs.LG

Safety Synthesis Sans Specification

TU Graz(格拉茨技术大学);King’s College London(伦敦国王学院);Ben-Gurion University(本-古里安大学);EPFL(洛桑联邦理工学院)

Roderick Bloem, Hana Chockler, Masoud Ebrahimi, Dana Fisman, Heinz Riener

英文摘要:

We define the problem of learning a transducer ${S}$ from a target language $U$ containing possibly conflicting transducers, using membership queries and conjecture queries. The requirement is that the language of ${S}$ be a subset of $U$. We argue that this is a natural question in many situations in hardware and software verification. We devise a learning algorithm for this problem and show that its time and query complexity is polynomial with respect to the rank of the target language, its incompatibility measure, and the maximal length of a given counterexample. We report on experiments conducted with a prototype implementation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑