Nominal State-Separating Proofs
Publikation:
Konference artikel i Proceeding eller bog/rapport kapitel
Konferencebidrag i proceedings
Forskning
Peer-reviewResume
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.
Publikation information
Produktionstype
Publikation:
Konference artikel i Proceeding eller bog/rapport kapitel
Konferencebidrag i proceedings
Forskning
Peer-reviewOriginalsprog
EngelskSider fra-til (Antal sider)
Sider 363-377 (15 sider)Publikationsmilepæle
- Udgivet - 16/06/2025
Publikationsstatus
Udgivet - 16/06/2025
Forlag
IEEE, USAISBN (Trykt)
9798331510817ISBN (Elektronisk)
979-8-3315-1081-7, 979-8-3315-1082-4Publikations IDer
- ORCID: /0009-0001-1720-6895/work/199383794
- Scopus: 105014722876
Titel på værtspublikation
2025 IEEE 38th Computer Security Foundations Symposium (CSF)Metrikker
PlumX, åbner i en ny fane
Antal citationer
1
Finansiering
This work is supported by the Innovation Fund Denmark for the project
DIREC (9142-00001B).
Relateret event
Titel
Computer Security Foundations Symposium
Begivenhedstype
SymposiumGrad af anerkendelse
International begivenhedDato
16/06/2025 - 20/06/2025Lokation
Santa CruzUSA
