A method for testing and debugging distributed applications

Abstract

The paper presents a method which can be used to verify properties of asynchronous distributed algorithms and programs during their execution. The method can detect an occurrence of either stable global predicates or unstable strong or weak global predicates which are a conjunction of locally detectable predicates. Unstable predicates can be detected even if the observed run of the distributed program does not contain global states which fulfil the predicate. An example of a CORBA-based distributed debugger implementation serves as a feasibility study of the presented method.