An efficient distributed online algorithm to detect strong conjunctive predicates

Loon Been Chen*, I-Chen Wu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

Detecting strong conjunctive predicates is a fundamental problem in debugging and testing distributed programs. A strong conjunctive predicate is a logical statement to represent the desired event of the system. Therefore, if the predicate is not true, an error may occur because the desired event does not happen. Recently, several reported detection algorithms reveal the problem of unbounded state queue growth since the system may generate a huge amount of execution states in a very short time. In order to solve this problem, this paper introduces the notion of removable states which can be disregarded in the sense that detection results still remain correct. A fully distributed algorithm is developed in this paper to perform the detection in an online manner. Based on the notion of removable states, the time complexity of the detection algorithm is improved as the number of states to be evaluated is reduced.

Original languageEnglish
Pages (from-to)1077-1084
Number of pages8
JournalIEEE Transactions on Software Engineering
Volume28
Issue number11
DOIs
StatePublished - 1 Nov 2002

Keywords

  • Conjunctive predicate
  • Distributed debugging
  • Distributed system
  • Global predicate detection

Fingerprint Dive into the research topics of 'An efficient distributed online algorithm to detect strong conjunctive predicates'. Together they form a unique fingerprint.

Cite this