Arch. Formal Proofs 2012
2 papers
The 2012 edition of the Archive of Formal Proofs (AFP) consisted of three entries focusing on formalizations within distributed computing and discrete mathematics. A central theme was the verification of concurrent systems, specifically regarding abortable linearizable modules. This research, authored by contributors such as Giuliano Losa, Rachid Guerraoui, and Viktor Kunčak, explores the correctness of shared objects in environments where operations may be interrupted or fail to complete.
Beyond systems verification, the year’s contributions included formal proofs in the field of combinatorics. Jeremy Avigad and Stefan Hetzl provided a formalization of Bondy’s Theorem, a result in graph theory related to the properties of finite sets. These entries illustrate a focus on applying formal methods to both theoretical mathematical results and the structural requirements of concurrent programming models. Together, these works represent a dual interest in using formal tools to address both abstract mathematical conjectures and practical challenges in computer science.
Top Authors
| Author | Papers |
|---|---|
| Jeremy Avigad | 1 |
| Rachid Guerraoui | 1 |
Papers
| Title |
|---|
| Abortable Linearizable Modules |
| Bondy's Theorem |