Feature Interaction as a Satisfiability Problem

Authors:
Carlos Areces; Maarten de Rijke;Wiet Bouma
Affiliations:
-;-;-
Venue:
MASCOTS '99 Proceedings of the 7th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Year:
1999

Citing 0
Cited 2

Verifying cross-cutting features as open systems

ACM SIGSOFT Software Engineering Notes
Modular Verification of Open Features Using Three-Valued Model Checking

Automated Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a formal model for the specification of telephone features by means of description logics. Our framework permits the formal definition of the basic telephone system as well as the specification of additional features (Call Waiting, Call Forwarding, etc.). Furthermore, by using standard reasoning tasks from Description Logics, properties of features can be formally proved and interactions detected. An EXPTIME upper bound for the complexity of detecting feature interaction as a satisfiability problem is provided by exploiting well-known results for expressive description languages.