Mutation Testing for Rule-Based Verification of Railway Signaling Data
| Autor: | Alexander Romanovsky, Linas Laibinis, Alexei Iliasov |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
021103 operations research
Semantics (computer science) Computer science Programming language Control table 0211 other engineering and technologies Genetic programming Rule-based system 02 engineering and technology computer.software_genre Domain (software engineering) Completeness (order theory) Mutation (genetic algorithm) Electrical and Electronic Engineering Safety Risk Reliability and Quality Formal verification computer |
| Zdroj: | IEEE Transactions on Reliability. 70:676-691 |
| ISSN: | 1558-1721 0018-9529 |
| DOI: | 10.1109/tr.2020.3047462 |
| Popis: | Industry applications of formal verification to signaling control tables require formulation of a large number of mathematical conjectures expressing verification rules. It is paramount to establish the validity and completeness of these conjectures. This article discusses a mutation-based validation technique that guides domain experts in the construction of such verification rules. Furthermore, we use genetic programming to quickly generate millions of well-formed data mutations of control tables and to synthesize mutation programs. The technique is illustrated by a synthetic running example and a discussion of our experience in using it in the industrial setting. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|