Coq is a formal proof management system. It provides a formal language to write mathematical definitions, executable algorithms and theorems together with an environment for semi-interactive development of machine-checked proofs. Typical applications include the formalization of programming languages semantics (e.g. the CompCert compiler certification project or Java Card EAL7 certification in industrial context), the formalization of mathematics (e.g. the full formalization of the 4 color theorem or constructive mathematics at Nijmegen) and teaching.

References in zbMATH (referenced in 1153 articles , 3 standard articles )

Showing results 1 to 20 of 1153.
Sorted by year (citations)

1 2 3 ... 56 57 58 next

  1. Ahrens, Benedikt; Mörtberg, Anders: Some wellfounded trees in UniMath (extended abstract) (2016)
  2. Altisen, Karine; Corbineau, Pierre; Devismes, Stéphane: A framework for certified self-stabilization (2016)
  3. Bernardeschi, Cinzia; Domenici, Andrea: Verifying safety properties of a nonlinear control by interactive theorem proving with the prototype verification system (2016)
  4. Blanqui, Frédéric: Termination of rewrite relations on $\lambda$-terms based on Girard’s notion of reducibility (2016)
  5. Blazy, Sandrine; Laporte, Vincent; Pichardie, David: Verified abstract interpretation techniques for disassembling low-level self-modifying code (2016)
  6. Brunet, Paul; Pous, Damien; Stucke, Insa: Cardinalities of finite relations in Coq (2016)
  7. Buchberger, Bruno: The GDML and eukim projects: short report on the initiative (2016)
  8. Cano, Guillaume; Cohen, Cyril; Dénès, Maxime; Mörtberg, Anders; Siles, Vincent: Formalized linear algebra over elementary divisor rings in Coq (2016)
  9. Coghetto, Roland; Grabowski, Adam: Tarski geometry axioms. II (2016)
  10. Derouet-Jourdan, Alexandre; Mizoguchi, Yoshihiro; Salvati, Marc: Wang tile modeling of wall patterns (2016)
  11. Doczkal, Christian; Smolka, Gert: Completeness and decidability results for CTL in constructive type theory (2016)
  12. Doczkal, Christian; Smolka, Gert: Two-way automata in Coq (2016)
  13. Doko, Marko; Vafeiadis, Viktor: A program logic for C11 memory fences (2016)
  14. Dubois, Catherine; Giorgetti, Alain; Genestier, Richard: Tests and proofs for enumerative combinatorics (2016)
  15. Dubois, Catherine; Pessaux, François: Termination proofs for recursive functions in FoCaLiZe (2016)
  16. Fontaine, Allyx; Zemmari, Akka: Certified impossibility results and analyses in Coq of some randomised distributed algorithms (2016)
  17. Goto, Matthew; Jagadeesan, Radha; Jeffrey, Alan; Pitcher, Corin; Riely, James: An extensible approach to session polymorphism (2016)
  18. Joldes, Mioara; Muller, Jean-Michel; Popescu, Valentina; Tucker, Warwick: CAMPARY: cuda multiple precision arithmetic library and applications (2016)
  19. Katis, Andreas; Gacek, Andrew; Whalen, Michael W.: Machine-checked proofs for realizability checking algorithms (2016)
  20. Kuga, Ken’ichi; Hagiwara, Manabu; Yamamoto, Mitsuharu: Formalization of Bing’s shrinking method in geometric topology (2016)

1 2 3 ... 56 57 58 next