通过Monads优化自动机学习
Optimizing Automata Learning via Monads
摘要:
自动机学习已经成功地应用于硬件和软件的验证。学习的自动机模型的大小是可扩展性的瓶颈,因此能够学习紧凑表示的优化非常重要。本文利用单子,作为一个数学结构和编程构造,设计,证明正确,并实现了广泛的一类这样的优化。前一种观点允许我们开发一种新的算法和相应的正确性证明,建立在基于范畴理论的自动机学习的一般框架之上。新算法是一个单子上的参数,它提供了一个丰富的代数结构来捕捉非确定性和其他副作用。我们表明,我们的方法允许我们统一捕获现有的算法,开发新的,并添加优化。后一种观点使我们能够毫不费力地将理论转化为实践:我们提供了一个实现我们的通用框架的Haskell库,并显示了两个特定实例的实验结果:非确定性和加权自动机。
英文摘要:
Automata learning has been successfully applied in the verification of hardware and software. The size of the automaton model learned is a bottleneck for scalability, and hence optimizations that enable learning of compact representations are important. This paper exploits monads, both as a mathematical structure and a programming construct, to design, prove correct, and implement a wide class of such optimizations. The former perspective on monads allows us to develop a new algorithm and accompanying correctness proofs, building upon a general framework for automata learning based on category theory. The new algorithm is parametric on a monad, which provides a rich algebraic structure to capture non-determinism and other side-effects. We show that our approach allows us to uniformly capture existing algorithms, develop new ones, and add optimizations. The latter perspective allows us to effortlessly translate the theory into practice: we provide a Haskell library implementing our general framework, and we show experimental results for two specific instances: non-deterministic and weighted automata.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。