skip to main content
article
Free access

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

Published: 01 March 1998 Publication History

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.

References

[1]
R. J. Anderson, P. Bearne, S. Bums, W. Chan, E Modugno, D. Notkin, and J. D. Reese. Model checking large software specifications. In D. Garlan, editor, Proceedings of the 4th A CM SIGSOFT Symposium on the Foundations of Software Engineering, pages 156-166, San Francisco, CA, USA, October 1996.
[2]
J. J. Britt. Case study: Applying formal methods to the Traffic Alert and Collision Avoidance System (TCAS) II. In COMPASS'94, Proceedings of the 9th Annual Conference on Computer Assurance, pages 39-51, Gaithersburg, MD, USA, June/July 1994. IEEE.
[3]
M. C. Browne, E. M. Clarke, and O. Griimberg. Characterizing finite Kripke structures in propositional temporal logic. Theoretical Computer Science, 59(1/2):115-131, July 1988.
[4]
R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C- 35(6):677-691, August 1986.
[5]
R. E. Bryant. On the complexity of VLSI implementations and graph representation of boolean functions with applications to integer multiplication. 1EEE Transactions on Computers, 40(2):205-213, February 1991.
[6]
J. R. Burch, E. M. Clarke, D. E. Long, K. L. McMillan, and D. L. Dill. Symbolic model checking for sequential circuit verification. IEEE Transactions on Computer-Aided Design oflntegrated Circuits, 13(4):401-424, April 1994.
[7]
G. Cabodi, P. Camurati, L. Lavagno, and S. Quer. Disjunctive partitioning and partial iterative squaring: An effective approach for symbolic traversal of large circuits. In 34th Design Automation Conference, Proceedings 1997, pages 728-733, Anaheim, CA, USA, June 1997. ACM.
[8]
G. Cabodi, P. Camurati, and S. Quer. Efficient state space pruning in symbolic backward traversal. In Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors, pages 230-235, Cambridge, MA, USA, October 1994.
[9]
W. Chart, R. J. Anderson, P. Beame, and D. Notkin. Cornbilling constraint solving and symbolic model checking for a class of systems with non-linear constraints. In O. Gmmberg, editor, ComputerAided Verification, 9th International Conference, CAV'97 Proceedings, volume 1254 of Lecture Notes in Computer Science, pages 316-327, Haifa, Israel, June 1997. Springer-Verlag.
[10]
E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, April 1986.
[11]
O. Coudert, C. Berthet, and J. t2. Madre. Verification of synchronous sequential machines based on symbolic execution. in J. Sifakis, editor, Automatic Verification Methods for Finite State Systems: International Workshop Proceedings, volume 407 of Lecture Notes in Computer Science, pages 365-373, Grenoble, France, June 1989. Springer-Verlag.
[12]
J. Crow and B. L. Di Vito. Formalizing space shuffle software requirements. In Proceedings of the ACM $IG$OFT Workshop on Formal Methods in Software Practice, pages 40-48, JaNuary 1996.
[13]
M. B. Dwyer, V. 12arr, and L. Hines. Model checking graphical user interfaces using abstractions. In FSE5 {14}.
[14]
Proceedings of the Joint 6th European Software Engineering Conference and 5th ACM $IG$OFT Symposium on the Foundations of Software Engineering, Zurich, Switzerland, September 1997.
[15]
D. Geist and I. Beer. Efficient model checking by automated ordering of transition relation partitions. In Computer Aided Verification, 6th International Conference, CAV'94 Proceedings, volume 818 of Lecture Notes in Computer Science, pages 299-310, Stanford, CA, USA, June 1994. Springer- Vefiag.
[16]
D. Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8(3):231-274, June 1987.
[17]
D. Harel and A. Naamad. The STATEMATE semantics of statecharts. A CM Transactions on Software Engineering and Methodology, 5(4):293-333, October 1996.
[18]
M. P. E. Heimdahl and N. G. Leveson. Completeness and consistency in hierarchical state-based requirements. IEEE Transactions on Software Engineering, 22(6):363-377, June 1996.
[19]
M.P.E. Heimdahl and M. W. Whalen. Reduction and slicing of hierarchical state machines. In FSE5 { 14}.
[20]
A. J. Hu and D. L. Dill. Reducing BDD size by exploiting functional dependencies. In 30th ACM/IEEE Design Automation Conference, Proceedings 1993, pages 266-271, Dallas, TX, USA, June 1993.
[21]
H. Iwashita, T. Nakata, and E Hirose. CTL model checking based on forward state/raversal, in 1996 IEEEdACM International Conference on Computer-Aided Design, Digest of Teclmical Papers, pages 82-87, San Jose, CA, USA, November 1996.
[22]
R. P. Kurshan. Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press, 1994.
[23]
'N. G. Levesoli,! M. P. E. Heimdahl, H. Hildreth, and .l.D. Reese. Requirements specification for process-control sys- : temg. iEEE Transactions on Software Engineering, 20(9), September 1994.
[24]
K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993:
[25]
R. Pugliese.and E. Tronci. Automatic verification of a hydroelectric power plant. ~ In M.-C. Gaudel and J. Woodcock, editors, FME'96: Industrial Benefit and Advances in Forreal Methods, $rd International Symposium of Formal Methods Europe, Proceedings, volume 1051 of Lecture Notes in, Computer Science, pages 425-.444, Oxford, UK, March 1996. Springer-Verlag.
[26]
R. K. Ranjan, A. Aziz, R. K. Brayton, B. Plessier, and C. Pixley. Efficient B DD algorithms for FSM synthesis and verification. In Proceedings of lEEF_./A CM International Workshop on Logic Synthesis, Lake Tahoe, USA, May 1995.
[27]
T. Sreemani and J. M. Atlee. Feasibility of model checking software requirements: A case study. In COMPASS'96, Proceedings of the l lth Annual Conference on ComputerAssurance, pages 77-88, Gaithersburg, MD, USA, June 1996. IEEE. '
[28]
The VIS Group. VIS: A system for verification and s~mthesis. In R. Alur and T. A. Henzinger, editors, Computer Aided Verification, 8th International Conference, CAV'96 Proceedings, volume 1102 of Lecture Notes in Computer Science, pages 428--432, New Brunswick, NJ, USA, July/August 1996. . Spfinger-Verlag.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGSOFT Software Engineering Notes
ACM SIGSOFT Software Engineering Notes  Volume 23, Issue 2
March 1998
162 pages
ISSN:0163-5948
DOI:10.1145/271775
Issue’s Table of Contents
  • cover image ACM Conferences
    ISSTA '98: Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis
    March 1998
    170 pages
    ISBN:0897919718
    DOI:10.1145/271771
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1998
Published in SIGSOFT Volume 23, Issue 2

Check for updates

Author Tags

  1. RSML
  2. TCAS II
  3. abstraction
  4. binary decision diagrams
  5. formal verification
  6. partitioned transition relation
  7. reachability analysis
  8. statecharts
  9. symbolic model checking
  10. system requirements specification

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)56
  • Downloads (Last 6 weeks)8
Reflects downloads up to 12 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media