Automated reasoning in quantified modal and temporal logics
AI Communications
Feature interaction detection by pairwise analysis of LTL properties: a case study
Formal Methods in System Design
An automatic abstraction technique for verifying featured, parameterised systems
Theoretical Computer Science
Proof planning for first-order temporal logic
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
| Hi-index | 0.00 |
The automatic verification of concurrent systems by model-checking is limited due to the inability to generalise results to systems consisting of any number of processes. We use abstraction to prove general results, by model-checking, about feature interaction analysis of a telecommunications service involving any number of processes. The key idea is to model-check a system of constant number (m) of concurrent processes, in parallel with an "abstract" process which represents the product of any number of other processes. The system, for any specified set of selected features, is generated automatically using Perl scripts.