Project deliverable Open Access

Used Formal Methods

Blasum, Holger; Havle, Oto; Tverdyshev, Sergey; Langenstein, Bruno; Stephan, Werner; Feliachi, Abderrahmane; Nemouchi, Yakoub; Wolff, Burkhart; Proch, Cyril; Verbeek, Freek; Schmaltz, Julien

Researcher(s)
Tverdyshev, Sergey; Havle, Oto; Blasum, Holger; Langenstein, Bruno; Stephan, Werner; Feliachi, Abderrahmane; Nemouchi, Yakoub; Wolff, Burkhart; Proch, Cyril; Verbeek, Freek; Schmaltz, Julien

This document consists of three chapters:

  • Chapter 1 describes how Isabelle/HOL works and how to use it in a certification processnbsp;in a sound way./li> li>Chapter 2: Style Guide. It describes how to write Isabelle theories so that they are suitablenbsp;for collaborative work and human readers in a certification context./li> li>Chapter 3: Compliance statement. We state how, in the EURO-MILS project, the developednbsp;theories are compliant with (1) and (2)./li> /ul>

Files (972.4 kB)
Name Size
EURO-MILS-D31-2-Used-Formal-Methods-PU-M32_V1.1.pdf md5:27749012afccbbfa2e947371fb33d8af 972.4 kB Download
  • Achim D. Brucker and Burkhart Wolff. On theorem prover-based testing. Formal Aspects of Computing, 25(5):683–721, 2013.
  • Alonzo Church. A formulation of the simple theory of types. Journal of Symbolic Logic, pages 56–68, June 1940.
  • Clemens Ballarin. Tutorial to Locales and Locale Interpretation, 2010.
  • David Greenaway, June Andronick, and Gerwin Klein. Bridging the gap: Automatic verified abstraction of c. In ITP, pages 99–115, 2012.
  • Eric Jaeger. Remarques relatives á l'emploi des méthodes formelles (déductives) en sécurité des systèmes d'information. 2008. 51 Boulevard de la Tour-Maubourg 75700 Paris SP 07, France.
  • EURO-MILS. Formal implementation of TOE inclusive formal proofs. Technical Report D31.3, EURO-MILS: Secure European Virtualisation for Trustworthy Applications in Critical Domains, FP7/2007-2013, 2015.
  • formal proof documents. PhD thesis, Technische Universität München, Universitätsbibliothek, 2002.
  • Freek Wiedijk. The Seventeen Provers of the World: Foreword by Dana S. Scott (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence). Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2006.
  • Georges Gonthier. Engineering mathematics: the odd order theorem proof. In POPL, pages 1–2, 2013.
  • Gerwin Klein, Ralf Huuck, and Bastian Schlich. Operating system verification. J. Autom. Reasoning, 42(2-4):123–124, 2009.
  • Gerwin Klein. Gerwin's style guide for Isabelle/HOL. part 1: Good proofs, 2015. http://proofcraft.org/blog/isabelle-style.html, accessed 29 May 2015.
  • isabelle.in.tum.de/website-Isabelle2013-2/index.html, accessed 26 May 2015.
  • ISO/IEC DIS 29119: Software and Systems Engineering—Software Testing. ISO Draft International Standard, July 2012.
  • Jean-Christophe Filliatre and Andrei Paskevich. Why3 — where programs meet provers. In Matthias Felleisen and Philippa Gardner, editors, Proceedings of the 22nd European Symposium on Programming, volume 7792 of Lecture Notes in Computer Science, pages 125–128. Springer, March 2013.
  • John Harrison. Towards self-verification of hol light. In IJCAR, pages 177–191, 2006.
  • Larry Paulson, Tobias Nipkow, and Makarius Wenzel. Isabelle, 2013. http://
  • Lawrence C. Paulson. A generic tableau prover and its integration with isabelle. J. UCS, 5(3):73–87, 1999.
  • Leaf Petersen and Enrico Pontelli, editors. Proceedings of the POPL 2010 Workshop on Declarative Aspects of Multicore Programming, DAMP 2010, Madrid, Spain, January 19, 2010. ACM, 2010.
  • Leonardo Moura and Nikolaj Bjorner. Z3: An efficient SMT solver. In C.R. Ramakrishnan and Jakob Rehof, editors, Tools and Algorithms for the Construction and Analysis of Systems, volume 4963 of Lecture Notes in Computer Science, pages 337–340. Springer Berlin Heidelberg, 2008.
  • Magnus O. Myreen, Scott Owens, and Ramana Kumar. Steps towards verified implementations of hol light. In ITP, pages 490–495, 2013.
  • Makarius Wenzel. The Isabelle/Isar Reference Manual.
  • Markus M Wenzel. Isabelle/Isar—a versatile environment for human-readable
  • Markus Wenzel Tobias Nipkow, Lawrence C. Paulson. A Proof Assistant For Higher-Order Logic.
  • Markus Wenzel. Type classes and overloading in higher-order logic. In TPHOLs, pages 307–322, 1997.
  • Mike Gordon. From LCF to HOL: a short history. In Proof, Language, and Interaction, pages 169–185. MIT Press, 2000.
  • Mike J. C. Gordon and Tom F. Melham. Introduction to HOL. Cambridge University Press, 1993.
  • Pascal Cuoq, Florent Kirchner, Nikolai Kosmatov, Virgile Prevosto, Julien Signoles, and Boris Yakobowski. Frama-c: a software analysis perspective. In International Conference on Software Engineering and Formal Methods (SEFM'12), pages 233–247. Springer, October 2012.
  • Peter B. Andrews. An introduction to mathematical logic and type theory: to truth through proof. Academic Press Professional, Inc., San Diego, CA, USA, 1986.
  • Peter B. Andrews. Introduction to Mathematical Logic and Type Theory: To Truth through Proof. Kluwer Academic Publishers, Dordrecht, 2002.
  • PhilipWadler and Stephen Blott. How to make ad-hoc polymorphism less ad-hoc. In POPL, pages 60–76, 1989.
  • R. Milner and C.P. Wadsworth. Edinburgh LCF: A Mechanized Logic of Computation. Lecture Notes in Computer Science. Springer, 1979.
  • Ramana Kumar, Rob Arthan, Magnus O. Myreen, and Scott Owens. HOL with definitions: Semantics, soundness, and a verified implementation. In Interactive Theorem Proving - 5th International Conference, ITP 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings, pages 308–324, 2014.
  • Robin Milner, Mads Tofte, and David Macqueen. The Definition of Standard ML. MIT Press, Cambridge, MA, USA, 1997.
  • Robin Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17(3):348 – 375, 1978.
  • Sascha B¨ohme and Tjark Weber. Fast LCF-style proof reconstruction for Z3. In ITP, pages 179–194, 2010.
  • Sascha B¨ohme, Michal Moskal,Wolfram Schulte, and BurkhartWolff. Hol-boogie- an interactive prover-backend for the verifying c compiler. J. Autom. Reasoning, 44(1-2):111–144, 2010.
  • The Common Criteria Recognition Agreement Members. Common Criteria for Information Technology Security Evaluation. http://www.commoncriteriaportal.org/, September 2006.
  • Thomas C Hales. Formal proof. Notices of the AMS, 55(11):1370–1380, 2008.
  • Tobias Nipkow, Larry C. Paulson, and Markus Wenzel. Isabelle/HOL—A Proof Assistant for Higher-Order Logic, volume 2283 of Lecture Notes in Computer Science. Springer-Verlag, Heidelberg, 2002.

Share

Cite as