Formal verification of compiler transformations for speculative real-time execution

Document Type

Article

Publication Date

1-1-1998

Abstract

There have been a number of successes in the past few years in use of formal methods for verification of real-time systems, and also in source-to-source transformation of these systems for improved analysis, performance, and schedulability. What has been lacking are formal proofs that these transformations preserve, or establish program properties. We have previously developed a set of compiler transformation rules for safe and profitable speculative execution in real-time systems. In this paper, we present formal proofs that our transformations preserve both the semantic and the timeliness properties of programs. Our approach uses temporal logic, enhanced with a denotational-semantics-like representation of program stores. While the paper focuses on the speculative execution transformations, the approach is applicable to other real-time compiler-based transformations and code optimization. © 1998 Elsevier Science Ltd. All rights reserved.

Identifier

0032141536 (Scopus)

Publication Title

Automatica

External Full Text Location

https://doi.org/10.1016/S0005-1098(98)00034-X

ISSN

00051098

First Page

939

Last Page

952

Issue

8

Volume

34

Grant

CCR-9402827

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS