The Fifth International Workshop on Coq for Programming LanguagesCoqPL 2019
The series of CoqPL workshops provide an opportunity for programming languages researchers to meet and interact with one another and members from the core Coq development team. At the meeting, we will discuss upcoming new features, see talks and demonstrations of exciting current projects, solicit feedback for potential future changes, and generally work to strengthen the vibrant community around our favorite proof assistant.
- General purpose libraries and tactic language extensions
- Domain-specific libraries for programming language formalization and verification
- IDEs, profilers, tracers, debuggers, and testing tools
- Reports on ongoing proof efforts conducted via (or in the context of) the Coq proof assistant
- Experience reports from Coq usage in educational or industrial contexts
The workshop format will be driven by you, members of the community. We will solicit abstracts for talks and proposals for demonstrations and flesh out format details based on responses. We expect the final program to include experiment reports, panel discussions, and invited talks (details TBA). Talks will be selected according to relevance to the workshop, based on the submission of an extended abstract.
To foster open discussion of cutting edge research which can later be published in full conference proceedings, we will not publish papers from the workshop. However, presentations will be recorded and the videos made publicly available.
Sat 19 JanDisplayed time zone: Belfast change
09:00 - 10:30
|Coq User Interfaces: Past, Present, and Future (Keynote)|
|Counterexamples for Coq Conjectures|
Samuel Gruetter Massachusetts Institute of TechnologyFile Attached
11:15 - 12:30
|Towards Mechanising Probabilistic Properties of a Blockchain|
Kiran Gopinathan University College London, Ilya Sergey Yale-NUS College and National University of SingaporeFile Attached
|Verifying Finality for Blockchain Systems|
Karl Palmskog University of Texas at Austin, Milos Gligoric University of Texas at Austin, Lucas Peña University of Illinois at Urbana-Champaign, Grigore Roşu University of Illinois at Urbana-ChampaignFile Attached
|WIP: Formalizing the Concordium Consensus Protocol in Coq|
Thomas Dinsdale-Young , Bas Spitters Aarhus University, Søren Eller Thomsen Aarhus University, Daniel Tschudi Aarhus UniversityFile Attached
14:00 - 15:30
|Reification of Shallow-Embedded DSLs in Coq with Automated Verification|
|Reifying and Translating a Monadic Fragment of Gallina|
|Session with the Coq Development Team|
16:00 - 17:40
|Deep Embedded Hoare Logic for Building Machine-Checkable Foundational Program Correctness Proofs|
Qinxiang Cao Shanghai Jiao Tong UniversityFile Attached
|Teaching Discrete Mathematics to Early Undergraduates with Software Foundations|
|Ltac2: Tactical Warfare|
|Towards a Coq Formalisation of Build Systems|
Submissions for talks and demonstrations should be described in an extended abstract, between 1 and 2 pages in length (excluding the bibliography). We suggest formatting the text using the two-column ACM SIGPLAN latex style (9pt font). Templates are available from the ACM SIGPLAN page: http://www.sigplan.org/Resources/Author.