<XML><RECORDS><RECORD><REFERENCE_TYPE>3</REFERENCE_TYPE><REFNUM>6617</REFNUM><AUTHORS><AUTHOR>Calder,M.</AUTHOR><AUTHOR>Miller,A.</AUTHOR></AUTHORS><YEAR>2002</YEAR><TITLE>Automatic verification of any number of concurrent, communicating processes</TITLE><PLACE_PUBLISHED>Proceedings of the 17th IEEE International Conference on Automated Software Engineering (ASE 2002) </PLACE_PUBLISHED><PUBLISHER>IEEE</PUBLISHER><PAGES> 227-230</PAGES><LABEL>Calder:2002:6617</LABEL><KEYWORDS><KEYWORD>Automation</KEYWORD></KEYWORDS<ABSTRACT>The automatic verification of concurrent systems by model-checking is limited due to the inability to generalise results to systems consisting of any number of processes. We use abstraction to prove general results, by model-checking, about feature interaction analysis of a telecommunications service involving any number of processes. The key idea is to model-check a system of constant number (m) of concurrent processes, in parallel with an ``abstract'' process which represents the product of any number of other processes. The system, for any specified set of selected features, is generated automatically using Perl scripts. </ABSTRACT></RECORD></RECORDS></XML>