Detecting feature interactions: How many components do we need?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2975, Issue , 2004, Pages 45-66

  Calder, Muffy ^a   Miller, Alice ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; MODEL CHECKING; PEER TO PEER NETWORKS;

COMMUNICATION STRUCTURES; DATA ABSTRACTION; FEATURE INTERACTIONS; INFERENCE MECHANISM; PROOF OF CORRECTNESS; STRUCTURING MECHANISMS; SYSTEM MODELING; TEMPORAL PROPERTY;

FEATURE EXTRACTION;

EID: 33750723023     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25930-5_4     Document Type: Article

References (26)

1. D. Amyot and L. Logrippo, editors. Feature Interactions in Telecommunications and Software Systems VII. IOS Press (Amsterdam), June 2003.
2. Krzysztof R. Apt and Dexter C. Kozen. Limits for automatic verification of finite-state concurrent systems. Information Processing Letters, 22:307-309, 1986.
3. L. G. Bouma and H. Velthuijsen, editors. Feature Interactions in Telecommunications Systems. IOS Press (Amsterdam), May 1994.
4. M. Calder and E. Magill, editors. Feature Interactions in Telecommunications and Software Systems VI. IOS Press (Amsterdam), 2000.
5. M. Calder, E. Magill, and S. Kolberg, Reiff-Marganiec. Feature interaction: A critical review and considered forecast. Computer Networks, 41/1:115 - 141, 2003.
6. M. Calder and A. Miller. Using SPIN for feature interaction analysis - a case study. In M.B. Dwyer, editor, Proceedings of the 8th International SPIN Workshop (SPIN 2001), volume 2057 of Lecture Notes in Computer Science, pages 143-162, Toronto, Canada, May 2001. Springer-Verlag.
7. Muffy Calder and Alice Miller. Automatic verification of any number of concurrent, communicating processes. In Proceedings of the 17th IEEE International Conference on Automated Software Engineering (ASE 2002), pages 227-230, Edinburgh, UK, September 2002. IEEE Computer Society Press.
8. Muffy Calder and Alice Miller. Generalising feature interactions in email. In Amyot and Logrippo [1], pages 187-205.
9. Edmund M. Clarke, Orna Grumberg, and Doron Peled. Model Checking. The MIT Press, 1999.
10. E.M. Clarke, O. Grumberg, and S. Jha. Verifying parameterized networks using abstraction and regular languages. In Insup Lee and Scott A. Smolka, editors, Proceedings of the 6th International Conference on Concurrency Theory (CONCUR '95), volume 962 of Lecture Notes in Computer Science, pages 395-407, Philadelphia, PA., August 1995. Springer-Verlag.
11. E.M. Clarke, O. Grumberg, and D Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5):1512-1542, January 1994.
12. S.J. Creese and A.W. Roscoe. Data independent induction over structured networks. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA '00), volume II, Las Vegas, Nevada, USA, June 2000. CSREA Press.
13. P. Dini, R. Boutaba, and L. Logrippo, editors. Feature Interactions in Telecommunication Networks IV. IOS Press (Amsterdam), June 1997.
14. E. Allen Emerson and Vineet Kahlon. Reducing model checking of the many to the few. In David A. McAllester, editor, Automated Deduction - Proceedings of the 17th International Conference on Automated Deduction (CADE 2000), volume 1831 of Lecture Notes in Computer Science, pages 236-254, Pittsburgh, PA, USA, June 2000. Springer-Verlag.
15. E. Allen Emerson and Kedar S. Namjoshi. Reasoning about rings. In Conference Record of the 22nd Annual ACM Symposium on Principles of Programming Languages (POPL '95), pages 85-94, San Francisco, California, January 1995. ACM Press.
16. Steven M. German and A. Prasad Sistla. Reasoning about systems with many processes. Journal of the ACM, 39(3):675-735, July 1992.
17. R. J. Hall. Feature interactions in electronic mail. In Calder and Magill [4], pages 67-82.
18. Gerard J. Holzmann. The model checker Spin. IEEE Transactions on Software Engineering, 23(5):279-295, May 1997.
19. IN Distributed Functional Plane Architecture, recommmendation q.1204, ITU-T edition, March 1992.
20. C. Norris Ip and David L. Dill. Verifying systems with replicated components in Murφ. Formal Methods in System Design, 14:273-310, 1999.
21. K. Kimbler and L.G. Bouma, editors. Feature Interactions in Telecommunications and Software Systems V. IOS Press (Amsterdam), September 1998.
22. M. Kolberg, E. H. Magill, D. Marples, and S. Reiff. Results of the second feature interaction contest. In Calder and Magill [4], pages 311-325.
23. R. P. Kurshan and K.L. McMillan. A structural induction theorem for processes. In Proceedings of the eighth Annual ACM Symposium on Principles of Distributed Computing, pages 239-247. ACM Press, 1989.
24. Robert P. Kurshan, M. Merritt, A. Orda, and S.R. Sachs. A structural linearization principle for processes. Formal Methods in System Design, 5(3):227-244, December 1994.
25. A. Roychoudhury and I. V. Ramakrishnan. Automated inductive verification of parameterized protocols. In Gérard Berry, Hubert Comon, and Alain Finkel, editors, Proceedings of the thirteenth International Conference on Computer-aided Verification (CAV 2001), volume 2102 of Lecture Notes in Computer Science, pages 25-37, Paris, France, July 2001. Springer-Verlag.
26. Pierre Wolper and Vinciane Lovinfosse. Properties of large sets of processes with network invariants (extended abstract). In J. Sifakis, editor, Proceedings of the International Workshop in Automatic Verification Methods for Finite State Systems, volume 407 of Lecture Notes in Computer Science, pages 68-80, Grenoble, France, June 1989. Springer-Verlag.