Article

Free access

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

Authors:

Richard J. Anderson,

David NotkinAuthors Info & Claims

ISSTA '98: Proceedings of the 1998 ACM SIGSOFT international symposium on Software testing and analysis

Pages 102 - 112

https://doi.org/10.1145/271771.271798

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.

Digital Library

[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.

Digital Library

[4]

R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C- 35(6):677-691, August 1986.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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}.

Digital Library

[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.

Digital Library

[16]

D. Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8(3):231-274, June 1987.

Digital Library

[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.

Digital Library

[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.

Digital Library

[19]

M.P.E. Heimdahl and M. W. Whalen. Reduction and slicing of hierarchical state machines. In FSE5 { 14}.

Digital Library

[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.

Digital Library

[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.

Digital Library

[22]

R. P. Kurshan. Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press, 1994.

Digital Library

[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.

Digital Library

[24]

K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993:

Digital Library

[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.

Digital Library

[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

Karna AChen YYu HZhong HZhao J(2018)The role of model checking in software engineeringFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-016-6192-012:4(642-668)Online publication date: 1-Aug-2018
https://dl.acm.org/doi/10.1007/s11704-016-6192-0
Hagen GTinelli C(2008)Scaling up the formal verification of Lustre programs with SMT-based techniquesProceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design10.5555/1517424.1517439(1-9)Online publication date: 17-Nov-2008
https://dl.acm.org/doi/10.5555/1517424.1517439
Hagen GTinelli C(2008)Scaling Up the Formal Verification of Lustre Programs with SMT-Based Techniques2008 Formal Methods in Computer-Aided Design10.1109/FMCAD.2008.ECP.19(1-9)Online publication date: Nov-2008
https://doi.org/10.1109/FMCAD.2008.ECP.19
Show More Cited By

Index Terms

Improving efficiency of symbolic model checking for state-based system requirements
1. Software and its engineering
  1. Software notations and tools
    1. Formal language definitions
  2. Software organization and properties
    1. Software functional properties
      1. Formal methods
        Model checking
2. Theory of computation
  1. Formal languages and automata theory
  2. Logic
    1. Verification by model checking

Recommendations

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

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 ...
Optimizing Symbolic Model Checking for Statecharts
Special issue on 1999 international conference on software engineering

Symbolic model checking based on binary decision diagrams is a powerful formal verification technique for reactive systems. In this paper, we present various optimizations for improving the time and space efficiency of symbolic model checking for systems ...
SAT-based unbounded symbolic model checking
DAC '03: Proceedings of the 40th annual Design Automation Conference

This paper describes a SAT-based unbounded symbolic model checking algorithm. BDDs have been widely used for symbolic model checking, but the approach suffers from memory overflow. The SAT procedure was exploited to overcome the problem, but it verified ...

Comments

Information & Contributors

Information

Published In

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

Chairmen:
Mary Lou Soffa
Univ. of Pittsburgh, PA
,
Michal Young
Univ. of Oregan, Eugene
,
Editor:
Will Tracz
Lockheed Martin Federal systems, Owego, NY

ACM SIGSOFT Software Engineering Notes Volume 23, Issue 2
March 1998
162 pages
ISSN:0163-5948
DOI:10.1145/271775
Chairman:
Mary Lou Soffa
Univ. of Pittsburgh, PA
,
Editors:
Michal Young
Univ. of Oregon, Eugene
,
Will Tracz
Lockheed Martin Federal Systems, Owego, Ny
Issue’s Table of Contents

Copyright © 1998 ACM.

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]

Sponsors

SIGSOFT: ACM Special Interest Group on Software Engineering

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

ISSTA98

Sponsor:

SIGSOFT

ISSTA98: International Symposium on Software Testing and Analysis

March 2 - 4, 1998

Florida, Clearwater Beach, USA

Acceptance Rates

ISSTA '98 Paper Acceptance Rate 16 of 47 submissions, 34%;

Overall Acceptance Rate 58 of 213 submissions, 27%

Upcoming Conference

ISSTA '25

Sponsor:
sigsoft

34th ACM SIGSOFT International Symposium on Software Testing and Analysis

June 25 - 28, 2025

Trondheim , Norway

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

34
Total Citations
View Citations
592
Total Downloads

Downloads (Last 12 months)43
Downloads (Last 6 weeks)14

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Karna AChen YYu HZhong HZhao J(2018)The role of model checking in software engineeringFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-016-6192-012:4(642-668)Online publication date: 1-Aug-2018
https://dl.acm.org/doi/10.1007/s11704-016-6192-0
Hagen GTinelli C(2008)Scaling up the formal verification of Lustre programs with SMT-based techniquesProceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design10.5555/1517424.1517439(1-9)Online publication date: 17-Nov-2008
https://dl.acm.org/doi/10.5555/1517424.1517439
Hagen GTinelli C(2008)Scaling Up the Formal Verification of Lustre Programs with SMT-Based Techniques2008 Formal Methods in Computer-Aided Design10.1109/FMCAD.2008.ECP.19(1-9)Online publication date: Nov-2008
https://doi.org/10.1109/FMCAD.2008.ECP.19
Mokhati FGagnon PBadri M(2007)Verifying UML Diagrams with Model Checking: A Rewriting Logic Based ApproachSeventh International Conference on Quality Software (QSIC 2007)10.1109/QSIC.2007.4385520(356-362)Online publication date: Oct-2007
https://doi.org/10.1109/QSIC.2007.4385520
Strichman O(2004)Accelerating Bounded Model Checking of Safety PropertiesFormal Methods in System Design10.1023/B:FORM.0000004785.67232.f824:1(5-24)Online publication date: 1-Jan-2004
https://dl.acm.org/doi/10.1023/B%3AFORM.0000004785.67232.f8
Whittle J(2003)Formal approaches to systems analysis using UMLAdvanced topics in database research vol. 110.5555/960129.960147(324-341)Online publication date: 1-Jan-2003
https://dl.acm.org/doi/10.5555/960129.960147
Ben-David SEisner CGeist DWolfsthal Y(2003)Model Checking at IBMFormal Methods in System Design10.1023/A:102290512034622:2(101-108)Online publication date: 1-Mar-2003
https://dl.acm.org/doi/10.1023/A%3A1022905120346
Barner SRabinovitz I(2003)Efficient Symbolic Model Checking of Software Using Partial Disjunctive PartitioningCorrect Hardware Design and Verification Methods10.1007/978-3-540-39724-3_6(35-50)Online publication date: 2003
https://doi.org/10.1007/978-3-540-39724-3_6
Lind-Nielsen JAndersen H(2003)Stepwise CTL Model Checking of State/Event SystemsComputer Aided Verification10.1007/3-540-48683-6_28(316-327)Online publication date: 14-Jan-2003
https://doi.org/10.1007/3-540-48683-6_28
Naumovich GFrankl P(2002)A conservative algorithm for computing the flow of permissions in Java programsProceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis10.1145/566172.566178(33-43)Online publication date: 22-Jul-2002
https://dl.acm.org/doi/10.1145/566172.566178
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents