Arch. Formal Proofs 2019

3 papers
The 2019 edition of the Archive of Formal Proofs (AFP) featured five entries focusing on theoretical computer science, mathematical analysis, and logic. A primary theme of the year’s contributions was the formal verification of foundational computational models and complex mathematical theorems. Notable works included the formalization of a Universal Turing Machine by Christian Urban and Jian Xu, alongside proofs regarding the transcendence of certain infinite series authored by Angeliki Koutsoukou-Argyraki and Wenda Li. Research in logic was also represented through the development of Differential Game Logic, a contribution by André Platzer and Sebastiaan J. C. Joosten. These entries reflect a trend toward using formal proof assistants to verify both classical results in computability and modern logical frameworks for hybrid systems. The year's output highlights the application of formal methods to diverse areas, ranging from number theory to the verification of game-theoretic models.

Institutions

Institutions credited by Arch. Formal Proofs 2019 papers: a paper credits every institution named in its affiliations, once. 1 institutions share 1 credited papers.

#InstitutionPapersShare
1Carnegie Mellon University 1100.0%

Download all institutions as CSV

About this data

Papers. Arch. Formal Proofs 2019 lists 3 papers on Lacuna, duplicate versions counted once; rejected and withdrawn submissions are left out.

Institutions. A paper credits each institution named in its affiliations, resolved to a ROR record, once. 1 of 3 papers (33.3%) credit at least one institution and are the base for institution shares; the rest have no resolved affiliation yet.

Data. Counts come from Lacuna’s data build of 2026-11-22 and change as papers are added. Tables as CSV: institutions. Cite as: Lacuna, “Arch. Formal Proofs 2019”, https://lacuna.tiptreesystems.com/venue/arch-formal-proofs/2019.

Top Authors

AuthorPapers
André Platzer1
Wenda Li1

Papers

Title
Differential Game Logic
The Transcendence of Certain Infinite Series
Universal Turing Machine