Testing Linear Temporal Logic Formulae on Finite Execution Traces

Testing Linear Temporal Logic Formulae on Finite Execution Traces (2001)

by Klaus Havelund , Grigore Rosu

Citations:

11 - 6 self

User correction supplied by mph

Datum	Value	Source
TITLE	Testing Linear Temporal Logic Formulae on Finite Execution Traces	user correction - Legacy Corrections
AUTHOR NAME	Klaus Havelund	user correction
AUTHOR AFFIL	NASA Ames Research Center	user correction
AUTHOR ADDR	Moett Field, CA, 94035	user correction
AUTHOR NAME	Grigore Rosu	user correction
ABSTRACT	We present a rewriting algorithm for efficiently testing Linear Temporal Logic (LTL) formulae on finite execution traces. The standard models of LTL are infinite traces, reflecting the behavior of reactive and concurrent systems which conceptually may be continuously alive. In most past applications of LTL, theorem provers and model checkers have been used to formally prove that down-scaled models satisfy such LTL specifications. Our goal is instead to use LTL for up-scaled testing of real software applications, corresponding to analyzing the conformance of finite traces against LTL formulae. We first describe what it means for a finite trace to satisfy an LTL property and then suggest an optimized algorithm based on transforming LTL formulae. We use Maude, which turns out to be a good notation and an efficient rewriting engine for performing these experiments.	user correction - Legacy Corrections
YEAR	2001	user correction - Legacy Corrections
CITATIONS	25 found	ParsCit 1.0