3 ms·
"Formally verified" means someone has written a correct mathematical proof that the code has no bugs (the proof is checked by a computer program to make sure it
by immibis 2y ago
"Formally verified" means someone has written a correct mathematical proof that the code has no bugs (the proof is checked by a computer program to make sure it is correct). This is a very high bar.
I'm not sure what it has to do with translating the code to Rust.
- swiftcoder 2y ago> I'm not sure what it has to do with translating the code to Rust. Formally verified C programs typically have had all their undefined behaviour already stamped out during the verification process. That makes mapping it over to Rust a lot simpler.
- tjoff 2y agoTranslating undefined behavior is the easy part.
- swiftcoder 2y agoMaybe, but only if you know the specifics of the environment in which it is executing (i.e. which compiler/architecture-specific behaviours the code actually relies on)
- Filligree 2y agoCorrectly written C programs don’t have undefined behaviour, so a translator can operate assuming there is none.
- deleted 2y ago[deleted]
- DonaldPShimoda 2y agoIn this case specifically, two separate aspects are being referred to with regard to "formal verification". The first is that the translation function (from C to Rust) has itself been formally verified. In other words: if you give it a C program that obeys certain necessary pre-conditions, it will give you a safe Rust program. I believe the title of the paper is primarily using "Formalized" with regard to this characteristic. The second is that the set of programs the authors evaluate their tool on are C programs that have themselves been formally verified. I only barely skimmed the introduction and didn't see it addressed directly there, but I would assume that this is because the pre-conditions necessary for their translation to work are most easily (only?) met by formally verified C programs, where of course the verification has been rendered with respect to properties that would be relevant here (e.g., memory use).
- SAI_Peregrinus 2y ago> "Formally verified" means someone has written a correct mathematical proof that the code has no bugs No, only that it complies with a formal specification. The code will have bugs if and only if the specification has bugs. The difficulty of writing a bug-free formal specification is just as great as writing bug-free code. In some domains it's easier to write the specification, but not in most. Fully specifying what a program shoud do is often the hardest part of programming, after all.