Compensation-aware runtime monitoring
RV'10 Proceedings of the First international conference on Runtime verification
RV'11 Proceedings of the Second international conference on Runtime verification
Elarva: a monitoring tool for erlang
RV'11 Proceedings of the Second international conference on Runtime verification
polyLARVA: runtime verification with configurable resource-aware monitoring boundaries
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
A case for "Piggyback" Runtime Monitoring
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
A unified approach for static and runtime verification: framework and applications
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Safer asynchronous runtime monitoring using compensations
Formal Methods in System Design
Towards certified runtime verification
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Automatic testing of real-time graphics systems
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Proceedings of the 28th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
Methods for testing from Finite State Machine-based specifications often require the existence of a preset distinguishing sequence for constructing checking sequences. It has been shown that an adaptive distinguishing sequence is sufficient for these methods. This result is significant because adaptive distinguishing sequences are strictly more common and up to exponentially shorter than preset ones. However, there has been no study on the actual effect of using adaptive distinguishing sequences on the length of checking sequences. This paper describes experiments that show that checking sequences constructed using adaptive distinguishing sequences are almost consistently shorter than those based on preset distinguishing sequences. This is investigated for three different checking sequence generation methods and the results obtained from an extensive experimental study are given.