Corpus ID: 18019783

A Language of Reenements

@inproceedings{Gardinery1994ALO,
  title={A Language of Reenements},
  author={Paul Gardinery},
  year={1994}
}
  • Paul Gardinery
  • Published 1994
  • The reenement calculus is a formal technique for the development of programs which are provably correct with respect to their speciications. A formal language is presented for the description of program development using the reenement calculus. The language provides an abstract representation of the overall program development, reeecting its tree-like structure. The language is used for recording developments in the reenement editor { an automated tool supporting the reenement calculus. 

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    References

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

    editors

    • C. C. Morgan, T. N. Vickers
    • On the Re nement Calculus. Springer
    • 1994
    VIEW 2 EXCERPTS

    Data Refinement of Predicate Transformers

    VIEW 1 EXCERPT

    An overview of a re nement editor

    • T. N. Vickers
    • In Proceedings 5th Australian Software Engineering Conference,
    • 1990

    Programming from specifications

    • Carroll Morgan
    • Computer Science
    • Prentice Hall International Series in computer science
    • 1990
    VIEW 3 EXCERPTS

    Types and Invariants in the Refinement Calculus

    VIEW 1 EXCERPT

    A calculus of re nements for program derivations

    • R.-J.R. Back
    • Acta Informatica, 25:593{ 624
    • 1988
    VIEW 1 EXCERPT