undefined | Better HN

0 pointsAstralStorm7y ago0 comments

You do this by involving mathematical proofs at every stage. That is expensive, but sometimes done.

Strict functional languages are a step in the right direction. As are verifiers as done in Rust.

0 comments

Some use cases and bugs are not amenable to proof. For example, how do you mathematically prove that your rendering engine is cutting off the bottom of the g of your new font?

Not all requirements of a system can be expressed a priori. I think proofs will never be enough to make a bug free system. Working as intended is a very frustrating response to a perceived bug for a user.

j / k navigate · click thread line to collapse

0 pointsAstralStorm7y ago0 comments

You do this by involving mathematical proofs at every stage. That is expensive, but sometimes done.

Strict functional languages are a step in the right direction. As are verifiers as done in Rust.

0 comments

BlackFly7y ago

Some use cases and bugs are not amenable to proof. For example, how do you mathematically prove that your rendering engine is cutting off the bottom of the g of your new font?

j / k navigate · click thread line to collapse