Formalizing Pick's Theorem in Isabelle/HOL

被引:0
|
作者
Binder, Sage [1 ]
Kosaian, Katherine [2 ]
机构
[1] Univ Iowa, Iowa City, IA 52242 USA
[2] Iowa State Univ, Ames, IA 50011 USA
来源
基金
美国国家科学基金会;
关键词
Pick's theorem; Isabelle/HOL; formalization; geometry;
D O I
10.1007/978-3-031-66997-2_7
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We formalize Pick's theorem for finding the area of a simple polygon whose vertices are integral lattice points. We are inspired by John Harrison's formalization of Pick's theorem in HOL Light, but tailor our proof approach to avoid a primary challenge point in his formalization, which is proving that any polygon with more than three vertices can be split (in its interior) by a line between some two vertices. We detail the approach we use to avoid this step and reflect on the pros and cons of our eventual formalization strategy. We use the theorem prover Isabelle/HOL, and our formalization involves augmenting the existing geometry libraries in various foundational ways (e.g., by adding the definition of a polygon and formalizing some key properties thereof).
引用
收藏
页码:109 / 126
页数:18
相关论文
共 50 条
  • [31] Formalising Szemeredi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL
    Edmonds, Chelsea
    Koutsoukou-Argyraki, Angeliki
    Paulson, Lawrence C. C.
    JOURNAL OF AUTOMATED REASONING, 2023, 67 (01)
  • [32] A Formalisation of the Balog-Szemeredi-Gowers Theorem in Isabelle/HOL
    Koutsoukou-Argyraki, Angeliki
    Baksys, Mantas
    Edmonds, Chelsea
    PROCEEDINGS OF THE 12TH ACM SIGPLAN INTERNATIONAL CONFERENCE ON CERTIFIED PROGRAMS AND PROOFS, CPP 2023, 2023, : 225 - 238
  • [33] An interpretation of Isabelle/HOL in HOL Light
    McLaughlin, Sean
    AUTOMATED REASONING, PROCEEDINGS, 2006, 4130 : 192 - 204
  • [34] Formalising Szemerédi’s Regularity Lemma and Roth’s Theorem on Arithmetic Progressions in Isabelle/HOL
    Chelsea Edmonds
    Angeliki Koutsoukou-Argyraki
    Lawrence C. Paulson
    Journal of Automated Reasoning, 2023, 67
  • [35] Effective Parallel Formal Verification of Reconfigurable Discrete-Event Systems Formalizing with Isabelle/HOL
    Soualah, Sohaib
    Khalgui, Mohamed
    Chaoui, Allaoua
    ADVANCED INFORMATION NETWORKING AND APPLICATIONS, VOL 2, AINA 2024, 2024, 200 : 199 - 212
  • [36] Formalizing Hilbert's Grundlagen in Isabelle/Isar
    Meikle, LI
    Fleuriot, JD
    THEOREM PROVING IN HIGHER ORDER LOGICS, PROCEEDINGS, 2003, 2758 : 319 - 334
  • [37] Safety and Conservativity of Definitions in HOL and Isabelle/HOL
    Kuncar, Ondrej
    Popescu, Andrei
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2018, 2 (POPL):
  • [38] Stalnaker's Epistemic Logic in Isabelle/HOL.
    Guzman, Laura P. Gamboa
    Rozier, Kristin Y.
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2024, (402):
  • [39] On the computational realization of formal ontologies: Formalizing an ontology of instantiation in spacetime using Isabelle/HOL as a case study
    Bittner, Thomas
    APPLIED ONTOLOGY, 2019, 14 (03) : 251 - 292
  • [40] Unifying Theories in Isabelle/HOL
    Feliachi, Abderrahmane
    Gaudel, Marie-Claude
    Wolff, Burkhart
    UNIFYING THEORIES OF PROGRAMMING, 2010, 6445 : 188 - +