Z2SAL - Building a Model Checker for Z

Derrick, John; North, Siobhán; Simons, Anthony J. H.

doi:10.1007/978-3-540-87603-8_22

Cited by 11 publications

(19 citation statements)

References 10 publications

(16 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In most recent studies, there is ProZ [48] which was developed from ProB [55], data refinement verification [8] which uses Alloy SAT-solver based counter-example, and Z2SAL [20] which is a translator from a Z language specification into a SAL language specification [18].…”

Section: Fastestmentioning

confidence: 99%

Support for Model Checking Z Specifications

Siregar

2016

2016 IEEE 17th International Conference on Information Reuse and Integration (IRI)

View full text Add to dashboard Cite

One of deficiencies in the Z tools is that there is limited support for model checking Z specifications. To build a model checker directly for a Z specification would take considerable effort and time due to the abstraction of the language. Translating inputs of a Z specification into a language that an existing model checker tool accepts is an alternative method. Researchers at the University of Sheffield implemented a translation tool which took a Z specification and translated it into the input for the Symbolic Analysis Laboratory (SAL) tool, a framework for combining different tools for abstraction, program analysis, theorem proving and model checking, which they called Z2SAL. In this paper, support for model checking Z specifications is discussed, in which the ability of the existing Z2SAL is extended. This support includes a translation for generic constant and schema calculus. Instead of translating these aspects of the Z language into the SAL language as Z2SAL does, a Z specification containing these two notations will be pre-processed, in which a generic constant definition will be redefined to its equivalent axiomatic definition, and schema calculus will be expanded to a new schema definition. This paper discusses the implementation of these types of support, and illustration of some working examples. The discussion also includes other several issues related to a new approach in translating Z functions and constants in SAL language, which originates from the type incompatibility obtained during execution by the SAL tool, an approach to a SAL translation of embedded theorems on Z specifications, and a manual experiment on applying an abstraction on Z specifications. Results have been gathered during our experiments with the implemented support. Several of these results could be translated by Z2SAL and be executed by the SAL tool.

show abstract

Section: Fastestmentioning

confidence: 99%

Support for Model Checking Z Specifications

Siregar

2016

2016 IEEE 17th International Conference on Information Reuse and Integration (IRI)

View full text Add to dashboard Cite

show abstract

“…In [DNS06] we highlighted problems with countable sets. In [DNS08] we described an improved treatment for countable sets, and new translations for relations and functions. In this extended paper, we also report on improvements in the treatment of Z function types, a translation for sequences and an improved translation for operation schema variables, which greatly reduces the state space.…”

Section: The Symbolic Analysis Laboratorymentioning

confidence: 99%

“…The following describes the SAL output, resulting from the translation of the above Z specification. This uses the latest SAL encodings reported in this paper, and so differs from the example reported in [DNS08], in that the number of SAL input and output variables is reduced by coalescing (see Section 4); and the initial values of output variables are clamped. …”

Section: Case Studymentioning

confidence: 99%

“…To evaluate the effects of the latest revisions to the SAL translation, we simulated three different encodings. The first is the original encoding reported in [DNS08], with replicated input and output variables for each operation schema and no output-clamping. The second version clamps the initial values of output variables to the first value in the range of the type (chosen arbitrarily).…”

mentioning

confidence: 99%

See 1 more Smart Citation

Z2SAL: a translation-based model checker for Z

2011

Self Cite

View full text Add to dashboard Cite

Abstract. Despite being widely known and accepted in industry, the Z formal specification language has not so far been well supported by automated verification tools, mostly because of the challenges in handling the abstraction of the language. In this paper we discuss a novel approach to building a model-checker for Z, which involves implementing a translation from Z into SAL, the input language for the Symbolic Analysis Laboratory, a toolset which includes a number of model-checkers and a simulator. The Z2SAL translation deals with a number of important issues, including: mapping unbounded, abstract specifications into bounded, finite models amenable to a BDD-based symbolic checker; converting a non-constructive and piecemeal style of functional specification into a deterministic, automaton-based style of specification; and supporting the rich set-based vocabulary of the Z mathematical toolkit. This paper discusses progress made towards implementing as complete and faithful a translation as possible, while highlighting certain assumptions, respecting certain limitations and making use of available optimisations. The translation is illustrated throughout with examples; and a complete working example is presented, together with performance data.

show abstract

“…In formal methods, languages are usually supported by theorem provers but model checking has recently been investigated as well and model checkers have been developed for languages like Z [1][2][3], CSP [4], or classical B [5]. This paper addresses the problem of model checking Event-B.…”

Section: Introductionmentioning

confidence: 99%

A Lazy Unbounded Model Checker for Event-B

Matos

Fischer

Marques-Silva

2009

Formal Methods and Software Engineering

View full text Add to dashboard Cite

Abstract. Formal specification languages are traditionally supported by theorem provers, but recently model checkers have proven to be useful tools. In this paper we present Eboc, an explicit state model checker for Event-B. Eboc is based on lazy techniques that allow it to fairly perform an exhaustive state space search without bounding the size of the sets used in the specification. We describe the implementation of Eboc and provide a preliminary comparison with ProB, an existing bounded model checker for classical B.

show abstract

Z2SAL - Building a Model Checker for Z

Cited by 11 publications

References 10 publications

Support for Model Checking Z Specifications

Support for Model Checking Z Specifications

Z2SAL: a translation-based model checker for Z

A Lazy Unbounded Model Checker for Event-B

Contact Info

Product

Resources

About