Acciones

Diferencia entre revisiones de «Documentación»

De DAO (Demostración asistida por ordenador)

(→‎Lógica computacional)
 
(No se muestran 13 ediciones intermedias del mismo usuario)
Línea 1: Línea 1:
−
En esta página se recogen en enlaces que sirven de documentación al curso de demostración asistida por ordenador (DAO).
+
En esta página se recogen en enlaces que sirven de documentación al curso de demostración asistida por ordenador (DAO). Los enlaces están actualizados en el [https://www.glc.us.es/~jalonso/RA2019/index.php/Documentaci%C3%B3n curso 2019-20].
  
 
== Visiones generales de la DAO ==
 
== Visiones generales de la DAO ==
Línea 38: Línea 38:
 
# R. Bornat [http://bit.ly/oithic Proof and disproof in formal logic: an introduction for programmers]. Oxford University Press, 2005.
 
# R. Bornat [http://bit.ly/oithic Proof and disproof in formal logic: an introduction for programmers]. Oxford University Press, 2005.
 
# K. Broda, S. Eisenbach, H. Khoshnevisan y S. Vickers [https://www.doc.ic.ac.uk/~susan/firstyearbook.pdf Reasoned programming]. Imperial College, 1994.
 
# K. Broda, S. Eisenbach, H. Khoshnevisan y S. Vickers [https://www.doc.ic.ac.uk/~susan/firstyearbook.pdf Reasoned programming]. Imperial College, 1994.
−
# K. Doets y J. van Eijck [http://www.ldc.usb.ve/~astorga/Haskell.Road.pdf The Haskell Road to Logic, Maths and Programming].
+
# K. Doets y J. van Eijck [https://books.google.es/books?id=YCC6lwEACAAJ&dq=The+Haskell+Road+to+Logic,+Maths+and+Programming&hl=es&sa=X&redir_esc=y The Haskell Road to Logic, Maths and Programming].
 
# M. Huth y M. Ryan [http://goo.gl/TMqOo Logic in computer science: Modelling and reasoning about systems]. Cambridge University Press, 2004. (Incluye el [http://www.cs.bham.ac.uk/research/lics/tutor/index.html tutor en la Red]).
 
# M. Huth y M. Ryan [http://goo.gl/TMqOo Logic in computer science: Modelling and reasoning about systems]. Cambridge University Press, 2004. (Incluye el [http://www.cs.bham.ac.uk/research/lics/tutor/index.html tutor en la Red]).
  
 
== Cursos relacionados ==
 
== Cursos relacionados ==
 
=== Cursos con Isabelle/HOL ===
 
=== Cursos con Isabelle/HOL ===
−
# Jeremy Avigad. [http://www.phil.cmu.edu/~avigad/formal/ Logic and Formal Verification]. (Carnegie Mellon, 2009).
 
 
# Clemens Ballarin. [http://cl-informatik.uibk.ac.at/teaching/ss08/atp/introduction.php Automatic Deduction]. (Univ de Innsbruck, 2008).
 
# Clemens Ballarin. [http://cl-informatik.uibk.ac.at/teaching/ss08/atp/introduction.php Automatic Deduction]. (Univ de Innsbruck, 2008).
−
# Clemens Ballarin. [http://www4.in.tum.de/~ballarin/belgrade08-tut/ Introduction to the Isabelle Proof Assistant]. (Belgrado, 2008).
 
 
# Clemens Ballarin y Gerwin Klein [http://isabelle.in.tum.de/coursematerial/IJCAR04 Introduction to the Isabelle Proof Assistant]. (en el IJCAR-2004).
 
# Clemens Ballarin y Gerwin Klein [http://isabelle.in.tum.de/coursematerial/IJCAR04 Introduction to the Isabelle Proof Assistant]. (en el IJCAR-2004).
 
# Clemens Ballarin y Tjark Weber. [http://cl-informatik.uibk.ac.at/teaching/ws06/atp/introduction.php Automated Theorem Proving in Isabelle/HOL]. (Univ. de Innsbruck, 2006-07).
 
# Clemens Ballarin y Tjark Weber. [http://cl-informatik.uibk.ac.at/teaching/ws06/atp/introduction.php Automated Theorem Proving in Isabelle/HOL]. (Univ. de Innsbruck, 2006-07).
Línea 55: Línea 53:
 
# Gerwin Klein. [http://www.cse.unsw.edu.au/~cs4161/index.html Advanced Topics in Software Verification]. (NICTA, 2012).
 
# Gerwin Klein. [http://www.cse.unsw.edu.au/~cs4161/index.html Advanced Topics in Software Verification]. (NICTA, 2012).
 
# Joao Marcos. [http://www.dimap.ufrn.br/~jmarcos/courses/LC/Ementa.htm Lógica computacional: Demonstração assistida e semi-automática de teoremas].(UFRN, 2000).
 
# Joao Marcos. [http://www.dimap.ufrn.br/~jmarcos/courses/LC/Ementa.htm Lógica computacional: Demonstração assistida e semi-automática de teoremas].(UFRN, 2000).
−
# Tobias Nipkow. [http://www4.informatik.tu-muenchen.de/~nipkow/semantics/ Semantics of programming languages]. (Univ. de Munich, 2012-13).
+
# Tobias Nipkow. [https://www21.in.tum.de/teaching/semantics/WS1920/ Semantics of programming languages]. (Univ. de Munich, 2012-13).
 
# Tobias Nipkow [http://isabelle.in.tum.de/coursematerial/PSV2009-1 Theorem Proving with Isabelle/HOL An Intensive Course].  
 
# Tobias Nipkow [http://isabelle.in.tum.de/coursematerial/PSV2009-1 Theorem Proving with Isabelle/HOL An Intensive Course].  
 
# Larry Paulson. [http://www.cl.cam.ac.uk/teaching/0910/L21/ Interactive Formal Verification]. (Univ. de Cambridge, 2009-10).
 
# Larry Paulson. [http://www.cl.cam.ac.uk/teaching/0910/L21/ Interactive Formal Verification]. (Univ. de Cambridge, 2009-10).
−
# Arnd Poetzsch-Heffter. [https://softech.informatik.uni-kl.de/Homepage/SVHOL10 Specification and Verification with Higher-Order Logic].
 
−
# Jeremy G. Siek. [http://www.cs.colorado.edu/~siek/7000/spring07/ Practical Theorem Proving with Isabelle/Isar]. (Univ. de Colorado, 2007).
 
−
# Jeremy G. Siek. [http://ecee.colorado.edu/~siek/ecen5013/spring11/ Theorem proving in Isabelle]. (Univ. de Colorado, 2011).
 
 
# Jan-Georg Smaus. [http://www.informatik.uni-freiburg.de/~ki/teaching/ws0910/csmr/lecture.html Computer-supported modeling and reasoning]. (Univ. de Feiburgo, 2009).
 
# Jan-Georg Smaus. [http://www.informatik.uni-freiburg.de/~ki/teaching/ws0910/csmr/lecture.html Computer-supported modeling and reasoning]. (Univ. de Feiburgo, 2009).
 
# Christian Sternagel [http://cl-informatik.uibk.ac.at/teaching/ss11/eve/content.php Experiments in Verification – Introduction to Isabelle/HOL]. (Univ. de Innsbruck, 2011-12).
 
# Christian Sternagel [http://cl-informatik.uibk.ac.at/teaching/ss11/eve/content.php Experiments in Verification – Introduction to Isabelle/HOL]. (Univ. de Innsbruck, 2011-12).
Línea 66: Línea 61:
  
 
=== Otros cursos ===
 
=== Otros cursos ===
−
# José A. Alonso [http://www.cs.us.es/~jalonso/cursos/li/ Lógica informática] (Univ. de Sevilla, 2012-13).
+
# José A. Alonso [http://www.cs.us.es/~jalonso/cursos/li-12/ Lógica informática] (Univ. de Sevilla, 2012-13).
 
# Yves Bertot, Pierre Casteran, Benjamin Gregoire, Pierre Letouzey y Assia Mahboubi [http://www.di.ens.fr/~zappa/teaching/coq/ecole11 Modelling and verifying algorithms in Coq: an introduction]. (INRIA Paris-Rocquencourt, 14-18 noviembre 2011).
 
# Yves Bertot, Pierre Casteran, Benjamin Gregoire, Pierre Letouzey y Assia Mahboubi [http://www.di.ens.fr/~zappa/teaching/coq/ecole11 Modelling and verifying algorithms in Coq: an introduction]. (INRIA Paris-Rocquencourt, 14-18 noviembre 2011).
 
# Pierre Castéran [http://www.labri.fr/perso/casteran/FM/Logique/index.html Logic (Master In Verification)] (Univ. de Burdeos, 2011-12).
 
# Pierre Castéran [http://www.labri.fr/perso/casteran/FM/Logique/index.html Logic (Master In Verification)] (Univ. de Burdeos, 2011-12).
−
# Nuno Gaspar [http://www-sop.inria.fr/members/Nuno.Gaspar/teaching/coq2012.php Verification with the Coq Proof Assistant] (INRIA Sophia Antipolis, 2012-13).
 
−
# Michael Genesereth [http://logic.stanford.edu/classes/cs157/2011/cs157.html Computational Logic] (Univ. de Stanford, 2011-12).
 
 
# Ian Hodkinson [http://www.doc.ic.ac.uk/~imh/teaching/140_logic/logic.html Logic] (Imperial College, Londres, 2010-11).
 
# Ian Hodkinson [http://www.doc.ic.ac.uk/~imh/teaching/140_logic/logic.html Logic] (Imperial College, Londres, 2010-11).
 
# Peter Lucas [http://www.cs.ru.nl/~peterl/teaching/KeR/ Knowledge Representation and Reasoning] (Radboud University # egen, 2011-12).
 
# Peter Lucas [http://www.cs.ru.nl/~peterl/teaching/KeR/ Knowledge Representation and Reasoning] (Radboud University # egen, 2011-12).
Línea 80: Línea 73:
 
# [http://www.cs.ru.nl/~freek/100 Formalizing 100 Theorems].
 
# [http://www.cs.ru.nl/~freek/100 Formalizing 100 Theorems].
 
# [http://toccata.lri.fr/gallery Gallery of verified programs].
 
# [http://toccata.lri.fr/gallery Gallery of verified programs].
−
# [http://www.cs.nott.ac.uk/~lad/research/challenges/ Induction Challenge Problems].
 
−
# [http://automatedreasoning.net/ Larry Wos' Notebooks].
 
−
# [http://www.cs.miami.edu/~tptp/ The TPTP Problem Library for Automated Theorem Proving].
 
−
# [http://www.macs.hw.ac.uk/vstte10/Competition.html The 1st Verified Software Competition].
 
−
# [https://sites.google.com/site/vstte2012/compet The 2nd Verified Software Competition].
 
−
# [http://verifythis.cost-ic0701.org VerifyThis (A collection of verification benchmarks].
 
−
 
−
== Artículos recientes ==
 
−
Están en orden cronológico inverso a la fecha de su reseña en [http://www.glc.us.es/~jalonso/vestigium/tag/resena Vestigium]:
 
−
# Joachim Breitner, Brian Huffman, Neil Mitchell y Christian Sternagel [http://bit.ly/19fiWAY Certified HLints with Isabelle/HOLCF-Prelude].
 
−
# Peter Lammich [http://bit.ly/ZfSQrQ Automatic data refinement].
 
−
# Assia Mahboubi [http://bit.ly/18vyjm7 The rooster and the butterflies (a machine-checked proof of the Jordan-Hölder theorem for finite groups)].
 
−
# Nathan Wetzler, Marijn J. H. Heule y Warren A. Hunt Jr. [http://bit.ly/114oyZV Mechanical verification of SAT refutations with extended resolution].
 
−
# Johannes Hölzl, Fabian Immler y Brian Huffman [http://bit.ly/13H0REu Type classes and filters for mathematical analysis in Isabelle/HOL]
 
−
# M. J. H. Heule, W. A. Hunt, Jr. y N. Wetzler [http://bit.ly/10fv8wO Verifying refutations with extended resolution].
 
−
# C. Lüth y M. Ring [http://bit.ly/10EcFWj A Web interface for Isabelle: The next generation].
 
−
# L. Liu, O. Hasan y S. Tahar [http://bit.ly/18P9CSv On the formalization of continuous-time Markov chains in HOL].
 
−
# A. Asperti y W. Ricciotti [http://bit.ly/17H2mqy Formalizing Turing machines].
 
−
# A. Lochbihler [http://bit.ly/YwuCeL Light-weight containers for Isabelle: efficient, extensible, nestable].
 
−
# L. Noschinski [http://bit.ly/10XLrRA Graph theory].
 
−
# G. Gonthier et als. [http://bit.ly/19kPEP4 A machine-checked proof of the odd order theorem].
 
−
# C. Doczkal, J.O. Kaiser y G. Smolka [http://goo.gl/LdihL A constructive theory of regular languages in Coq].
 
−
# C. Sternagel [http://goo.gl/gwcwL A formal proof of Kruskal’s tree theorem in Isabelle/HOL].
 
−
# C. Sternagel y R. Thiemann [http://goo.gl/CUF3e Formalizing Knuth-Bendix orders and Knuth-Bendix completion].
 
−
# C. Lange, C. Rowat, W. Windsteiger y M. Kerber [http://goo.gl/9JAfX Developing an auction theory toolbox].
 
−
# M. Spasić y F. Marić [http://goo.gl/6OfmQ Formalization of incremental simplex algorithm by stepwise refinement].
 
−
# J.C. Blanchette, A. Popescu y D. Traytel [http://goo.gl/Guxky Coinductive pearl: Modular first-order logic completeness].
 
−
# J. Esparza et als. [http://goo.gl/HUOl8 A fully verified executable LTL model checker].
 
−
# M. Kerber, C. Lange y C. Rowat. [http://goo.gl/RV54S ForMaRE - formal mathematical reasoning in economics].
 
−
# J. Urban. [http://goo.gl/Y7sIq AI over large formal knowledge bases: The first decade].
 
−
# S. Boldo, C. Lelay y G. Melquiond. [http://goo.gl/vvqNg Formalization of real analysis: A survey of proof assistants and libraries].
 
−
# F. Haftmann, A. Krauss, O. Kunčar y T. Nipkow [http://goo.gl/bEFYa Data refinement in Isabelle/HOL].
 
−
# A.C. Rocha y M. Ayala. [http://goo.gl/xTyvE Formalizing the confluence of orthogonal rewriting systems].
 
−
# Z. Shi et als. [http://goo.gl/zCYHj Formalization of the complex number theory in HOL4].
 
−
# F. Loulergue y V. Niculescu [http://goo.gl/kM0dI Programming and reasonning with PowerLists in Coq].
 
−
# J. Heras, F.J. Martín y V. Pascual. [http://goo.gl/KkU6s A hierarchy of mathematical structures in ACL2].
 
−
# J. Xu, X. Zhang y C. Urban [http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tm.pdf Mechanising Turing Machines and Computability Theory in Isabelle/HOL]
 

Revisión actual del 19:18 8 feb 2022

En esta página se recogen en enlaces que sirven de documentación al curso de demostración asistida por ordenador (DAO). Los enlaces están actualizados en el curso 2019-20.

Visiones generales de la DAO

  1. J.A. Alonso. Razonamiento formalizado: Del sueño a la realidad de las pruebas. Vestigium, 26 de diciembre de 2012.
  2. J. Avigad. Interactive theorem proving, automated reasoning, and mathematical computation. ICERM, 14 de diciembre de 2012.
  3. M. Davis. The early history of automated deduction.
  4. J.P. Delahaye Du rêve à la réalité des preuves. Interstices, 8 de julio de 2012.
  5. J. Germoni Coq et caractères: Preuve formelle du théorème de Feit et Thompson. Images des Mathématiques, CNRS, 23 de noviembre de 2012.
  6. H. Geuvers Proof assistants: History, ideas and future. Sadhana, Vol. 34-1, pp. 3-25, février 2009.
  7. G. Gonthier The four-color theorem. Notices of the AMS, Vol. 55, n° 11, pp. 1382-1393, 2008.
  8. T. Hales. Formal proof. Notices of AMS, Vol. 55, N. 11 (2008) pp. 1370-1380.
  9. J. Harrison. A short survey of automated reasoning. Lecture Notes in Computer Science, Vol. 4545, pp. 334-349, 2007.
  10. J. Harrison. Formal proof: Theory and practice. Notices of the AMS, Vol. 55, N. 11 (2008) p.1395-1406.
  11. G. Kolata. Computer math proof shows reasoning power. The New York Times, 10 de diciembre de 1996.
  12. D. MacKenzie Computers and the sociology of mathematical proof.
  13. G. Sutcliffe. What is automated theorem proving?.
  14. F. Wiedijk Formalizing the «top 100» of mathematical theorems.
  15. F. Wiedijk Formal proof - Getting started. Notices of the AMS, Vol. 55, n° 11, pp. 1408-1414, 2008.
  16. F. Wiedijk, The QED manifesto revisited. Studies in Logic, Grammar and Rhetoric, Vol. 10(23), pp. 121-133, 2007.

Referencias sobre Isabelle/HOL

  1. B. Grechuk Isabelle primer for mathematicians.
  2. T. Nipkow Programming and proving in Isabelle/HOL.
  3. T. Nipkow, M. Wenzel y L.C. Paulson A proof assistant for higher-order logic.
  4. Isabelle/HOL — Higher-Order Logic.
  5. Tutorials and manuals for Isabelle.

Lecturas complementarias

Programación funcional

  1. J.A. Alonso Temas de "Programación funcional". Publicaciones del Grupo de Lógica Computacional. Universidad de Sevilla, 2012.
  2. J.A. Alonso y M.J. Hidalgo Piensa en Haskell (Ejercicios de programación funcional con Haskell). Publicaciones del Grupo de Lógica Computacional. Universidad de Sevilla, 2012.
  3. G. Hutton Programming in Haskell. Cambridge University Press, 2007.
  4. M. Lipovača ¡Aprende Haskell por el bien de todos!.

Lógica computacional

  1. J.A. Alonso Temas de "Lógica informática" (2012-13). Publicaciones del Grupo de Lógica Computacional. Universidad de Sevilla, 2012.
  2. R. Bornat Proof and disproof in formal logic: an introduction for programmers. Oxford University Press, 2005.
  3. K. Broda, S. Eisenbach, H. Khoshnevisan y S. Vickers Reasoned programming. Imperial College, 1994.
  4. K. Doets y J. van Eijck The Haskell Road to Logic, Maths and Programming.
  5. M. Huth y M. Ryan Logic in computer science: Modelling and reasoning about systems. Cambridge University Press, 2004. (Incluye el tutor en la Red).

Cursos relacionados

Cursos con Isabelle/HOL

  1. Clemens Ballarin. Automatic Deduction. (Univ de Innsbruck, 2008).
  2. Clemens Ballarin y Gerwin Klein Introduction to the Isabelle Proof Assistant. (en el IJCAR-2004).
  3. Clemens Ballarin y Tjark Weber. Automated Theorem Proving in Isabelle/HOL. (Univ. de Innsbruck, 2006-07).
  4. A.D. Brucker, D. Basin, J.G. Smaus y B. Wolff. Computer-supported Modeling and Reasoning. (ETH Zurich, 2011).
  5. Mads Dam. Advanced formal methods. (KTH Royal Institute of Technology, 2007).
  6. Jacques Fleuriot y Paul Jackson. Automated reasoning. (Univ. de Edimburgo, 2012-13).
  7. Thomas Genet Software formal analysis and design. (Univ. de Rennes)
  8. Gerwin Klein. Theorem Proving - Principles, Techniques, Applications. (NICTA, 2004).
  9. Gerwin Klein. Advanced Topics in Software Verification. (NICTA, 2012).
  10. Joao Marcos. Lógica computacional: Demonstração assistida e semi-automática de teoremas.(UFRN, 2000).
  11. Tobias Nipkow. Semantics of programming languages. (Univ. de Munich, 2012-13).
  12. Tobias Nipkow Theorem Proving with Isabelle/HOL An Intensive Course.
  13. Larry Paulson. Interactive Formal Verification. (Univ. de Cambridge, 2009-10).
  14. Jan-Georg Smaus. Computer-supported modeling and reasoning. (Univ. de Feiburgo, 2009).
  15. Christian Sternagel Experiments in Verification – Introduction to Isabelle/HOL. (Univ. de Innsbruck, 2011-12).
  16. Tjark Weber. Interactive Formal Verification. (Univ. de Cambridge, 2010-11).

Otros cursos

  1. José A. Alonso Lógica informática (Univ. de Sevilla, 2012-13).
  2. Yves Bertot, Pierre Casteran, Benjamin Gregoire, Pierre Letouzey y Assia Mahboubi Modelling and verifying algorithms in Coq: an introduction. (INRIA Paris-Rocquencourt, 14-18 noviembre 2011).
  3. Pierre Castéran Logic (Master In Verification) (Univ. de Burdeos, 2011-12).
  4. Ian Hodkinson Logic (Imperial College, Londres, 2010-11).
  5. Peter Lucas Knowledge Representation and Reasoning (Radboud University # egen, 2011-12).
  6. Larry Paulson Logic and Proof (Univ. de Cambridge, 2011-12).
  7. Riccardo Pucella Logic and Computation (Northeastern University, 2009). Curso con ACL2.

Bibliotecas de ejemplos de verificación

  1. Archive of Formal Proofs.
  2. Formalizing 100 Theorems.
  3. Gallery of verified programs.
Obtenido de «https://www.glc.us.es/~jalonso/DAO/index.php?title=Documentación&oldid=223»