Title resolution pending

Lena Verscht, Benjamin Lucien Kaminski , title = · 2025 · Proceedings of the ACM on Programming Languages · DOI 10.1145/3704896

1 Pith paper cite this work, alongside 2 external citations. Polarity classification is still indexing.

1 Pith paper citing it

2 external citations · OpenAlex

open at publisher browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

representative citing papers

Combining Axiomatic Models for Refinement Proofs

cs.LO · 2026-06-26 · unverdicted · novelty 5.0

Unifies four axiomatic program logics and reduces simulation relations in refinement proofs to triple validity checks in those logics.

citing papers explorer

Showing 1 of 1 citing paper.

Combining Axiomatic Models for Refinement Proofs cs.LO · 2026-06-26 · unverdicted · none · ref 4
Unifies four axiomatic program logics and reduces simulation relations in refinement proofs to triple validity checks in those logics.

Title resolution pending

fields

years

verdicts

representative citing papers

citing papers explorer