paperbot · PL 论文追踪

全部论文 待读 收藏

P2 It's Not a Feature, It's a Bug: Fault-Tolerant Model Mining from Noisy Data

这不是特性,而是 Bug:从噪声数据中进行容错模型挖掘
ICSE Proceedings of the IEEE/ACM 46th International Conference on Software Engineering2024匹配度 3/10 · 论文使用 Partial Max-SAT 从含噪轨迹中挖掘确定自动机,属于形式化方法/逻辑约束求解与工业落地方向,与用户对形式化和工程实现的偏好有微弱交集;但核心主题是模型挖掘与自动机推断,不涉及 LLM/Agent、静态分析 for ML/Agentic、浮点程序分析或贝叶斯程序分析,因此与画像匹配度较低。引用 5 inbox
Felix Wallner, Bernhard K. Aichernig, Christian Burghard
crossref: 2026-09-12

AI 速览

一句话:提出用 Partial Max-SAT 从含噪执行轨迹中挖掘确定自动机,允许忽略最少故障观测且无需预处理。

从数据中挖掘模型在工业界应用广泛,但现有推断方法多假设行为完全确定,面对消息丢失或环境因素导致的噪声轨迹时效果不佳。本文提出一种容错模型挖掘方法,将含噪执行轨迹上的自动机推断编码为 Partial Max-SAT 问题,在保证自动机确定性的同时,允许忽略最少数量、最可能出错的观测,且无需对数据做预处理。作者评估了方法性能及若干实用考量,并在三个工业案例中推断出正确模型,表明该方法能有效处理实际噪声数据。

问题
实际执行轨迹常因消息丢失等故障而含噪,现有确定性模型推断算法难以处理,导致无法构建正确模型。
方法
将自动机推断编码为 Partial Max-SAT,通过软约束容忍最少故障观测,直接从未预处理噪声轨迹中推断最佳确定自动机。
评估
评估方法性能及实用考量,并在三个工业用例中成功推断出正确模型。
原文摘要(Abstract)

The mining of models from data finds widespread use in industry. There exists a variety of model inference methods for perfectly deterministic behaviour, however, in practice, the provided data often contains noise due to faults such as message loss or environmental factors that many of the inference algorithms have problems dealing with. We present a novel model mining approach using Partial Max-SAT solving to infer the best possible automaton from a set of noisy execution traces. This approach enables us to ignore the minimal number of presumably faulty observations to allow the construction of a deterministic automaton. No pre-processing of the data is required. The method's performance as well as a number of considerations for practical use are evaluated, including three industrial use cases, for which we inferred the correct models.

链接与引用

DOI 原文 · PDF(开放获取) ·

BibTeX
@inproceedings{paperbot11283,
  title = {It's Not a Feature, It's a Bug: Fault-Tolerant Model Mining from Noisy Data},
  author = {Felix Wallner and Bernhard K. Aichernig and Christian Burghard},
  booktitle = {ICSE},
  year = {2024},
  doi = {10.1145/3597503.3623346}
}