Debugging of Distributed Programs

这是对调试分布式程序中的问题的调查 有大量的进程。 现有分布式调试 系统是顺序调试系统的简单扩展， 不足以支持基于消息的分布式程序。 分布式程序本质上不同于顺序程序 由于非确定性、并发性和通信的存在， 延误了. 分布式调试的研究支持基于状态的 和基于事件的调试方法。 国家基础是 主要通过使用断点谓词检测来支持。 逻辑 断点谓词的规范最能体现 分布式环境中全局跟踪的有用属性。 的 逻辑被适当地定义为允许有效地检测全局 没有out的谓词采用全局快照的计算。 已经开发了算法来检测表示的全局谓词 作为简单的合取、析取或局部谓词序列。 这些机制可以检测由 逻辑，即使谓词是不稳定的。 主要目标是 为了将这些算法扩展到更一般的全局 谓词。

This is an investigation of issues in debugging distributed programs with large numbers of processes. Existing distributed debugging systems are simple extensions of sequential debugging systems and are inadequate for supporting message-based distributed programs. Distributed programs are inherently different from sequential programs due to the presence of nondeterminism, concurrency and communication delays. The research in distributed debugging supports both state-based and event-based approaches for debugging. The state-based is supported mainly by use of breakpoint predicates detection. A logic for specification of breakpoint predicates characterizes the most useful properties of global traces in a distributed environment. The logic is suitably defined to permit efficient detection of global predicates with out resort to computation of global snapshots. Algorithms have been developed to detect global predicates expressed as simple conjunction, disjunction or sequence of local predicates. These mechanisms can detect a large subset of predicates defined by the logic, even if the predicates are unstable. The main objective is to extend these algorithms for applicability to more general global predicates.