| Practical Proof Search for Coq by Type Inhabitation
|
2020 |
Czajka, Lukasz |
| Formalizations Formalizing the Face Lattice of Polyhedra
|
2020 |
Allamigeon, Xavier |
| Beyond Notations: Hygienic Macro Expansion for Theorem Proving Languages
|
2020 |
Ullrich, Sebastian |
| Formalization of Forcing in Isabelle/ZF
|
2020 |
Gunther, Emmanuel |
| Reasoning About Algebraic Structures with Implicit Carriers in Isabelle/HOL
|
2020 |
Guttmann, Walter |
| ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (System Description)
|
2020 |
Jakubuv, Jan |
| The Imandra Automated Reasoning System (System Description)
|
2020 |
Passmore, Grant |
| Prolog Technology Reinforcement Learning Prover (System Description)
|
2020 |
Zombori, Zsolt |
| Competing Inheritance Paths in Dependent Type Theory: A Case Study in Functional Analysis
|
2020 |
Affeldt, Reynald |
| A Lean Tactic for Normalising Ring Expressions with Exponents (Short Paper)
|
2020 |
Baanen, Anne |
| Formal Proof of the Group Law for Edwards Elliptic Curves
|
2020 |
Hales, Thomas |
| Efficient Verified Implementation of Introsort and Pdqsort
|
2020 |
Lammich, Peter |
| A Polymorphic Vampire (Short Paper)
|
2020 |
Bhayat, Ahmed |
| HYPNO: Theorem Proving with Hypersequent Calculi for Non-normal Modal Logics (System Description)
|
2020 |
Dalmonte, Tiziano |
| MOIN: A Nested Sequent Theorem Prover for Intuitionistic Modal Logics (System Description)
|
2020 |
Girlando, Marianna |
| Automatically Proving and Disproving Feasibility Conditions
|
2020 |
Gutiérrez, Raul |
| MU-TERM: Verify Termination Properties Automatically (System Description)
|
2020 |
Gutiérrez, Raul |
| Sequoia: A Playground for Logicians (System Description)
|
2020 |
Reis, Giselle |
| Deep Generation of Coq Lemma Names Using Elaborated Terms
|
2020 |
Nie, Pengyu |
| Extensible Extraction of Efficient Imperative Programs with Foreign Functions, Manually Managed Memory, and Proofs
|
2020 |
Pit-Claudel, Clément |
Tag hinzufügen