Runtime Analysis of Linear Temporal Logic Specifications

Authors:
Dimitra Giannakopoulou;Klaus Havelund
Affiliations:
-;-
Venue:
Runtime Analysis of Linear Temporal Logic Specifications
Year:
2001

Citing 0
Cited 5

DeSpec: Modeling the Windows Driver Environment11This work was partially supported by the Czech Academy of Sciences project 1ET400300504 and the Grant Agency of the Czech Republic project GD201/05/H014.

Electronic Notes in Theoretical Computer Science (ENTCS)
The good, the bad, and the ugly, but how ugly is ugly?

RV'07 Proceedings of the 7th international conference on Runtime verification
Runtime Verification for LTL and TLTL

ACM Transactions on Software Engineering and Methodology (TOSEM)
Component-based analysis of embedded control applications

Innovations in Systems and Software Engineering
Processing flows of information: From data stream to complex event processing

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This report presents an approach to checking a running program against its Linear Temporal Logic (LTL) specifications. LTL is a widely used logic for expressing properties of programs viewed as sets of executions. Our approach consists of translating LTL formulae to finite-state automata, which are used as observers of the program behavior. The translation algorithm we propose modifies standard LTL to Buchi automata conversion techniques to generate automata that check finite program traces. The algorithm has been implemented in a tool, which has been integrated with the generic JPaX framework for runtime analysis of Java programs.