Towards Sampling and Simulation-Based Analysis of Featured Weighted Automata
We consider the problem of model checking Variability-Intensive Systems (VIS) against non-functional requirements. These requirements are typically expressed as an optimization problem over quality attributes of interest, whose value is determined by the executions of the system. Identifying the optimal variant can be hard for two reasons. First, the state-explosion problem inherent to model checking makes it increasingly complex to find the optimal executions within a given variant. Second, the number of variants can grow exponentially with respect to the number of variation points in the VIS. In this paper, we lay the foundations for the application of smart sampling and statistical model checking to solve this problem faster. We design a simple method that samples variants and executions in a uniform manner from a featured weighted automaton and that assesses which of the sampled variants/executions are optimal. We implemented our approach on top of ProVeLines, a tool suite for model-checking VIS and carried out a preliminary evaluation on an industrial embedded system design case study. Our results tend to show that sampling-based approaches indeed holds the potential to improve scalability but should be supported by better sampling heuristics to be competitive.
Mon 27 MayDisplayed time zone: Eastern Time (US & Canada) change
14:00 - 15:30
|Parallelizable Reachability Analysis Algorithms for Feed-Forward Neural Networks|
|Towards Sampling and Simulation-Based Analysis of Featured Weighted Automata|
|Verifying Channel Communication Correctness for a Multi-Core Cooperatively Scheduled Runtime Using CSP|
|A Generalized Program Verification Workflow Based on Loop Elimination and SA Form|