The goal of the user is to prove some properties over an input program. Usual properties are: all array accesses are within boundaries, no division by zero, all used values are initialized, all de-referenced pointers…
Also Mathworks Polyspace Code Prover: https://mathworks.com/products/polyspace-code-prover.html
Why don't they reuse CodeQL to provide a true code search using maybe a subset of CodeQL capabilities?
The goal of the user is to prove some properties over an input program. Usual properties are: all array accesses are within boundaries, no division by zero, all used values are initialized, all de-referenced pointers…
Also Mathworks Polyspace Code Prover: https://mathworks.com/products/polyspace-code-prover.html
Why don't they reuse CodeQL to provide a true code search using maybe a subset of CodeQL capabilities?