Programming Research Group a Weakest Precondition Semantics for Z (extended Version) a Weakest Precondition Semantics for Z (extended Version)

@inproceedings{Cavalcanti1997ProgrammingRG,
  title={Programming Research Group a Weakest Precondition Semantics for Z (extended Version) a Weakest Precondition Semantics for Z (extended Version)},
  author={Ana Cavalcanti and Jim Woodcock},
  year={1997}
}
The lack of a method for developing programs from Z speciications is a diiculty widely recognised. In response to this problem, diierent approaches to the integration of Z with a reenement calculus have been proposed. These programming techniques are promising, but, as far as we know, have not been formalised. Since they are based on reenement calculi formalised in terms of weakest preconditions, the deenition of a weakest precondition semantics for Z is a signiicant contribution to the… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 19 REFERENCES

Formal Methods for Stepwise Re nement in the Z Speci cation Lan- guage

  • M. B. Josephs
  • Tech-Report TR-PRG-1-86,
  • 1996

Adding Speci cation Constructors to the Re nement Calculus

  • N. Ward
  • FME'93: Industrial-Strength Formal Methods,
  • 1993

The fuzz Manual, 2nd edn

  • J. M. Spivey
  • Computing Science Consultancy,
  • 1992
1 Excerpt

Similar Papers

Loading similar papers…