Rewriting-Based Techniques for Runtime Verification

Abstract

Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are infinite traces, finite traces appear naturally when testing and/or monitoring real applications that only run for limited time periods. A finite trace variant of LTL is formally… (More)
DOI: 10.1007/s10515-005-6205-y

Topics

6 Figures and Tables

Statistics

01020'05'07'09'11'13'15'17
Citations per Year

164 Citations

Semantic Scholar estimates that this publication has 164 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Rosu2005RewritingBasedTF, title={Rewriting-Based Techniques for Runtime Verification}, author={Grigore Rosu and Klaus Havelund}, journal={Automated Software Engineering}, year={2005}, volume={12}, pages={151-197} }