arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2403.03057cs.FL
收藏

基于交互的高效分布式系统离线运行时验证:生命线移除

Efficient Interaction-Based Offline Runtime Verification of Distributed Systems with Lifeline Removal

Erwan Mahe, Boutheina Bannour, Christophe Gaston, Pascale Le Gall

AI总结:

针对分布式系统多轨迹观察结束时刻难以同步的问题,提出带生命线移除的离线交互运行时验证算法,并用 POR 与 LOC 优化验证效率。

摘要:

运行时验证(RV)是指一类技术,通过观察系统执行并将其与形式化规约进行对照,以识别故障。在离线 RV 中,观察在第一步完成,验证则在第二步基于观察期间收集的静态产物进行。本文定义了一种针对分布式系统(DS)、依据交互进行离线 RV 的方法。交互是描述 DS 内部通信的形式化模型。DS 由部署在不同机器上并通过消息传递进行交互的多个子系统组成。因此,观察 DS 的执行需要记录一组本地执行轨迹,每个子系统对应一条,我们称之为多轨迹。分析多轨迹的一个主要挑战是,没有实用方法能够同步所有本地轨迹观察结束的时刻。我们通过一种称为生命线移除的操作来解决该问题:一旦某条本地轨迹被完整分析,就在验证过程中即时地对规约应用该操作。该操作会从交互中移除发生在不再被观察的子系统上的动作规约。通过消除由动作偏序导致的死锁,这可能使规约能够继续执行。我们证明了所得 RV 算法的正确性,并介绍了两种优化技术,同时也证明了它们的正确性。我们通过选择一个唯一无歧义动作(作为线性化的唯一起始步骤)实现了偏序归约(POR)技术,而该动作是否存在由生命线移除算子的另一种用途来确定。此外,本地分析(LOC),即对本地轨迹的验证,可在全局多轨迹分析期间加以利用,从而更快地证明失败。实验展示了我们的 RV 方法的应用以及优化带来的收益。

英文摘要:

Runtime Verification (RV) refers to a family of techniques in which system executions are observed and confronted to formal specifications, with the aim of identifying faults. In Offline RV, observation is done in a first step and verification in a second, on a static artifact collected during observation. In this paper, we define an approach to offline RV of Distributed Systems (DS) against interactions. Interactions are formal models describing communications within a DS. DS are composed of subsystems deployed on different machines and interacting via message passing. Therefore, observing executions of a DS entails logging a collection of local execution traces, one for each subsystem, that we call a multi-trace. A major challenge in analyzing multi-traces is that there are no practical means to synchronize the ends of observations of all local traces. We address this via an operation, called lifeline removal, which we apply on-the-fly on the specification during verification once a local trace has been entirely analyzed. This operation removes from the interaction the specification of actions occurring on the subsystem that is no-longer observed. This may allow further execution of the specification via removing deadlocks due to the partial orders of actions. We prove the correctness of the resulting RV algorithm and introduce two optimization techniques which we also prove correct. We implement a Partial Order Reduction (POR) technique via the selection of a one-unambiguous action (as a unique first step to a linearization) which existence is determined via another use of the lifeline removal operator. Additionally, Local Analyses (LOC) i.e., the verification of local traces, can be leveraged during the global multi-trace analysis to prove failure more quickly. Experiments illustrate the application of our RV approach and the benefits of our optimizations.

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

↑