1. Formath: formalisation of mathematics (2010–2013).
http://wiki.portal.chalmers.se/cse/pmwiki.php/ForMath/ForMath
2. Amorim, A., et al.: A verified information-flow architecture. In: 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2014) (2014)
3. Aransay, J., Ballarin, C., Rubio, J.: A mechanized proof of the Basic Perturbation Lemma. J. Autom. Reasoning 40(4), 271–292 (2008)
4. Ayala, R., Domínguez, E., Francés, A., Quintero, A.: Homotopy in digital spaces. Discrete Appl. Math. 125, 3–24 (2003)
5. Benton, N.: Machine Obstructed Proof: how many months can it take to verify 30 assembly instructions? (2006)