A formulation of TLA in Isabelle
From MaRDI portal
Recommendations
Cited in
(13)- An embedding of timed transition systems in \(HOL\)
- Formal proof of a machine closed theorem in Coq
- Automatic verification of TLA\(^{ + }\) proof obligations with SMT solvers
- An Axiomatic Value Model for Isabelle/UTP
- Using the TPTP Language for Writing Derivations and Finite Interpretations
- I/O automata and beyond: Temporal logic and abstraction in Isabelle
- TLA + Proofs
- scientific article; zbMATH DE number 2172804 (Why is no real title available?)
- scientific article; zbMATH DE number 910717 (Why is no real title available?)
- Modular reasoning about structured TLA specifications
- Animating TLA specifications
- Proving linearizability with temporal logic
- Inference rules for programming languages with side effects in expressions
This page was built for publication: A formulation of TLA in Isabelle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3024875)