Article

An improvement of the piggyback algorithm for parallel model checking

Authors:

Ioannis Filippidis,

Gerard J. HolzmannAuthors Info & Claims

SPIN 2014: Proceedings of the 2014 International SPIN Symposium on Model Checking of Software

Pages 48 - 57

https://doi.org/10.1145/2632362.2632375

Published: 21 July 2014 Publication History

Abstract

This paper extends the piggyback algorithm to enlarge the set of liveness properties it can verify. Its extension is motivated by an attempt to express in logic the counterexamples it can detect and relate them to bounded liveness. The original algorithm is based on parallel breadth-first search and piggybacking of accepting states that are deleted after counting a fixed number of transitions. The main improvement is obtained by renewing the counter of transitions when the same accepting states are visited in the negated property automaton. In addition, we describe piggybacking of multiple states in either sets (exact) or Bloom filters (lossy but conservative), and use of local searches that attempt to connect cycles fragmented among processing cores. Finally it is proved that accepting cycle detection is in NC in the size of the product automaton's entire state space, including unreachable states.

References

[1]

P. S. Almeida, C. Baquero, N. Preguiça, and D. Hutchison. Scalable bloom filters. Inf. Process. Lett., 101(6):255–261, 2007.

Digital Library

[2]

R. Alur and D. L. Dill. A theory of timed automata. Theor. Comput. Sci., 126(2):183–235, 1994.

Digital Library

[3]

R. Alur, K. Etessami, S. La Torre, and D. Peled. Parametric temporal logic for “model measuring”. ACM Trans. Comput. Logic, 2(3):388–407, 2001.

Digital Library

[4]

J. H. Anderson, Y.-J. Kim, and T. Herman. Shared-memory mutual exclusion: major research trends since 1986. Distr. Comp., 16(2-3):75–110, 2003.

Digital Library

[5]

C. Baier and J.-P. Katoen. Principles of Model Checking. The MIT Press, 2008.

Digital Library

[6]

J. Barnat, L. Brim, and I. Černá. Cluster-based ltl model checking of large systems. FMCO’05, pages 259–279, 2005.

[7]

E. Clarke, A. Biere, R. Raimi, and Y. Zhu. Bounded model checking using satisfiability solving. Formal Methods in System Design, 19(1):7–34, 2001.

Digital Library

[8]

C. Courcoubetis, M. Vardi, P. Wolper, and M. Yannakakis. Memory-efficient algorithms for the verification of temporal properties. FMSD, 1(2-3):275–288, 1992.

Digital Library

[9]

R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to Parallel Computation: P-completeness Theory. Oxford Univ. Press, 1995.

Digital Library

[10]

T. A. Henzinger, J.-F. Raskin, and P.-Y. Schobbens. Temporal logics, automata, and classical theories for defining real-time languages. Technical Report UCB/CSD-99-1074, Berkeley, 1999.

Digital Library

[11]

G. Holzmann. The model checker spin. Software Eng., IEEE Trans. on, 23(5):279–295, 1997.

Digital Library

[12]

G. Holzmann and D. Bosnacki. The design of a multicore extension of the spin model checker. Softw. Eng., IEEE Trans. on, 33(10):659–674, 2007.

Digital Library

[13]

G. J. Holzmann. Parallelizing the spin model checker. In Proc. 19th Intl. Conf. on Model Checking Softw., SPIN’12, pages 155–171, 2012.

Digital Library

[14]

G. J. Holzmann, D. Peled, and M. Yannakakis. On nested depth first search. SPIN’96, 32:81–89, 1996.

[15]

R. Koymans. Specifying real-time properties with metric temporal logic. Real-Time Systems, 2(4):255–299, 1990.

Digital Library

[16]

O. Kupferman, N. Piterman, and M. Y. Vardi. From liveness to promptness. In Proc. 19th Int. Conf. on Comp. Aided Verif., CAV’07, pages 406–406, 2007.

Digital Library

[17]

A. Laarman, R. Langerak, J. Van De Pol, M. Weber, and A. Wijs. Multi-core nested depth-first search. In Proc. 9th Intl Conf. on Autom. Tech. for Verif. and Anal., ATVA’11, pages 321–335, 2011.

Digital Library

[18]

L. Lamport. A new solution of dijkstra’s concurrent programming problem. CACM, 17(8):453–455, 1974.

Digital Library

[19]

L. Lamport. A fast mutual exclusion algorithm. ACM Trans. Comput. Syst., 5(1):1–11, 1987.

Digital Library

[20]

Z. Manna and A. Pnueli. Tools and rules for the practicing verifier. Technical report, Stanford, 1990.

Digital Library

[21]

P. E. O’Neil and E. J. O’Neil. A fast expected time algorithm for boolean matrix multiplication and transitive closure. Inf. & Control, 22(2):132––138, 1973.

[22]

C. H. Papadimitriou. Computational complexity. Addison-Wesley, 1994.

[23]

R. Pelánek. Beem: Benchmarks for explicit model checkers. In Proc. 14th SPIN Conf. on Model Checking Softw., pages 263–267, 2007.

Digital Library

[24]

J. H. Reif. Depth-first search is inherently sequential. Information Processing Letters, 20(5):229 – 234, 1985.

[25]

O. Reingold. Undirected connectivity in log-space. J. ACM, 55(4):17:1–17:24, 2008.

Digital Library

[26]

V. Schuppan and A. Biere. Efficient reduction of finite state model checking to reachability analysis. Int. J. Softw. Tools Technol. Transf., 5(2):185–204, 2004.

Digital Library

[27]

M. Sipser. Introduction to the Theory of Computation. Cengage Learning, 3 edition, 2013.

[28]

I. Černá and R. Pelánek. Relating hierarchy of linear temporal properties to model checking. Math. Found. Comp. Sc., 2747:318–327, 2003.

[29]

V. V. Williams. Multiplying matrices faster than coppersmith-winograd. STOC ’12, pages 887–898, 2012.

Digital Library

[30]

P. Wolper. Constructing automata from temporal logic formulas: a tutorial, volume 2090, pages 261–277. LNCS, 2002.

Digital Library

Cited By

Osama MWijs A(2024)Hitching a Ride to a Lasso: Massively Parallel On-The-Fly LTL Model CheckingTools and Algorithms for the Construction and Analysis of Systems10.1007/978-3-031-57249-4_2(23-43)Online publication date: 6-Apr-2024
https://dl.acm.org/doi/10.1007/978-3-031-57249-4_2
Khlifa SAbid CZouari B(2023)A Reduced Distributed Sate Space for Modular Petri NetsAdvanced Information Networking and Applications10.1007/978-3-031-29056-5_29(319-331)Online publication date: 20-Mar-2023
https://doi.org/10.1007/978-3-031-29056-5_29
Klai KAbid CArias JEvangelista S(2022)Hybrid Parallel Model Checking of Hybrid LTL on Hybrid State Space RepresentationVerification and Evaluation of Computer and Communication Systems10.1007/978-3-030-98850-0_3(27-42)Online publication date: 19-Mar-2022
https://doi.org/10.1007/978-3-030-98850-0_3
Show More Cited By

Index Terms

An improvement of the piggyback algorithm for parallel model checking

Recommendations

LTL satisfiability checking

We report here on an experimental investigation of LTL satisfiability checking via a reduction to model checking. By using large LTL formulas, we offer challenging model-checking benchmarks to both explicit and symbolic model checkers. For symbolic ...
Model Checking Process with Goal Oriented Requirements Analysis
APSEC '08: Proceedings of the 2008 15th Asia-Pacific Software Engineering Conference

Model checking is a powerful technique for verifying the correctness of a system’s specification. But even when the specification has been verified to be correct, there is still the question of whether the specification covers all the expected ...
Model checking propositional projection temporal logic based on SPIN
ICFEM'07: Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering

This paper investigates a model checking algorithm for Propositional Projection Temporal Logic (PPTL) with finite models. To this end, a PPTL formula is transformed to a Normal Form Graph (NFG), and then a Nondeterministic Finite Automaton (NFA). The ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPIN 2014: Proceedings of the 2014 International SPIN Symposium on Model Checking of Software

July 2014

136 pages

ISBN:9781450324526

DOI:10.1145/2632362

Program Chairs:
Neha Rungta
NASA Ames, USA
,
Oksana Tkachuk
NASA Ames, USA

Copyright © 2014 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

In-Cooperation

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 July 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

ISSTA '14

Sponsor:

SIGSOFT

ISSTA '14: International Symposium on Software Testing and Analysis

July 21 - 23, 2014

CA, San Jose, USA

Upcoming Conference

ICSE 2025

2025 IEEE/ACM 46th International Conference on Software Engineering

April 26 - May 3, 2025

Ottawa , ON , Canada

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
63
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Osama MWijs A(2024)Hitching a Ride to a Lasso: Massively Parallel On-The-Fly LTL Model CheckingTools and Algorithms for the Construction and Analysis of Systems10.1007/978-3-031-57249-4_2(23-43)Online publication date: 6-Apr-2024
https://dl.acm.org/doi/10.1007/978-3-031-57249-4_2
Khlifa SAbid CZouari B(2023)A Reduced Distributed Sate Space for Modular Petri NetsAdvanced Information Networking and Applications10.1007/978-3-031-29056-5_29(319-331)Online publication date: 20-Mar-2023
https://doi.org/10.1007/978-3-031-29056-5_29
Klai KAbid CArias JEvangelista S(2022)Hybrid Parallel Model Checking of Hybrid LTL on Hybrid State Space RepresentationVerification and Evaluation of Computer and Communication Systems10.1007/978-3-030-98850-0_3(27-42)Online publication date: 19-Mar-2022
https://doi.org/10.1007/978-3-030-98850-0_3
Kumazawa TTakimoto MKambayashi Y(2020)A Survey on the Applications of Swarm Intelligence to Software VerificationHandbook of Research on Fireworks Algorithms and Swarm Intelligence10.4018/978-1-7998-1659-1.ch017(376-398)Online publication date: 2020
https://doi.org/10.4018/978-1-7998-1659-1.ch017
Ameur Abid CKlai KArias JOuni H(2020)SOG-Based Multi-Core LTL Model Checking2020 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom)10.1109/ISPA-BDCloud-SocialCom-SustainCom51426.2020.00028(9-17)Online publication date: Dec-2020
https://doi.org/10.1109/ISPA-BDCloud-SocialCom-SustainCom51426.2020.00028
DeFrancisco RCho SFerdman MSmolka S(2020)Swarm model checking on the GPUInternational Journal on Software Tools for Technology Transfer10.1007/s10009-020-00576-xOnline publication date: 16-Jun-2020
https://doi.org/10.1007/s10009-020-00576-x
Ouni HKlai KAbid CZouari B(2019)Towards Parallel Verification of Concurrent Systems using the Symbolic Observation Graph2019 19th International Conference on Application of Concurrency to System Design (ACSD)10.1109/ACSD.2019.00007(23-32)Online publication date: Jun-2019
https://doi.org/10.1109/ACSD.2019.00007
Bloemen VDuret-Lutz APol J(2019)Model checking with generalized Rabin and Fin-less automataInternational Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-019-00508-421:3(307-324)Online publication date: 25-May-2019
https://dl.acm.org/doi/10.1007/s10009-019-00508-4
DeFrancisco RCho SFerdman MSmolka S(2019)Swarm Model Checking on the GPUModel Checking Software10.1007/978-3-030-30923-7_6(94-113)Online publication date: 2-Oct-2019
https://doi.org/10.1007/978-3-030-30923-7_6
Ouni HKlai KAbid CZouari B(2018)Reducing Time and/or Memory Consumption of the SOG Construction in a Parallel Context2018 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Ubiquitous Computing & Communications, Big Data & Cloud Computing, Social Computing & Networking, Sustainable Computing & Communications (ISPA/IUCC/BDCloud/SocialCom/SustainCom)10.1109/BDCloud.2018.00034(147-154)Online publication date: Dec-2018
https://doi.org/10.1109/BDCloud.2018.00034
Show More Cited By

View Options

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

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten