{"title":"Pragmatics of Formally Verified Yet Efficient Static Analysis, in particular for Formally Verified Compilers","authors":"David MonniauxVERIMAG - IMAG","doi":"arxiv-2407.08258","DOIUrl":null,"url":null,"abstract":"Formally verified compilers and formally verified static analyzers are a\nsolution to the problem that certain industries face when they have to\ndemonstrate to authorities that the object code they run truly corresponds to\nits source code and that it satisfies certain properties. From a scientific and\ntechnological point of view, they are a challenge: not only a number of\nnontrivial invariants and algorithms must be proved to be correct, but also the\nimplementation must be reasonably effective so that the tools operate within\nreasonable time. Many optimizations in compilers rely on static analysis, and\nthus a formally verified compiler entails formally verified static analyses.In\nthis article, we explain some difficulties, possible solutions, design choices\nand trade-offs pertaining to verified static analysis, in particular when the\nsolution of the analysis is expressed as some form of tree, map or set.","PeriodicalId":501197,"journal":{"name":"arXiv - CS - Programming Languages","volume":"19 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Programming Languages","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2407.08258","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Formally verified compilers and formally verified static analyzers are a
solution to the problem that certain industries face when they have to
demonstrate to authorities that the object code they run truly corresponds to
its source code and that it satisfies certain properties. From a scientific and
technological point of view, they are a challenge: not only a number of
nontrivial invariants and algorithms must be proved to be correct, but also the
implementation must be reasonably effective so that the tools operate within
reasonable time. Many optimizations in compilers rely on static analysis, and
thus a formally verified compiler entails formally verified static analyses.In
this article, we explain some difficulties, possible solutions, design choices
and trade-offs pertaining to verified static analysis, in particular when the
solution of the analysis is expressed as some form of tree, map or set.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
