Improving efficiency of symbolic model checking for state-based system requirements

  • Authors:
  • William Chan;Richard J. Anderson;Paul Beame;David Notkin

  • Affiliations:
  • Department of Computer Science and Engineering, University of Washington, Box 352350, Seattle, WA;Department of Computer Science and Engineering, University of Washington, Box 352350, Seattle, WA;Department of Computer Science and Engineering, University of Washington, Box 352350, Seattle, WA;Department of Computer Science and Engineering, University of Washington, Box 352350, Seattle, WA

  • Venue:
  • Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We used these techniques in our analysis of the system requirements specification of TCAS II, a complex aircraft collision avoidance system. They together reduce the time and space complexities by orders of magnitude, making feasible some analysis that was previously intractable. The TCAS II requirements were written in RSML, a dialect of state-charts.