On-line algorithms for polynomially solvable satisfiability problems
Journal of Logic Programming
Patterns in property specifications for finite-state verification
Proceedings of the 21st international conference on Software engineering
Model checking
The Temporal Rover and the ATG Rover
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
Efficient reduction of finite state model checking to reachability analysis
International Journal on Software Tools for Technology Transfer (STTT)
Steering of Discrete Event Systems: Control Theory Approach
Electronic Notes in Theoretical Computer Science (ENTCS)
Model-based Runtime Verification Framework for Self-optimizing Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.02 |
Model-based runtime verification is an extension to the state-of-the-art runtime verification, aimed at checking at runtime the system implementation against the system model (consistency checking) and the system model against the system specification (safety checking). Notice that our runtime verification works at the model level, thus, we do not need to strictly synchronize this runtime verification with the system execution. In fact, we mainly use the runtime information (current states) obtained from the system execution to reduce the state space (of the system model) to be explored. It means that this model-based runtime verification might run before or after the system execution, i.e., switch alternately between a preventive pre-checking mode and a maintaining post-checking mode. In order to make it run ahead of the system execution for as long time as possible, we present two possible strategies so that this runtime verification can selectively reduce the state space (of the system model) to be explored by making the system model enriched with probabilities and additional information derived and learned at the system testing phase.