We have developed a formal validation tool that has been used on several projects that are developing software for AT&T's 5ESS™ telephone switching system. The tool uses Holzmann's supertrace algorithm to check for errors such as deadlock and livelock in networks of communicating processes. The validator invariably finds subtle errors that were missed during thorough simulation and testing; however, the brute-force search it performs can result in extremely long running times, which can be frustrating to users. Recently, a number of researchers have been investigating techniques known as partial-order methods that can significantly reduce the running time of formal validation by avoiding redundant exploration of execution scenarios. In this paper, we describe the design of a partial-order algorithm for our validation tool and discuss its effectiveness. We show that a careful compile-time static analysis of process communication behavior yields information that can be used during validation to dramatically improve its performance. We demonstrate the effectiveness of our partial-order algorithm by presenting the results of experiments with actual industrial examples drawn from a variety of 5ESS™ application domains, including call processing, signalling, and switch maintenance.
|Title of host publication||Proceedings of the 1996 ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 1996|
|Editors||Will Tracz, Steve J. Zeil|
|Publisher||Association for Computing Machinery, Inc|
|Number of pages||9|
|ISBN (Electronic)||0897917871, 9780897917872|
|State||Published - 1 May 1996|
|Event||1996 ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 1996 - San Diego, United States|
Duration: 8 Jan 1996 → 10 Jan 1996
|Name||Proceedings of the 1996 ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 1996|
|Conference||1996 ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 1996|
|Period||8/01/96 → 10/01/96|
Bibliographical notePublisher Copyright:
© 1996 ACM.