Relational methods in the analysis of while loops: observations of versatility

DOI10.1007/978-3-642-04639-1_17MaRDI QIDQ3651520zbMATH OpenOpenAlexFDO

Authors Asma Louhichi, Olfa Mraihi, Lamia Labed Jilani, Khaled Bsaies, Ali Mili

Publication date 11 December 2009

Published in Relations and Kleene Algebra in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04639-1_17

zbMATH Keywords

computing loop behaviorfunction extractioninvariant assertionsinvariant functionsinvariant relationsloop functionsrefinement calculusrelational calculus

Mathematics Subject Classification ID

Cylindric and polyadic algebras; relation algebras (03G15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Invariant functions and invariant relations: an alternative to invariant assertions
• Reflexive transitive invariant relations: A basis for computing loop functions
• A versatile concept for the analysis of loops
• Strongest invariant functions: Their use in the systematic analysis of while statements
• Heuristics for constructing while loops

Cited in

(5)

• Heuristics for constructing while loops
• Invariant functions and invariant relations: an alternative to invariant assertions
• A versatile concept for the analysis of loops
• Reflexive transitive invariant relations: A basis for computing loop functions
• Strongest invariant functions: Their use in the systematic analysis of while statements

This page was built for publication: Relational methods in the analysis of while loops: observations of versatility

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