Should your specification language be typed
ACM Transactions on Programming Languages and Systems (TOPLAS)
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers
Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Zenon: an extensible automated theorem prover producing checkable proofs
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Memoir: Practical State Continuity for Protected Modules
SP '11 Proceedings of the 2011 IEEE Symposium on Security and Privacy
Extending Sledgehammer with SMT solvers
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Automatic verification for a class of proof obligations with SMT-solvers
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
Verifying safety properties with the TLA+ proof system
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Translating TLA+ to b for validation with ProB
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
A mechanized model for CAN protocols
FASE'13 Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering
| Hi-index | 0.00 |
TLA+ is a formal specification language that is based on ZF set theory and the Temporal Logic of Actions TLA. The TLA+ proof system tlaps assists users in deductively verifying safety properties of TLA+ specifications. tlaps is built around a proof manager, which interprets the TLA+ proof language, generates corresponding proof obligations, and passes them to backend verifiers. In this paper we present a new backend for use with SMT solvers that supports elementary set theory, functions, arithmetic, tuples, and records. Type information required by the solvers is provided by a typing discipline for TLA+ proof obligations, which helps us disambiguate the translation of expressions of (untyped) TLA+ , while ensuring its soundness. Preliminary results show that the backend can help to significantly increase the degree of automation of certain interactive proofs.