Work

Nominal State-Separating Proofs

Year: 2025

Type: conference-paper

Abstract: State-separating proofs are a powerful tool to structure cryptographic arguments, so that they are amenable for mechanization, as has been shown through implementations, such as SSProve. However, the treatment of separation for heaps has never been satisfactorily addressed. In this work, we present the first comprehensive treatment of nominal state separation in state-separating proofs using nominal sets. We provide a Rocq library, called Nominal-SSProve, that builds on nominal state separation supporting mechanized proofs that appear more concise and arguably more elegant.

Source: Proceedings - Computer Security Foundations Workshop/Proceedings

DOI: 10.1109/csf64896.2025.00038

Authors: Markus Krabbe Larsen, Carsten Schürmann

Institution: IT University of Copenhagen

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4413204973

FWCI: 0.984

Cites: 17

Cited by: 1

Related to: 10