Correctness of the compiling process based on axiomatic semantics

DOI10.1007/BF00289061zbMATH Open0432.68010MaRDI QIDQ1138902FDOQ1138902

Authors: Bruce Russell 

Publication date: 1980

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

program transformationscorrectnessaxiomatic semanticsblock structured programming languageverification rules

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• An axiomatic basis for computer programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• The denotational semantics of programming languages
• An axiomatic definition of the programming language Pascal
• Title not available (Why is that?)
• Program Improvement by Source-to-Source Transformation
• Proof Theory of Partial Correctness Verification Systems
• Implementation Correctness Involving a Language with <scp>goto</scp> Statements

Cited In (2)

• Average case optimality for linear problems
• Proving program inclusion using Hoare's logic

This page was built for publication: Correctness of the compiling process based on axiomatic semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1138902)