{"title":"Handling expression evaluation under interference","authors":"Ian J. Hayes, Cliff B. Jones, Larissa A. Meinicke","doi":"arxiv-2409.07741","DOIUrl":null,"url":null,"abstract":"Hoare-style inference rules for program constructs permit the copying of\nexpressions and tests from program text into logical contexts. It is known that\nthis requires care even for sequential programs but further issues arise for\nconcurrent programs because of potential interference to the values of\nvariables. The \"rely-guarantee\" approach does tackle the issue of recording\nacceptable interference and offers a way to provide safe inference rules. This\npaper shows how the algebraic presentation of rely-guarantee ideas can clarify\nand formalise the conditions for safely re-using expressions and tests from\nprogram text in logical contexts for reasoning about programs.","PeriodicalId":501278,"journal":{"name":"arXiv - CS - Software Engineering","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.07741","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Hoare-style inference rules for program constructs permit the copying of
expressions and tests from program text into logical contexts. It is known that
this requires care even for sequential programs but further issues arise for
concurrent programs because of potential interference to the values of
variables. The "rely-guarantee" approach does tackle the issue of recording
acceptable interference and offers a way to provide safe inference rules. This
paper shows how the algebraic presentation of rely-guarantee ideas can clarify
and formalise the conditions for safely re-using expressions and tests from
program text in logical contexts for reasoning about programs.