论文信息 - Modelling program compilation in the refinement calculus

Modelling program compilation in the refinement calculus

We show how compilation of high-level language programs to assembler code can be formally represented in the refinement calculus. New operators are introduced to widen the modelling language to encompass assembler code. A compilation strategy is then embodied as a set of derived refinement rules.

Colin J. Fidge

[1] Jonathan P. Bowen. Towards Verified Systems , 1994 .

[2] Carroll Morgan,et al. Programming from specifications , 1990, Prentice Hall International Series in computer science.

[3] Carroll Morgan,et al. The Refinement Calculus , 1994, NATO ASI PDC.

[4] Martin Fränzle,et al. Towards Provably Correct Code Gneration for a Hard Real-Time Programming Language , 1994, CC.

[5] Theodore S. Norvell. Machine Code Programs are Predicates Too , 1994, Refine.

[6] Ralph-Johan Back. Refinement of Parallel and Reactive Programs , 1992, NATO ASI PDC.

[7] C. A. R. Hoare,et al. Provably Correct Systems , 1994, FTRTFT.

[8] Jifeng He. Provably Correct Systems: Modelling of Communication Languages and Design of Optimized Compilers , 1994 .

[9] Carroll Morgan,et al. The specification statement , 1988, TOPL.

[10] Colin J. Fidge,et al. Refinement of infeasible real-time programs , 1997, FME 1997.

[11] Carroll Morgan,et al. Programming from specifications (2nd ed.) , 1994 .

[12] Theodore S. Norvell,et al. A predicative theory of machine languages and its application to compiler correctness , 1994 .

[13] Egon Börger,et al. Correctness of Compiling Occam to Transputer Code , 1996, Comput. J..

[14] Ian J. Hayes,et al. Coercing real-time refinement: a transmitter , 1996, FME 1996.