&gt; Who hires people to work in theorem provers, or using languages allowing proofs alongside code?<p>The military, aerospace industry and once in a while the medical industry will require provable code. Certain components need to be validated by frameworks like SPARK written in Ada. F* and Idris are pretty close to real-world usable in the capacity you&#x27;re referring to. Those and ATS are probably the most &#x27;real world&#x27; other than Ada&#x2F;Spark. Other than that it&#x27;s mostly universities and research facilities.<p>Another Microsoft Research project (I&#x27;ve said it once, I&#x27;m going to say it a million times more - hate on them all you want - it&#x27;s not Google, Facebook, or Apple that&#x27;s the Bell Labs of our generation - it&#x27;s Microsoft) has a formal C verifier[1] which is paired in Z3, but I&#x27;m not sure if you could enforce an invariant like ensuring only a certain type of memory fragmentation. This Microsoft Research paper[2] strangely enough might be relevant re: memory alloc guarantees.<p>Other than that,&#x27;who hires people&#x27; ? Universities (INRIA of OCaml&#x2F;Coq&#x2F;Smalltalk Pharo fame probably at the forefront, that Swiss uni likely second <i>edit: ETH Zurich is apparently ranked significantly higher than Jusseiu, mea culpa</i>) Institutions like the Max Planck and Microsoft Research, Cambridge UK tend to hire people in a purely research-for-the-sake-of-research capacity which is exceedingly rare in the climate of only-think-about-this-quarters-profitability. I think JetBrains was doing some work with MPS that was really interesting though not quite in the vein of formal verification.<p>[1] <a href="https:&#x2F;&#x2F;vcc.codeplex.com&#x2F;" rel="nofollow">https:&#x2F;&#x2F;vcc.codeplex.com&#x2F;</a>
[2] A Precise Yet Efficient Memory Model For C. Ernie Cohen, Michał Moskal, Wolfram Schulte, Stephan Tobies. 4th International Workshop on Systems Software Verification (SSV2009).