Verifying trustworthiness requirements in distributed systems with formal log-file analysis

The paper reports on an analysis technology based on the tracing approach to test trustworthy requirements of a distributed system. The system under test is instrumented such that it generates events at runtime to enable reasoning about the implementation of these requirements in a later step. Specifically, an event log collected during a system run is converted into a specification of the system. The (trustworthy) requirements of the system must be formally specified by an expert who has sufficient knowledge about the behaviour of the system. The reengineered model of the system and the requirement descriptions are then processed by an off-the-shelf model checker. The model checker generates scenarios that visualize fulfilments or violations of the requirements. A complex example of a concurrent system serves as a case study.

[1]  David C. Luckham,et al.  Complex Event Processing in Distributed Systems , 1998 .

[2]  Thomas Kunz,et al.  Linking Specification, Abstraction, and Debugging , 1993 .

[3]  Eugene H. Spafford,et al.  An Application of Pattern Matching in Intrusion Detection , 1994 .

[4]  Michel Raynal,et al.  On the Fly Testing of Regular Patterns in Distributed Computations , 1994, 1994 Internatonal Conference on Parallel Processing Vol. 2.

[5]  Siegfried Fischer,et al.  Verification in process algebra of the distributed control of track vehicles—A case study , 1994, Formal Methods Syst. Des..

[6]  Thierry Jéron,et al.  A general approach to trace-checking in distributed computing systems , 1994, 14th International Conference on Distributed Computing Systems.

[7]  Lori A. Clarke,et al.  Data flow analysis for verifying properties of concurrent programs , 1994, SIGSOFT '94.

[8]  Alexandre Petrenko,et al.  Using SDL Tools to Test Properties of Distributed Systems , 2001 .

[9]  Leslie Lamport,et al.  Distributed snapshots: determining global states of distributed systems , 1985, TOCS.

[10]  Paul A. S. Ward.  A framework algorithm for dynamic, centralized dimension-bounded timestamps , 2000, CASCON.

[11]  Dirk Taubner,et al.  Verification in Process Algebra of the Distributed Control of Track Vehicles - A Case Study , 1992, CAV.

[12]  George S. Avrunin,et al.  Patterns in property specifications for finite-state verification , 1999, Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002).

[13]  B. Algayres,et al.  GOAL: Observing SDL behaviors with GEODE , 1995 .

[14]  Jong-Deok Choi,et al.  Breakpoints and halting in distributed programs , 1988, [1988] Proceedings. The 8th International Conference on Distributed.