[CPP'24] Under-approximation for Scalable Bug Detection скачать в хорошем качестве

[CPP'24] Under-approximation for Scalable Bug Detection

[CPP'24] Under-approximation for Scalable Bug Detection Azalea Raad Under-Approximation for Scalable Bug Detection (Keynote) (Video, CPP 2024) Azalea Raad (Imperial College London, UK) Abstract: Incorrectness Logic (IL) has recently been advanced as a logical under-approximate theory for proving the presence of bugs - dual to Hoare Logic, which is an over-approximate theory for proving the absence of bugs. To facilitate scalable bug detection, later we developed incorrectness separation logic (ISL) by marrying the under-approximate reasoning of IL with the local reasoning of separation logic and its frame rule. This locality leads to techniques that are compositional both in code (concentrating on a program component) and in the resources accessed (spatial locality), without tracking the entire global state or the global program within which a component sits. This enables reasoning to scale to large teams and codebases: reasoning can be done even when a global program is not present. We then developed Pulse-X, an automatic program analysis for catching memory safety errors, underpinned by ISL. Using PulseX, deployed at Meta, we found a number of real bugs in codebases such as OpenSSL, which were subsequently confirmed and fixed. We have compared the performance of Pulse-X against the state-of-the-art tool Infer on a number of large programs; our comparison shows that Pulse-X is comparable with Infer in terms of performance, and in certain cases its fix-rate surpasses that of Infer. Article: https://doi.org/10.1145/3636501.3637683 ORCID: https://orcid.org/0000-0002-2319-3242 Video Tags: poplws24cppmain-key1-p, doi:10.1145/3636501.3637683, orcid:0000-0002-2319-3242 Presentation at the CPP 2024 conference, January 15-16, 2024, https://popl24.sigplan.org/home/CPP-2024 Sponsored by ACM SIGPLAN, ACM SIGACT, ACM SIGLOG,