Communicating sequential processes
Communications of the ACM
Using SPIN for feature interaction analysis—a case study
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
MOPS: an infrastructure for examining security properties of software
Proceedings of the 9th ACM conference on Computer and communications security
Feature interaction: a critical review and considered forecast
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed resolution of feature interactions for internet applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Predicting feature interactions by using inconsistency models
Computer Networks: The International Journal of Computer and Telecommunications Networking
SLAM2: static driver verification with under 4% false alarms
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Predicate abstraction with adjustable-block encoding
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
SATABS: SAT-Based predicate abstraction for ANSI-C
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
Internet applications, such as Email, VoIP and WWW, have been enhanced with features. However, the introduction and modification of features may result in undesired behaviors, and this effect is known as feature interaction (''FI''). Among other methods, constraint logic programming and model checking have been adopted to address the two main problems in telephony FIs: detection and resolution. In this paper, we show that model checking is also suitable to detect FIs in more complex domains and we use Email features as an example. Moreover, FI detection may be simultaneously analyzed by model checking tools. Finally, we analyze the implementation performance against a number of parties and message types using the CPAchecker tool. Model checking reveals a superior performance against constraint programming, for the case of FI detection with FI occurrence.