Previous work on formally modelling and analysing program compilation has shown the need for a simple and expressive semantics for assembler level programs.

Previous work on formally modelling and analysing program compilation has shown the need for a simple and expressive semantics for assembler level programs.

A Partial-Correctness Semantics for Modelling Assembler Programs. Geoffrey Watson and Colin Fidge. School of Information Technology and Electrical Engineering.

This paper provides the syntax and semantics for a systematic approach to the problem of analysing control-flow paths in computer programs.

The author of this paper describes a new concept of partial correctness of programs better suited to specification purposes than the classical one and ...

Previous work on formally modelling and analysing program compilation has shown the need for a simple and expressive semantics for assembler level programs.

Describe the approach of using axiomatic semantics to prove the correctness of a given program. Axiomatic semantics are based on mathematical logic and the ...

A Partial-Correctness Semantics for. Modelling Assembler Programs. In Proceedings of the First International. Conference on Software Engineering and Formal ...

We give an abstract syntax and a partial correctness semantics for program control-flow paths as a generic model for path analysis and constraint derivation.

The use of axiomatic semantics for proving the correctness of small programs is introduced in the third section of this chapter. Formally proving the ...