Coq

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 1139 articles , 3 standard articles )

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

1 2 3 ... 55 56 57 next

  1. Braun, Gabriel; Narboux, Julien: A synthetic proof of Pappus’ theorem in Tarski’s geometry (2017)
  2. Charguéraud, Arthur; Pottier, François: Temporary Read-only permissions for separation logic (2017)
  3. Cogumbreiro, Tiago; Shirako, Jun; Sarkar, Vivek: Formalization of Habanero phasers using Coq (2017)
  4. Doko, Marko; Vafeiadis, Viktor: Tackling real-life relaxed concurrency with FSL++ (2017)
  5. Georges, Aina Linn; Murawska, Agata; Otis, Shawn; Pientka, Brigitte: Lincx: a linear logical framework with first-class contexts (2017)
  6. Krebbers, Robbert; Jung, Ralf; Bizjak, Aleš; Jourdan, Jacques-Henri; Dreyer, Derek; Birkedal, Lars: The essence of higher-order concurrent separation logic (2017)
  7. Maietti, Maria Emilia: On choice rules in dependent type theory (2017)
  8. Renac, Florent: A robust high-order discontinuous Galerkin method with large time steps for the compressible Euler equations (2017)
  9. Renac, Florent: A robust high-order Lagrange-projection like scheme with large time steps for the isentropic Euler equations (2017)
  10. Stratulat, Sorin: Mechanically certifying formula-based Noetherian induction reasoning (2017)
  11. Tassarotti, Joseph; Jung, Ralf; Harper, Robert: A higher-order logic for concurrent termination-preserving refinement (2017)
  12. van Hulst, A.C.; Reniers, M.A.; Fokkink, W.J.: Maximally permissive controlled system synthesis for non-determinism and modal logic (2017)
  13. Zulkoski, Edward; Bright, Curtis; Heinle, Albert; Kotsireas, Ilias; Czarnecki, Krzysztof; Ganesh, Vijay: Combining SAT solvers with computer algebra systems to verify combinatorial conjectures (2017)
  14. Ahrens, Benedikt: Modules over relative monads for syntax and semantics (2016)
  15. Ahrens, Benedikt; Mörtberg, Anders: Some wellfounded trees in UniMath (extended abstract) (2016)
  16. Altisen, Karine; Corbineau, Pierre; Devismes, Stéphane: A framework for certified self-stabilization (2016)
  17. Bernardeschi, Cinzia; Domenici, Andrea: Verifying safety properties of a nonlinear control by interactive theorem proving with the prototype verification system (2016)
  18. Blanqui, Frédéric: Termination of rewrite relations on $\lambda$-terms based on Girard’s notion of reducibility (2016)
  19. Blazy, Sandrine; Laporte, Vincent; Pichardie, David: An abstract memory functor for verified C static analyzers (2016)
  20. Blazy, Sandrine; Laporte, Vincent; Pichardie, David: Verified abstract interpretation techniques for disassembling low-level self-modifying code (2016)

1 2 3 ... 55 56 57 next