Automatic verification of any number of concurrent, communicating processes

Proceedings - ASE 2002: 17th IEEE International Conference on Automated Software Engineering

Volumn , Issue , 2002, Pages 227-230

  Calder, M ^a   Miller, A ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

SOFTWARE ENGINEERING;

AUTOMATIC VERIFICATION; COMMUNICATING PROCESS; CONCURRENT PROCESS; CONCURRENT SYSTEMS; FEATURE INTERACTIONS; PERL SCRIPTS; TELECOMMUNICATIONS SERVICES;

MODEL CHECKING;

EID: 84983006847     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASE.2002.1115017     Document Type: Conference Paper

References (9)

1. Krzysztof R. Apt and Dexter C. Kozen. Limits for automatic verification of finite-state concurrent systems. Information Processing Letters, 22:307-309, 1986.
2. M. Calder and E. Magill, eds. Feature Interactions in Telecommunications and Software Systems, volume VI. IOS Press, Amsterdam, 2000.
3. M. Calder and A. Miller. Using SPIN for feature interaction analysis - a case study. In Proceedings of SPIN 2001, LNCS, vol. 2057, Springer-Verlag. pp. 143-162, 2001.
4. M. Calder and A. Miller. Feature validation for any number of processes. TR2002-110, Dept. of Computing Science, University of Glasgow, 2002.
5. E.M. Clarke, O. Grumberg, and S. Jha. Verifying parameterized networks using abstraction and regular languages. In Proceedings of CONCUR '95, LNCS, vol. 962, Springer-Verlag. pp. 395-407, 1995.
6. Gerard J. Holzmann. The model checker Spin. IEEE Transactions on Software Engineering, 23(5):279-295, May 1997.
7. C. Norris Ip and David L. Dill. Verifying systems with replicated components in muroφ. Formal Methods in System Design, 14:273-310, 1999.
8. R. P. Kurshan and K.L. McMillan. A structural induction theorem for processes. In Proceedings of 8th ACM Symposium on Principles of Distributed Computing, pages 239-247. ACM Press, 1989.
9. K. L. McMillan. Parameterized verification of the flash cache coherence protocol by compositional model checking. In Proceedings of CHARME 2001, LNCS, vol. 2144, pp. 179-195, 2001.