Some approaches to formal verification are “eat and run” methods, leaving the proofs as a by-product of the proof procedure. They are used when there is some kind of assurance that the correct proofs will be automatically checked.

This article discusses how such techniques can be applied to improve the performance of systems on which correctness cannot always be checked for financial transactions, security and safety critical systems, or other critical applications. Eat-and-run verification is, therefore, an essential type of automated theorem prover, at least in these contexts.

This article discusses how verifying such systems using the currently available techniques can be more efficient. The performance improvement can be achieved by using run-time checks in the verification process instead of preserving proof for future checking or by using speedy verification methods that can perform extensive input pre-processing before running the main algorithm.

먹튀 also encompasses techniques where the proof is not necessarily preserved but that can be checked very efficiently in some other way. Eating and running is a standard verification method of hardware description languages (HDLs).

An example of eat-and-run verification is the use of a conjecture prover to prove a theorem in a given formal system for which no formal proof procedure exists. The original information about the conjecture is not used after the procedure has found proof, although it may be retained for later reference or use. The process can be seen as eating the information from one source (the conjecture) and producing output as verification or counterexample from another source (the formal system).