Skip to main content

Verifying Temporal Relational Models with Pardinus

  • Conference paper
  • First Online:
Rigorous State-Based Methods (ABZ 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14010))

Included in the following conference series:

  • 217 Accesses

Abstract

This short paper summarizes an article published in the Journal of Automated Reasoning [7]. It presents \(\textsf{Pardinus}\), an extension of the popular \(\textsf{Kodkod}\) [12] relational model finder with linear temporal logic (including past operators) to simplify the analysis of dynamic systems. \(\textsf{Pardinus}\) includes a SAT-based bounded model checking engine and an SMV-based complete model checking engine, both allowing iteration through the different instances (or counterexamples) of a specification. It also supports a decomposed parallel analysis strategy that improves the efficiency of both analysis engines on commodity multi-core machines.

Work financed by the European Regional Development Fund (ERDF) through the Operational Programme for Competitiveness and Internationalisation (COMPETE2020) and by National Funds through the Portuguese funding agency, Fundação para a Ciência e a Tecnologia (FCT) within project POCI-01-0145-FEDER-016826 and by the French Research Agency project FORMEDICIS ANR-16-CE25-0007 and by the research project CONCORDE of the Defense Innovation Agency (AID) of the French Ministry of Defense (2019650090004707501).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://github.com/AlloyTools/org.alloytools.alloy/releases/tag/v6.0.0.

References

  1. Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 193–207. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-49059-0_14

    Chapter  Google Scholar 

  2. Brunel, J., Chemouil, D., Cunha, A., Macedo, N.: The electrum analyzer: model checking relational first-order temporal specifications. In: ASE, pp. 884–887. ACM (2018)

    Google Scholar 

  3. Brunel, J., Chemouil, D., Cunha, A., Macedo, N.: Simulation under arbitrary temporal logic constraints. In: F-IDE@FM. EPTCS, vol. 310, pp. 63–69 (2019)

    Google Scholar 

  4. Cavada, R., et al.: NuSMV 2.6 User Manual. FBK-IRST (2010). http://nusmv.fbk.eu/NuSMV/userman/v26/nusmv.pdf

  5. Chang, E., Roberts, R.: An improved algorithm for decentralized extrema-finding in circular configurations of processes. Commun. ACM 22(5), 281–283 (1979)

    Article  MATH  Google Scholar 

  6. Jackson, D.: Software Abstractions: Logic, Language, and Analysis, 2nd edn. MIT Press, Cambridge (2016)

    Google Scholar 

  7. Macedo, N., Brunel, J., Chemouil, D., Cunha, A.: Pardinus: a temporal relational model finder. J. Autom. Reason. 66, 861–904 (2022)

    Article  MathSciNet  MATH  Google Scholar 

  8. Macedo, N., Brunel, J., Chemouil, D., Cunha, A., Kuperberg, D.: Lightweight specification and analysis of dynamic systems with rich configurations. In: SIGSOFT FSE, pp. 373–383. ACM (2016)

    Google Scholar 

  9. Macedo, N., Cunha, A., Pessoa, E.: Exploiting partial knowledge for efficient model analysis. In: D’Souza, D., Narayan Kumar, K. (eds.) ATVA 2017. LNCS, vol. 10482, pp. 344–362. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68167-2_23

    Chapter  MATH  Google Scholar 

  10. Rozier, K.Y., Vardi, M.Y.: LTL satisfiability checking. STTT 12(2), 123–137 (2010)

    Article  Google Scholar 

  11. Siegel, A., Santomauro, M., Dyer, T., Nelson, T., Krishnamurthi, S.: Prototyping formal methods tools: a protocol analysis case study. In: Dougherty, D., Meseguer, J., Mödersheim, S.A., Rowe, P. (eds.) Protocols, Strands, and Logic. LNCS, vol. 13066, pp. 394–413. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-91631-2_22

    Chapter  Google Scholar 

  12. Torlak, E., Jackson, D.: Kodkod: a relational model finder. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 632–647. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-71209-1_49

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nuno Macedo .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Macedo, N., Brunel, J., Chemouil, D., Cunha, A. (2023). Verifying Temporal Relational Models with Pardinus. In: Glässer, U., Creissac Campos, J., Méry, D., Palanque, P. (eds) Rigorous State-Based Methods. ABZ 2023. Lecture Notes in Computer Science, vol 14010. Springer, Cham. https://doi.org/10.1007/978-3-031-33163-3_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-33163-3_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-33162-6

  • Online ISBN: 978-3-031-33163-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics