On the public citation graph
A Formalization of Core Why3 in Coq
0 signed · 50 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11541868_16openalex-snapshot
Essential Incompleteness of Arithmetic Verified by Coq
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-3-030-36755-8_4openalex-snapshot
Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory
inferredcites →https://doi.org/10.1007/978-3-030-72019-3_6openalex-snapshot
An Automated Deductive Verification Framework for Circuit-building Quantum Programs
inferredcites →https://doi.org/10.1007/978-3-030-79876-5_6openalex-snapshot
Isabelle’s Metalogic: Formalization and Proof Checker
inferredcites →https://doi.org/10.1007/978-3-030-81688-9_31openalex-snapshot
Cameleer: A Deductive Verification Tool for OCaml
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-030-99336-8_5openalex-snapshot
Why3-do: The Way of Harmonious Distributed System Proofs
inferredcites →https://doi.org/10.1007/978-3-030-99336-8_8openalex-snapshot
The Trusted Computing Base of the CompCert Verified Compiler
inferredcites →https://doi.org/10.1007/978-3-031-17244-1_6openalex-snapshot
Creusot: A Foundry for the Deductive Verification of Rust Programs
inferredcites →https://doi.org/10.1007/978-3-319-08970-6_3openalex-snapshot
Towards a Formally Verified Proof Assistant
inferredcites →https://doi.org/10.1007/978-3-319-63390-9_7openalex-snapshot
SMTCoq: A Plug-In for Integrating SMT Solvers into Coq
inferredcites →https://doi.org/10.1007/978-3-642-17511-4_20openalex-snapshot
Dafny: An Automatic Program Verifier for Functional Correctness
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-22792-9_5openalex-snapshot
Computer-Aided Security Proofs for the Working Cryptographer
inferredcites →https://doi.org/10.1007/978-3-642-27705-4_2openalex-snapshot
A Certified Multi-prover Verification Condition Generator
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_8openalex-snapshot
Why3 — Where Programs Meet Provers
inferredcites →https://doi.org/10.1007/978-3-642-38574-2_1openalex-snapshot
One Logic to Use Them All
inferredcites →https://doi.org/10.1016/0304-3975(85)90135-5openalex-snapshot
Automatic synthesis of typed Λ-programs on term algebras
inferredcites →https://doi.org/10.1016/j.jlamp.2023.100871openalex-snapshot
A verified VCGen based on dynamic logic: An exercise in meta-verification with Why3
inferredcites →https://doi.org/10.1016/s0049-237x(09)70189-2openalex-snapshot
Constructive Mathematics and Computer Programming
inferredcites →https://doi.org/10.1017/cbo9781107256552openalex-snapshot
Program Logics for Certified Compilers
inferredcites →https://doi.org/10.1017/s0956796818000151openalex-snapshot
Iris from the ground up: A modular foundation for higher-order concurrent separation logic
inferredcites →https://doi.org/10.1093/comjnl/38.2.131openalex-snapshot
A mechanically verified verification condition generator
inferredcites →https://doi.org/10.1145/1538788.1538814openalex-snapshot
Formal verification of a realistic compiler
inferredcites →https://doi.org/10.1145/1774088.1774610openalex-snapshot
A machine-checked soundness proof for an efficient verification condition generator
inferredcites →https://doi.org/10.1145/3341690openalex-snapshot
Equations reloaded: high-level dependently-typed functional programming and proving in Coq
inferredcites →https://doi.org/10.1145/3453483.3454036openalex-snapshot
RefinedC: automating the foundational verification of C code with refined ownership types
inferredcites →https://doi.org/10.1145/3453483.3454065openalex-snapshot
Integration verification across software and hardware for a simple embedded system
inferredcites →https://doi.org/10.1145/3632911openalex-snapshot
VST-A: A Foundationally Sound Annotation Verifier
inferredcites →https://doi.org/10.4204/eptcs.336.2openalex-snapshot
A Framework for Proof-carrying Logical Transformations
inferredcites →https://doi.org/10.4230/lipics.itp.2022.3openalex-snapshot
Candle: A Verified Implementation of HOL Light
inferredcites →https://doi.org/10.5281/zenodo.8417773openalex-snapshot
POPL Artifact for "A Formalization of Core Why3 in Coq"
inferredcites →https://doi.org/10.6092/issn.1972-5787/1979openalex-snapshot
An introduction to small scale reflection in Coq
inferredcites →https://doi.org/10.7551/mitpress/9153.001.0001openalex-snapshot
Certified Programming with Dependent Types
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-99984-0_16openalex-snapshot
Faithful Logic Embeddings in HOL— Deep and Shallow
inferred← citeshttps://doi.org/10.1007/978-3-032-28079-4_22openalex-snapshot
Foundational VeriFast: Pragmatic Certification of Verification Tool Results Through Hinted Mirroring
inferred← citeshttps://doi.org/10.1007/978-3-032-32357-6_2openalex-snapshot
Verified Tensor Operators for Safety-Critical ML: From Specification to Reference Implementation
inferred← citeshttps://doi.org/10.1007/978-3-032-32526-6_11openalex-snapshot
Velvet: A Foundational Multi-modal Verifier for Imperative Programs in Lean
inferred← citeshttps://doi.org/10.1016/j.jsc.2025.102543openalex-snapshot
Satisfiability modulo theories for verifying MILP certificates
inferred← citeshttps://doi.org/10.1145/3632911openalex-snapshot
VST-A: A Foundationally Sound Annotation Verifier
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/3704856openalex-snapshot
Formal Foundations for Translational Separation Logic Verifiers
inferred← citeshttps://doi.org/10.1145/3763151openalex-snapshot
Compositional Symbolic Execution for the Next 700 Memory Models
inferred← citeshttps://doi.org/10.1145/3839462openalex-snapshot
Sound State Encodings in Translational Separation Logic Verifiers
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.