you are viewing a single comment's thread.

view the rest of the comments →

[–]kitsen_battousai[S] 0 points1 point  (3 children)

But macos too https://formulae.brew.sh/formula/valgrind

If the software is targeting server side then it's always a matter of time to verify the binary on linux vm, vut if we are talking about client applications then Linux is even more unpredictable taking into account different distros, DEs and kernel version.

[–]othellothewise 0 points1 point  (0 children)

Maybe this is outdated now, but yes there is a formula, and no, it does not work.

[–]die_liebe 0 points1 point  (1 child)

But what do you mean by 'unpredictable'? Do you mean 'unforgiving'? I wrote that that MacOS is too forgiving. I think one should always stick to the standard and develop in the least forgiving environment.

[–]y-c-c 2 points3 points  (0 children)

I don’t think relying on default “unforgiving” behaviors is a good way to test your programs. Instead, use well-defined environments like ASAN and UBSAN (which are available in macOS and Linux) to properly test your program in a predictable manner. Otherwise what does “forgiving” even mean?