View in EDS

Translating B to TLA+ for validation with TLC.

Saved in:

Bibliographic Details
Title:	Translating B to TLA+ for validation with TLC.
Authors:	Hansen, Dominik¹ hansen@cs.uni-duesseldorf.de, Leuschel, Michael¹ leuschel@cs.uni-duesseldorf.de
Source:	Science of Computer Programming. Dec2016, Vol. 131, p109-125. 17p.
Subjects:	B method (Computer science), Programming languages, Predicate (Logic), Set theory, Computer programming, Translating machines
Abstract:	The state-based formal methods B and TLA + share the common base of predicate logic, arithmetic and set theory. However, there are still considerable differences, such as the way to specify state transitions, the different approaches to typing, and the available tool support. In this paper, we present a translation from B to TLA + so as to validate B specifications using the model checker TLC . The translation includes many adaptations and optimizations to allow for efficient checking by TLC . Moreover, we present a way to validate liveness properties for B specifications under fairness conditions. Our implemented translator, Tlc4B , automatically translates a B specification to TLA + , invokes the model checker TLC , and translates the results back to B. We use ProB to double check the counter examples produced by TLC and replay them in the ProB animator. Tlc4B can also transmit constant values, precalculated by ProB , to TLC . This allows the user to combine the strength of both tools, i.e. ProB 's constraint solving abilities and TLC 's highly tuned model checking core. Furthermore, we demonstrate an approach to optimize the model checking process by encoding proof information in the translated TLA + specification. We also present a series of case studies and benchmark tests comparing Tlc4B and ProB . [ABSTRACT FROM AUTHOR]
	Copyright of Science of Computer Programming is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	The state-based formal methods B and TLA + share the common base of predicate logic, arithmetic and set theory. However, there are still considerable differences, such as the way to specify state transitions, the different approaches to typing, and the available tool support. In this paper, we present a translation from B to TLA + so as to validate B specifications using the model checker TLC . The translation includes many adaptations and optimizations to allow for efficient checking by TLC . Moreover, we present a way to validate liveness properties for B specifications under fairness conditions. Our implemented translator, Tlc4B , automatically translates a B specification to TLA + , invokes the model checker TLC , and translates the results back to B. We use ProB to double check the counter examples produced by TLC and replay them in the ProB animator. Tlc4B can also transmit constant values, precalculated by ProB , to TLC . This allows the user to combine the strength of both tools, i.e. ProB 's constraint solving abilities and TLC 's highly tuned model checking core. Furthermore, we demonstrate an approach to optimize the model checking process by encoding proof information in the translated TLA + specification. We also present a series of case studies and benchmark tests comparing Tlc4B and ProB . [ABSTRACT FROM AUTHOR]
ISSN:	01676423
DOI:	10.1016/j.scico.2016.04.014