Invariant relations for affine loops

Document Type

Article

Publication Date

9-1-2024

Abstract

Invariant relations are used to analyze while loops; while their primary application is to derive the function of a loop, they can also be used to derive loop invariants, weakest preconditions, strongest postconditions, sufficient conditions of correctness, necessary conditions of correctness, and termination conditions of loops. In this paper we present two generic invariant relations that capture the semantics of loops whose loop body applies affine transformations on numeric variables.

Identifier

85192832309 (Scopus)

Publication Title

Acta Informatica

External Full Text Location

https://doi.org/10.1007/s00236-024-00457-9

e-ISSN

14320525

ISSN

00015903

First Page

261

Last Page

314

Issue

3

Volume

61

Grant

DGE 1565478

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS