A generic approach for the automatic verification of featured, parameterised systems

Feature Interactions in Telecommunications and Software Systems VIII

Volumn , Issue , 2005, Pages 217-235

  Miller, Alice ^a   Calder, Muffy ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

Abstraction; Feature interaction; Induction; Model checking; Verification

Indexed keywords

ABSTRACTION; AUTOMATIC VERIFICATION; FEATURE ANALYSIS; FEATURE INTERACTIONS; GENERIC APPROACH; GUARDED COMMANDS; INDUCTION; PARAMETERISED SYSTEMS;

ABSTRACTING; COMPUTER SOFTWARE; TELEPHONE SYSTEMS; VERIFICATION;

MODEL CHECKING;

EID: 50049130319     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Parosh Aziz Abdulla and Bengt Jonsson. On the existence of network invariants for verifying parameterized systems. In Ernst-Rüdiger Olderog and Bernhard Steffen, editors, Correct System Design, Recent Insight and Advances, volume 1710 of Lecture Notes in Computer Science, pages 180-197. Springer-Verlag, 1999.
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. Paul C. Attie and E. Allen Emerson. Synthesis of concurrent systems with many similar processes. ACM Transactions on Programming Languages and Systems, 20(1):51-115, January 1998.
4. M.C. Browne, E.M. Clarke, and O. Gramberg. Reasoning about networks with many identical finite state processes. Information and Computation, 81:13-31, 1989.
5. M. Calder and A. Miller. Veriscope publications website: http://www.dcs.gla.ac.uk/research/veriscope/publications.html.
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 D. Amyot and L. Logrippo, editors, Feature Interactions in Telecommunications and Software Systems VII, pages 187-205, Ottawa, Canada, June 2003. IOS Press (Amsterdam).
9. Muffy Calder and Alice Miller. Detecting feature interactions: how many components do we need? In Mark Ryan, Dieter Ehrich, and John-Jules Meyer, editors, Objects, agents and features, Lecture Notes in Computing Science, pages 45-66. Springer-Verlag, 2004.
10. Muffy Calder and Alice Miller. Verifiying parameterised, featured networks by abstraction. In T. Margaria, B. Steffan, A. Philippou, and M. Reitenspiess, editors, Proceedings of the first International Symposium on Leveraging Applications of Formal Methods (ISOIA'04), pages 227-234, October - November 2004.
11. Edmund M. Clarke, Orna Grumberg, and Doron Peled. Model Checking. The MIT Press, Cambridge, Masachusetts, 1999.
12. 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.
13. D. L. Dill. The Munφ verification system. In Rajeev Alur and Thomas A. Henzinger, editors, Proceedings of the Eighth International Conference on Computer Aided Verification (CAV '96), volume 1102 of Lecture Notes in Computer Science, pages 390-393, New Brunswick, NJ, USA, July/August 1996. Springer-Verlag.
14. Steven M. German and A. Prasad Sistla. Reasoning about systems with many processes. Journal of the ACM, 39(3):675-735, July 1992.
15. Mahesh Girkar and Robert Moll. New results on the analysis of concurrent systems with an indefinite number of processes. In Bengt Jonsson and Joachim Parrow, editors, Proceedings of the 5th International Conference on Concurrency Theory (CONCUR '94), volume 836 of Lecture Notes in Computer Science, pages 65-80, Uppsala, Sweden, August 1994. Springer-Verlag.
16. Gerard J. Holzmann. The model checker Spin. IEEE Transactions on Software Engineering, 23(5):279-295, May 1997.
17. R. P. Kurshan and K.L. McMillan. A structural induction theorem for processes. In Proceedings of the eighth Annual ACM Symposium on Principles of Distrubuted Computing, pages 239-247. ACM Press, 1989.
18. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Boston, 1993.
19. Malte Plath and Mark Ryan. The feature construct for SMV: Semantics. In M. Calder and E. Magill, editors, Feature Interactions in Telecommunications and Software Systems VI, pages 129-144. IOS Press (Amsterdam), 2000.
20. Z. Shtadler and O. Grumberg. Network grammars, communication behaviors and automatic verification. In Sifakis [21], pages 151-165.
21. J. Sifakis, editor. Proceedings of the International Workshop in Automatic Verification Methods for Finite State Systems, volume 407 of Lecture Notes in Computer Science, Grenoble, France, June 1989. Springer-Verlag.
22. Pierre Wolper and Vinciane Lovinfosse. Properties of large sets of processes with network invariants (extended abstract). In Sifakis [21], pages 68-80.