A General Completeness Result in Refinement

@inproceedings{Kinoshita1999AGC,
  title={A General Completeness Result in Refinement},
  author={Yoshiki Kinoshita and John Power},
  booktitle={WADT},
  year={1999}
}
In a paper in 1986, Hoare, He and Sanders proposed a formulation of refinement for a system equivalent to the ν-calculus using a relation based semantics. To give a proof method to show that one program is a refinement of another, they introduced downward simulation and upward simulation, but the proof method based upon either of them is not complete with respect to their notion of refinement, so they claimed “joint” completeness based upon both notions of simulation with respect to their… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

He Jifeng, and Jeff W

C.A.R. Hoare
Sanders. Prespecification in data refinement. Information Processing Letters, 25:71–76, • 1987
View 11 Excerpts
Highly Influenced

Data Refinement: Model-oriented Proof Theories and their Comparison

Cambridge Tracts in Theoretical Computer Science • 1998
View 4 Excerpts
Highly Influenced

A single complete rule for data refinement

Formal Aspects of Computing • 1993
View 4 Excerpts
Highly Influenced

Algebraic structure for bicategory enriched categories

R. Gordon, A. J. Power
Journal of Pure and Applied Algebra, 130:119–132, • 1998

and J

J. He, C.A.R. Hoare
W. Sanders. Data refinement refined. volume 213 of Springer Lecture Notes in Computer Science, pages 186–196, • 1986
View 3 Excerpts

An outline of functorial semantics

F.E.J. Linton
In Seminar on triples and categorical homology theory, number 80 in Springer Lecture Notes in Computer Science, pages 7–52. Springer-Verlag, • 1966
View 1 Excerpt

Similar Papers

Loading similar papers…