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, Dominik1 hansen@cs.uni-duesseldorf.de, Leuschel, Michael1 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
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 118898541
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Translating B to TLA+ for validation with TLC.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Hansen%2C+Dominik%22">Hansen, Dominik</searchLink><relatesTo>1</relatesTo><i> hansen@cs.uni-duesseldorf.de</i><br /><searchLink fieldCode="AR" term="%22Leuschel%2C+Michael%22">Leuschel, Michael</searchLink><relatesTo>1</relatesTo><i> leuschel@cs.uni-duesseldorf.de</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Science+of+Computer+Programming%22">Science of Computer Programming</searchLink>. Dec2016, Vol. 131, p109-125. 17p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22B+method+%28Computer+science%29%22">B method (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Programming+languages%22">Programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22Predicate+%28Logic%29%22">Predicate (Logic)</searchLink><br /><searchLink fieldCode="DE" term="%22Set+theory%22">Set theory</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+programming%22">Computer programming</searchLink><br /><searchLink fieldCode="DE" term="%22Translating+machines%22">Translating machines</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=118898541
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.scico.2016.04.014
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 17
        StartPage: 109
    Subjects:
      – SubjectFull: B method (Computer science)
        Type: general
      – SubjectFull: Programming languages
        Type: general
      – SubjectFull: Predicate (Logic)
        Type: general
      – SubjectFull: Set theory
        Type: general
      – SubjectFull: Computer programming
        Type: general
      – SubjectFull: Translating machines
        Type: general
    Titles:
      – TitleFull: Translating B to TLA+ for validation with TLC.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Hansen, Dominik
      – PersonEntity:
          Name:
            NameFull: Leuschel, Michael
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 12
              Text: Dec2016
              Type: published
              Y: 2016
          Identifiers:
            – Type: issn-print
              Value: 01676423
          Numbering:
            – Type: volume
              Value: 131
          Titles:
            – TitleFull: Science of Computer Programming
              Type: main
ResultId 1