research-article

Open access

Model checking with bounded context switching

Authors:

Gerard J. Holzmann,

Mihai FlorianAuthors Info & Claims

Formal Aspects of Computing, Volume 23, Issue 3

Pages 365 - 389

https://doi.org/10.1007/s00165-010-0160-5

Published: 01 May 2011 Publication History

PDF eReader

Abstract

We discuss the implementation of a bounded context switching algorithm in the Spin model checker. The algorithm allows us to find counter-examples that are often simpler to understand, and that may be more likely to occur in practice. We discuss extensions of the algorithm that allow us to use this new algorithm in combination with most other search modes supported in Spin, including partial order reduction and bitstate hashing. We show that, other than often assumed, the enforcement of a bounded context switching discipline does not decrease but increases the complexity of the model checking procedure. We discuss the performance of the algorithm on a range of applications.

References

[1]

Bloom BH Spacetime tradeoffs in hash coding with allowable errors Comm ACM 1970 13 7 422-426

Digital Library

Google Scholar

[2]

Holzmann GJ (1987) On limits and possibilities of automated protocol analysis. In: Rudin H, West C (eds) Proceedings of sixth international conference on protocol specification, testing, and verification. INWG IFIP, Zurich, Switzerland, June 1987

Google Scholar

[3]

Holzmann GJ (1998) An analysis of bitstate hashing. In: Formal methods in system design, vol 13, issue 3. Kluwer, Dordrect, pp 287–305, November 1998

Google Scholar

[4]

Holzmann GJ The spin model checker: primer and reference manual 2004 Reading Addison-Wesley

Digital Library

Google Scholar

[5]

Holzmann GJ, Peled D (1994) An improvement in formal verification. In: Proceedings of seventh international conference on formal description techniques, Bern, Switzerland, October 1994. Chapman & Hall, London, pp 197–211

Google Scholar

[6]

Holzmann GJ, Peled D, Yannakakis M (1996) On nested depth first search. In: Proceedings of second spin workshop. American Mathematical Society, Providence, pp 23–32

Google Scholar

[7]

Holzmann GJ, Joshi R, Groce A (2010) Swarm verification techniques. IEEE Trans Softw Eng (to appear)

Google Scholar

[8]

Lal A, Reps T (2008) Reducing concurrent analysis under a context bound to sequential analysis. In: Proceedings of CAV

Google Scholar

[9]

Peled D (2004) Combining partial order reduction with on-the-fly model checking. In: Proceeding of CAV 2004. LNCS, vol 818. Springer, Berlin, pp 377–390

Google Scholar

[10]

Musuvathi M, Qadeer S (2007a) Partial-order reduction for context-bounded state exploration. In: Microsoft Tech Report, MSR-TR-2007-12, February 2007, p 19

Google Scholar

[11]

Musuvathi M, Qadeer S (2007b) Iterative context bounding for systematic testing of multithreaded programs. In: Proceedings of ACM SIGPLAN conference on programming language design and implementation (PLDI), San Diego, June 2007

Google Scholar

[12]

Musuvathi M, Qadeer S (2008) Fair stateless model checking. In: Proceedings of ACM SIGPLAN conference on programming language design and implementation, Tucson, AZ, June 2008

Google Scholar

[13]

Qadeer S, Wu D (2004) KISS: Keep it simple and sequential. In: Proceedings of ACM SIGPLAN conference on programming language design and implementation (PLDI), Washington, DC, 14–24 June 2004

Google Scholar

[14]

Qadeer S, Rehof J (2005) Context-bounded model checking. In: Proceedings of TACAS. LNCS, vol 3440, pp 93–107

Google Scholar

Cited By

View all

Liu KZhang XKong WHou GWatanabe MFukuda A(2020)Interpolation-Based Multi-core Bounded Model Checking of HSTM Designs2019 6th International Conference on Dependable Systems and Their Applications (DSA)10.1109/DSA.2019.00013(25-36)Online publication date: Jan-2020
https://doi.org/10.1109/DSA.2019.00013
Fukuda AHisazumi KMine TIshida SAndo TIshibashi STagashira SKaneko KArakawa YKong WLi G(2018)Toward Sustainable Smart Mobility Information Infrastructure Platform: Project OverviewNew Trends in E-service and Smart Computing10.1007/978-3-319-70636-8_3(35-46)Online publication date: 2-Feb-2018
https://doi.org/10.1007/978-3-319-70636-8_3
Holzmann G(2018)Explicit-State Model CheckingHandbook of Model Checking10.1007/978-3-319-10575-8_5(153-171)Online publication date: 19-May-2018
https://doi.org/10.1007/978-3-319-10575-8_5
Show More Cited By

Index Terms

Model checking with bounded context switching
1. Software and its engineering
  1. Software creation and management
    1. Software verification and validation
  2. Software organization and properties
    1. Software functional properties
      1. Formal methods
        Model checking
2. Theory of computation
  1. Logic
    1. Verification by model checking
  2. Semantics and reasoning

Index terms have been assigned to the content through auto-classification.

Recommendations

Bounded model checking of high-integrity software
HILT '13: Proceedings of the 2013 ACM SIGAda annual conference on High integrity language technology

Model checking [5] is an automated algorithmic technique for exhaustive verification of systems, described as finite state machines, against temporal logic [9] specifications. It has been used successfully to verify hardware at an industrial scale [6]. ...
Improving Non-Progress Cycle Checks
Proceedings of the 16th International SPIN Workshop on Model Checking Software

This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first search, i.e., it searches through the graph incrementally deeper. It ...
Bounded model checking of high-integrity software
HILT '13

Model checking [5] is an automated algorithmic technique for exhaustive verification of systems, described as finite state machines, against temporal logic [9] specifications. It has been used successfully to verify hardware at an industrial scale [6]. ...

Comments

Information & Contributors

Information

Published In

Formal Aspects of Computing Volume 23, Issue 3

May 2011

150 pages

ISSN:0934-5043

EISSN:1433-299X

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 May 2011

Accepted: 08 July 2010

Revision received: 11 April 2010

Received: 09 November 2009

Published in FAC Volume 23, Issue 3

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
58
Total Downloads

Downloads (Last 12 months)36
Downloads (Last 6 weeks)7

Reflects downloads up to 03 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Liu KZhang XKong WHou GWatanabe MFukuda A(2020)Interpolation-Based Multi-core Bounded Model Checking of HSTM Designs2019 6th International Conference on Dependable Systems and Their Applications (DSA)10.1109/DSA.2019.00013(25-36)Online publication date: Jan-2020
https://doi.org/10.1109/DSA.2019.00013
Fukuda AHisazumi KMine TIshida SAndo TIshibashi STagashira SKaneko KArakawa YKong WLi G(2018)Toward Sustainable Smart Mobility Information Infrastructure Platform: Project OverviewNew Trends in E-service and Smart Computing10.1007/978-3-319-70636-8_3(35-46)Online publication date: 2-Feb-2018
https://doi.org/10.1007/978-3-319-70636-8_3
Holzmann G(2018)Explicit-State Model CheckingHandbook of Model Checking10.1007/978-3-319-10575-8_5(153-171)Online publication date: 19-May-2018
https://doi.org/10.1007/978-3-319-10575-8_5
Thomson PDonaldson ABetts A(2016)Concurrency Testing Using Controlled SchedulersACM Transactions on Parallel Computing10.1145/28586512:4(1-37)Online publication date: 9-Feb-2016
https://dl.acm.org/doi/10.1145/2858651
Kong WHou GHu XArimoto YWatanabe MAndo THisazumi KFukuda A(2016)ZipPath: A Simple-But-Useful Path Finder for HSTM Designs in ZIPC2016 IEEE International Conference on Agents (ICA)10.1109/ICA.2016.052(154-157)Online publication date: Sep-2016
https://doi.org/10.1109/ICA.2016.052
Kong WHou GHu XAndo THisazumi KFukuda A(2016)Garakabu2Journal of Information Security and Applications10.1016/j.jisa.2016.08.00131:C(61-74)Online publication date: 1-Dec-2016
https://dl.acm.org/doi/10.1016/j.jisa.2016.08.001
Holzmann G(2016)Cloud-Based Verification of Concurrent SoftwareProceedings of the 17th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 958310.1007/978-3-662-49122-5_15(311-327)Online publication date: 17-Jan-2016
https://dl.acm.org/doi/10.1007/978-3-662-49122-5_15
Kong WAndo TYatsu HHisazumi KFukuda A(2015)Garakabu2: An SMT-based Bounded Model Checker for HSTM Designs in ZIPC2015 2nd International Symposium on Dependable Computing and Internet of Things (DCIT)10.1109/DCIT.2015.8(21-29)Online publication date: Nov-2015
https://doi.org/10.1109/DCIT.2015.8
Thomson PDonaldson ABetts A(2014)Concurrency testing using schedule boundingACM SIGPLAN Notices10.1145/2692916.255526049:8(15-28)Online publication date: 6-Feb-2014
https://dl.acm.org/doi/10.1145/2692916.2555260
Thomson PDonaldson ABetts AMoreira JLarus J(2014)Concurrency testing using schedule boundingProceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming10.1145/2555243.2555260(15-28)Online publication date: 6-Feb-2014
https://dl.acm.org/doi/10.1145/2555243.2555260
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Abstract

References

References

Cited By

Index Terms

Recommendations

Bounded model checking of high-integrity software

Improving Non-Progress Cycle Checks

Bounded model checking of high-integrity software

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations