This paper considers the specification-based testing in which the requirement is given in the linear temporal logic (LTL). The required LTL property must hold on all the executions of the system, which are often infinite in size and/or in length. The central piece of our framework is a property-coverage metric. Based on requirement mutation, the metric measures how well a property has been tested by a test suite. We define a coverage criterion based on the metric that selects a finite set of tests from all the possible executions of the system. We also discuss the technique of generating a test suite for specification testing by using the counterexample mechanism of a model checker. By exploiting the special structure of a generated test, w...
This article studies runtime verification of properties expressed either in lineartime temporal logi...
In this paper, we address a typical obstacle in runtime verification of linear temporal logic (LTL) ...
In this paper, we address the problem of model checking temporal properties of finite-state programs...
This paper considers the specification-based testing in which the requirement is given in the linear...
We present an algorithm for efficiently testing Linear Temporal Logic (LTL) formulae on finite execu...
Formal verification techniques such as theorem proving, runtime verification, and model checking hav...
A Temporal Logic Based Theory of Test Coverage and Generation This paper presents a theory of test c...
This paper presents a theory of test coverage and generation from specifications written in extended...
This paper presents a method for translating formulas written in assertion languages such as LTL int...
Formulae of linear temporal logic (LTL) can be used to specify (wanted or unwanted) properties of a ...
Model checking techniques have traditionally dealt with temporal logic languages and automata interp...
This paper studies runtime verification of properties expressed either in lineartime temporal logic ...
Summary. This article provides the definition of linear temporal logic (LTL) and its properties rele...
Abstract—A model has variability bounded by v/k when the state changes at most v times over any line...
This article studies runtime verification of properties expressed either in lineartime temporal logi...
This article studies runtime verification of properties expressed either in lineartime temporal logi...
In this paper, we address a typical obstacle in runtime verification of linear temporal logic (LTL) ...
In this paper, we address the problem of model checking temporal properties of finite-state programs...
This paper considers the specification-based testing in which the requirement is given in the linear...
We present an algorithm for efficiently testing Linear Temporal Logic (LTL) formulae on finite execu...
Formal verification techniques such as theorem proving, runtime verification, and model checking hav...
A Temporal Logic Based Theory of Test Coverage and Generation This paper presents a theory of test c...
This paper presents a theory of test coverage and generation from specifications written in extended...
This paper presents a method for translating formulas written in assertion languages such as LTL int...
Formulae of linear temporal logic (LTL) can be used to specify (wanted or unwanted) properties of a ...
Model checking techniques have traditionally dealt with temporal logic languages and automata interp...
This paper studies runtime verification of properties expressed either in lineartime temporal logic ...
Summary. This article provides the definition of linear temporal logic (LTL) and its properties rele...
Abstract—A model has variability bounded by v/k when the state changes at most v times over any line...
This article studies runtime verification of properties expressed either in lineartime temporal logi...
This article studies runtime verification of properties expressed either in lineartime temporal logi...
In this paper, we address a typical obstacle in runtime verification of linear temporal logic (LTL) ...
In this paper, we address the problem of model checking temporal properties of finite-state programs...