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

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

1 2 3 ... 75 76 77 next

  1. Ahrens, Benedikt; Lefanu Lumsdaine, Peter: Displayed categories (2019)
  2. Ahrens, Benedikt; Matthes, Ralph; Mörtberg, Anders: From signatures to Monads in \textsfUniMath (2019)
  3. Ayala-Rincón, Mauricio; de Carvalho-Segundo, Washington; Fernández, Maribel; Nantes-Sobrinho, Daniele: A formalisation of nominal C-matching through unification with protected variables (2019)
  4. Ayala-Rincón, Mauricio; de Carvalho-Segundo, Washington; Fernández, Maribel; Nantes-Sobrinho, Daniele; Rocha-Oliveira, Ana Cristina: A formalisation of nominal (\alpha)-equivalence with A, C, and AC function symbols (2019)
  5. Balabonski, Thibaut; Delga, Amélie; Rieg, Lionel; Tixeuil, Sébastien; Urbain, Xavier: Synchronous gathering without multiplicity detection: a certified algorithm (2019)
  6. Biernacki, Dariusz; Lenglet, Serguei; Polesiuk, Piotr: Proving soundness of extensional normal-form bisimilarities (2019)
  7. Boutry, Pierre; Braun, Gabriel; Narboux, Julien: Formalization of the arithmetization of Euclidean plane geometry and applications (2019)
  8. Boutry, Pierre; Gries, Charly; Narboux, Julien; Schreck, Pascal: Parallel postulates and continuity axioms: a mechanized study in intuitionistic logic using Coq (2019)
  9. Braun, David; Magaud, Nicolas; Schreck, Pascal: Two cryptomorphic formalizations of projective incidence geometry (2019)
  10. Charguéraud, Arthur; Pottier, François: Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits (2019)
  11. Cruz-Filipe, Luís; Marques-Silva, Joao; Schneider-Kamp, Peter: Formally verifying the solution to the Boolean Pythagorean triples problem (2019)
  12. Dagnino, Francesco: Coaxioms: flexible coinductive definitions by inference systems (2019)
  13. de Gouw, Stijn; de Boer, Frank S.; Bubel, Richard; Hähnle, Reiner; Rot, Jurriaan; Steinhöfel, Dominic: Verifying OpenJDK’s sort method for generic collections (2019)
  14. Drămnesc, Isabela; Jebelean, Tudor; Stratulat, Sorin: Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques (2019)
  15. Forster, Yannick; Smolka, Gert: Call-by-value lambda calculus as a model of computation in Coq (2019)
  16. Gauthier, Thibault; Kaliszyk, Cezary: Aligning concepts across proof assistant libraries (2019)
  17. Grégoire, Thomas; Chlipala, Adam: Mostly automated formal verification of loop dependencies with applications to distributed stencil algorithms (2019)
  18. Guidi, Ferruccio; Sacerdoti Coen, Claudio; Tassi, Enrico: Implementing type theory in higher order constraint logic programming (2019)
  19. Haraway, Robert C. III: Practical bounds for a Dehn parental test (2019)
  20. Immler, Fabian; Traut, Christoph: The flow of ODEs: formalization of variational equation and Poincaré map (2019)

1 2 3 ... 75 76 77 next