Work

A Recipe for Modular Verification of Generic Tree Traversals

Year: 2025

Type: conference-paper

Abstract: This is the artifact accompanying the paper "A Recipe for Modular Verification of Generic Tree Traversals". The artifact contains the RefinedC proofs for the case studies presented in this paper. These proofs are carried out using the RefinedC verifier. The artifact is available as a source code archive (recipe.zip) which can be checked and compiled following the instructions described in the README.md within. This artifact is known to compile with: Rocq 8.20.0 Iris dev.2025-07-17.0.dbc3e879

Source: MPG.PuRe (Max Planck Society)

DOI: 10.5281/zenodo.17799203

Author: Elbeheiry, Laila

Institution: Max Planck Institute for Software Systems

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W7108464341

FWCI: 0.497

Cites:

Cited by: 1

Related to: 10