On the public citation graph

Generating Proof Certificates for a Language-Agnostic Deductive Program Verifier

0 signed · 49 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/10721959_3openalex-snapshot
Proof Generation in the Touchstone Theorem Prover
inferredcites →https://doi.org/10.1007/11804192_17openalex-snapshot
Boogie: A Modular Reusable Verifier for Object-Oriented Programs
inferredcites →https://doi.org/10.1007/978-0-387-26677-0openalex-snapshot
Unsolved Problems in Number Theory
inferredcites →https://doi.org/10.1007/978-3-030-53518-6_5openalex-snapshot
Metamath Zero: Designing a Theorem Prover Prover
inferredcites →https://doi.org/10.1007/978-3-030-81688-9_23openalex-snapshot
Towards a Trustworthy Semantics-Based Language Framework via Proof Generation
inferredcites →https://doi.org/10.1007/978-3-030-81688-9_33openalex-snapshot
Formally Validating a Practical Verification Condition Generator
inferredcites →https://doi.org/10.1007/978-3-319-08918-8_29openalex-snapshot
All-Path Reachability Logic
inferredcites →https://doi.org/10.1007/978-3-319-11164-3_24openalex-snapshot
RV-Monitor: Efficient Parametric Runtime Verification with Simultaneous Properties
inferredcites →https://doi.org/10.1007/978-3-319-41528-4_24openalex-snapshot
RV-Match: Practical Semantics-Based Program Analysis
inferredcites →https://doi.org/10.1007/978-3-540-71067-7_6openalex-snapshot
A Brief Overview of HOL4
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-642-20398-5_4openalex-snapshot
VeriFast: A Powerful, Sound, Predictable, Fast Verifier for C and Java
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_8openalex-snapshot
Why3 — Where Programs Meet Provers
inferredcites →https://doi.org/10.1007/bfb0054170openalex-snapshot
Translation validation
inferredcites →https://doi.org/10.1007/s10703-012-0163-3openalex-snapshot
SMT proof checking using a logical framework
inferredcites →https://doi.org/10.1007/s10817-009-9148-3openalex-snapshot
Mechanized Semantics for the Clight Subset of the C Language
inferredcites →https://doi.org/10.1016/0304-3975(77)90044-5openalex-snapshot
LCF considered as a programming language
inferredcites →https://doi.org/10.1016/0304-3975(82)90125-6openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1016/j.jlamp.2021.100638openalex-snapshot
Matching logic explained
inferredcites →https://doi.org/10.1109/csf.2018.00022openalex-snapshot
KEVM: A Complete Formal Semantics of the Ethereum Virtual Machine
inferredcites →https://doi.org/10.1109/lics.2013.42openalex-snapshot
One-Path Reachability Logic
inferredcites →https://doi.org/10.1109/lics.2019.8785675openalex-snapshot
Matching μ-Logic
inferredcites →https://doi.org/10.1145/2103621.2103719openalex-snapshot
An executable formal semantics of C with applications
inferredcites →https://doi.org/10.1145/2578855.2535841openalex-snapshot
CakeML
inferredcites →https://doi.org/10.1145/2737924.2737991openalex-snapshot
KJS: a complete formal semantics of JavaScript
inferredcites →https://doi.org/10.1145/2775051.2676982openalex-snapshot
K-Java
inferredcites →https://doi.org/10.1145/3022671.2984027openalex-snapshot
Semantics-based program verifiers for all languages
inferredcites →https://doi.org/10.1145/321992.321997openalex-snapshot
Initial Algebra Semantics and Continuous Algebras
inferredcites →https://doi.org/10.1145/3314221.3314601openalex-snapshot
A complete formal semantics of x86-64 user-level instruction set architecture
inferredcites →https://doi.org/10.1145/3408970openalex-snapshot
A general approach to define binders using matching logic
inferredcites →https://doi.org/10.1145/3445814.3446751openalex-snapshot
Language-parametric compiler validation with application to LLVM
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.2140/pjm.1955.5.285openalex-snapshot
A lattice-theoretical fixpoint theorem and its applications
inferredcites →https://doi.org/10.23638/lmcs-13(4:28)2017openalex-snapshot
Matching Logic
inferredcites →https://doi.org/10.4204/eptcs.336.2openalex-snapshot
A Framework for Proof-carrying Logical Transformations
inferredcites →https://doi.org/10.4230/lipics.ecoop.2020.7openalex-snapshot
K-LLVM: A Relatively Complete Semantics of LLVM IR
inferredcites →https://doi.org/10.5281/zenodo.7482286openalex-snapshot
Generating Proof Certificates for a Language-Agnostic Deductive Program Verifier

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-74776-2_16openalex-snapshot
ConstraintFlow: A Declarative DSL for Easy Development of DNN Certifiers
inferred← citeshttps://doi.org/10.1007/978-3-032-10794-7_20openalex-snapshot
Model-Based Testing of an Intermediate Verifier Using Executable Operational Semantics
inferred← citeshttps://doi.org/10.1007/978-3-032-22730-0_10openalex-snapshot
$$\mathbb {K}$$ Definitions as Matching Logic Theories, Formally
inferred← citeshttps://doi.org/10.1016/j.jlamp.2024.101033openalex-snapshot
Transforming concurrent programs with semaphores into logically constrained term rewrite systems
inferred← citeshttps://doi.org/10.1016/j.jlamp.2025.101056openalex-snapshot
Transforming imperative programs into bisimilar logically constrained term rewrite systems via injective functions from configurations to terms
inferred← citeshttps://doi.org/10.1016/j.jlamp.2026.101146openalex-snapshot
Toward model-theoretic consistency verification in a dependently typed encoding of matching logic
inferred← citeshttps://doi.org/10.1145/3656438openalex-snapshot
Towards Trustworthy Automated Program Verifiers: Formally Validating Translations into an Intermediate Verification Language
inferred← citeshttps://doi.org/10.1145/3729320openalex-snapshot
Verifying Solutions to Semantics-Guided Synthesis Problems
inferred← citeshttps://doi.org/10.1145/3776719openalex-snapshot
Foundational Multi-Modal Program Verifiers
inferred← citeshttps://doi.org/10.1145/3828756openalex-snapshot
Compiling by Proving in \({\mathbb{K}}\) : From All-Path Reachability Proofs to Single-Step Semantic Rules
inferred← citeshttps://doi.org/10.4204/eptcs.389.4openalex-snapshot
Matching-Logic-Based Understanding of Polynomial Functors and their Initial/Final Models
inferred← citeshttps://doi.org/10.4204/eptcs.427.1openalex-snapshot
On a Dependently Typed Encoding of Matching Logic
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.