Automata-Based Verification of Temporal Properties on Running Programs

  • Authors:
  • Dimitra Giannakopoulou;Klaus Havelund

  • Affiliations:
  • -;-

  • Venue:
  • Proceedings of the 16th IEEE international conference on Automated software engineering
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents an approach to checking arunning program against Linear Temporal Logic (LTL)specifications. LTL is a widely used logic for expressingproperties of programs viewed as sets of executions. Ourapproach consists of translating LTL formulae to finite-stateautomata, which are used as observers of theprogram behavior. The translation algorithm we proposemodifies standard LTL to Büchi automata conversiontechniques to generate automata that check finiteprogram traces. The algorithm has been implemented in atool, which has been integrated with the generic JPaXframework for runtime analysis of Java programs.