用于在线监测的可靠并发轨迹技术报告
Sound Concurrent Traces for Online Monitoring Technical Report
AI总结:
本文提出非阻塞向量时钟算法与运行时可监测性判定条件,并在 FACTS 中实现,以在线收集可靠的并发程序轨迹。
摘要:
监测并发程序通常依赖于收集轨迹以抽象程序执行。然而,现有面向一般行为属性的方法要么并非为在线监测量身定制,要么已不再维护,要么实现了朴素的插桩,往往导致不可靠的判定。我们首先定义轨迹何时能够代表一次并发执行的概念。随后,我们提出一种非阻塞向量时钟算法,用于在运行过程中收集可靠的并发轨迹,以反映事件之间的偏序关系。此外,代表性轨迹中的并发事件会给由全序形式化方法综合生成的监测器带来可靠性问题。为此,我们从监测器中提取因果依赖关系,以检查轨迹是否具备所需的顺序,并定义在运行时判断所收集轨迹何时可监测的条件。我们将这些贡献实现于名为 FACTS 的工具中,该工具对编译为 Java 字节码的程序进行插桩,构建可靠的代表性轨迹,并就不可监测的轨迹向监测器发出警告。我们对本工作进行了评估,并与现有方法进行了比较。
英文摘要:
Monitoring concurrent programs typically rely on collecting traces to abstract program executions. However, existing approaches targeting general behavioral properties are either not tailored for online monitoring, are no longer maintained, or implement naive instrumentation that often leads to unsound verdicts. We first define the notion of when a trace is representative of a concurrent execution. We then present a non-blocking vector clock algorithm to collect sound concurrent traces on the fly reflecting the partial order between events. Moreover, concurrent events in the representative trace pose a soundness problem for monitors synthesized from total order formalisms. For this, we extract a causal dependence relation from the monitor to check if the trace has the needed orderings and define the conditions to decide at runtime when a collected trace is monitorable. We implement our contributions in a tool, FACTS, which instruments programs compiling to Java bytecode, constructs sound representative traces, and warns the monitor about non-monitorable traces. We evaluate our work and compare it with existing approaches.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。