Work

Invariant relations for affine loops

Year: 2024

Type: article

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.

Source: Acta Informatica

DOI: 10.1007/s00236-024-00457-9

Authors: Wided Ghardallou, Hessamaldin Mohammadi, Richard C. Linger, Mark Pleszkoch, JiMeng Loh, Ali Mili

Institutions: University of Sousse, New Jersey Institute of Technology, Institute For Defense Analyses

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,090

OpenAlex ID: W4396869286

FWCI: 0.147

Cites: 45

Cited by: 1

Related to: 10