Model checking Object-Z classes: Some experiments with FDR

Kassel, G.; Smith, Graeme

doi:10.1109/apsec.2001.991513

Cited by 8 publications

(3 citation statements)

References 12 publications

(24 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Work on automatic refinement checking includes that of Bolton who has used Alloy to verify data refinements in Z [1]. There have also been a number of encoding of subsets of Z-based languages in the CSP model checker FDR [11,17,14], which checks that refinement holds between two specifications by comparing the failures/divergences semantics of the specifications; and simulation-based refinement can be encoded as a failures/divergences check [7,13,12].…”

Section: Resultsmentioning

confidence: 99%

Building a refinement checker for Z

Derrick¹,

North²,

Simons³

2011

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

In previous work we have described how refinements can be checked using a temporal logic based model-checker, and how we have built a model-checker for Z by providing a translation of Z into the SAL input language. In this paper we draw these two strands of work together and discuss how we have implemented refinement checking in our Z2SAL toolset.The net effect of this work is that the SAL toolset can be used to check refinements between Z specifications supplied as input files written in the L A T E Xmark-up. Two examples are used to illustrate the approach and compare it with a manual translation and refinement check.

show abstract

Section: Resultsmentioning

confidence: 99%

Building a refinement checker for Z

Derrick¹,

North²,

Simons³

2011

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…For example, there have been a number of encodings of subsets of Z-based languages in the CSP model checker FDR [12,19,16]. FDR checks refinements by comparing the failures/divergences semantics of the specifications [24]; an approach which is equivalent to simulation-based refinement [15,13] but does not require a retrieve relation.…”

Section: Introductionmentioning

confidence: 99%

Using Model Checking to Automatically Find Retrieve Relations

Derrick

Smith

2008

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

Downward and upward simulations form a sound and jointly complete methodology for verifying relational data refinement in state-based specification languages such as Z and B. In previous work, we showed how both downward and upward simulation conditions can be discharged using a CTL model checker. The approach was implemented in the SAL tool suite. Given the retrieve relation, each of the simulation conditions can be proven fully automatically. It has been recognised, however, that finding retrieve relations is often very hard. In this paper, we show how it is feasible to use the SAL model checkers to also generate retrieve relations.

show abstract

“…For example, Fischer and Wehrheim [5] integrate Object-Z with CSP and apply the modelchecker FDR. Kassel and Smith [15] investigate an alternative approach for plain Object-Z but also exploit the CSP semantics for their mapping into CSP M (the language of FDR). Although CSP M is sufficiently expressible to cover many language constructs provided for Object-Z predicates, neither object referencing nor operation operators are supported.…”

Section: Introductionmentioning

confidence: 99%

Model Checking Object-Z Using ASM

Winter

Duke

2002

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.A major problem with creating tools for Object-Z is that its high-level abstractions are difficult to deal with directly. Integrating Object-Z with a more concrete notation is a sound strategy. With this in mind, in this paper we introduce an approach to model-checking Object-Z specifications based on first integrating Object-Z with the Abstract State Machine (ASM) notation to get the notation OZ-ASM. We show that this notation can be readily translated into the specification language ASM-SL, a language that can be automatically translated into the language of the temporal logic model checker SMV.

show abstract

Model checking Object-Z classes: Some experiments with FDR

Cited by 8 publications

References 12 publications

Building a refinement checker for Z

Building a refinement checker for Z

Using Model Checking to Automatically Find Retrieve Relations

Model Checking Object-Z Using ASM

Contact Info

Product

Resources

About