Towards Benchmark Optimization by Automated Equivalence Detection

1@inproceedings{schemmelBenchmarkOptimizationAutomated2018,
2  author = {Schemmel, Daniel and Glebke, René and Stoffers, Mirko and Wehrle, Klaus},
3  title = {Towards {{Benchmark}} {{Optimization}} by {{Automated}} {{Equivalence}} {{Detection}}},
4  booktitle = {{{IEEE}} {{Workshop}} on {{Benchmarking}} {{Cyber-Physical}} {{Networks}} and {{Systems}} {{(CPSBench}} 2018)},
5  location = {Porto, Portugal},
6  pages = {25--29},
7  year = {2018},
8  doi = {10.1109/CPSBench.2018.00011},
9}

Especially in the case of Cyber-Physical Systems (CPSs), testbed validations and benchmarks, while necessary, incur significant setup and operation costs. Optimized benchmark sets reduce the number of tests that need to be performed, which ultimately reduces costs. In this paper, we propose a new methodology to provide automated assistance for optimizing existing benchmarks or for creating new ones from scratch. The proposed methodology is based on complete Symbolic Execution of a single control loop iteration, optionally expanded with a Nondeterministic Finite Automaton (NFA) model that represents possible changes in the environment or the system in between control loop iterations. This enables us to compute a stress number that represents the computational burden put upon the controller by a respective benchmark. By iteratively searching for benchmarks with high stress numbers and automatically detecting and pruning benchmarks that induce the same path through the controller code, we can ultimately create a minimal set of relevant benchmarks for a CPS.