Skip to main content

Reconstruction of TLAPS Proofs Solved by VeriT in Lambdapi

  • 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:

  • 228 Accesses

Abstract

TLAPS, the TLA+ proof system [4], is a proof assistant for the development and mechanical verification of TLA\(^+\) proofs.

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

References

  1. Proofonomicon: A reference of the veriT proof format (2020). https://verit.loria.fr/documentation/proofonomicon.pdf

  2. Blanqui, F., Dowek, G., Grienenberger, E., Hondet, G., Thiré, F.: A modular construction of type theories. Logical Meth. Comput. Sci. 19(1), 1–28 (2021)

    MathSciNet  MATH  Google Scholar 

  3. Bouton, T., Caminha B. de Oliveira, D., Déharbe, D., Fontaine, P.: veriT: an open, trustable and efficient SMT-solver. In: Schmidt, R.A. (ed.) CADE 2009. LNCS (LNAI), vol. 5663, pp. 151–156. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-02959-2_12

    Chapter  Google Scholar 

  4. Cousineau, D., Doligez, D., Lamport, L., Merz, S., Ricketts, D., Vanzetto, H.: TLA\(^{+}\) Proof. In: Giannakopoulou, D., Méry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 147–154. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32759-9_14

    Chapter  Google Scholar 

  5. Czajka, Z., Kaliszyk, C.: Hammer for Coq: automation for dependent type theory. J. Autom. Reason. 61(1–4), 423–453 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  6. Fleury, M., Schurr, H.J.: Reconstructing veriT proofs in isabelle/HOL. In: PxTP 2019 - Sixth Workshop on Proof eXchange for Theorem Proving, vol. 301, pp. 36–50 (2019)

    Google Scholar 

  7. Kaliszyk, C., Urban, J.: Learning-assisted automated reasoning with flyspeck. J. Autom. Reason. 53(2), 173–213 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lamport, L.: The temporal logic of actions. ACM Trans. Program. Lang. Syst. 16(3), 872–923 (1994)

    Article  Google Scholar 

  9. Schurr, H.J., Fleury, M., Barbosa, H., Fontaine, P.: Alethe: towards a generic SMT proof format (extended abstract). In: PxTP 2021–7th Workshop on Proof eXchange for Theorem Proving. EPTCS, vol. 336, pp. 49–54 (2021)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Coltellacci Alessio .

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

Alessio, C. (2023). Reconstruction of TLAPS Proofs Solved by VeriT in Lambdapi. 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_29

Download citation

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

  • 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