On the public citation graph
Refinement reflection: complete verification with SMT
0 signed · 93 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/1-4020-8141-3_34openalex-snapshot
Dynamic Typing with Dependent Types
inferredcites →https://doi.org/10.1007/3-540-45949-9openalex-snapshot
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
inferredcites →https://doi.org/10.1007/978-3-319-09099-3_2openalex-snapshot
Computing with an SMT Solver
inferredcites →https://doi.org/10.1007/978-3-319-41528-4_20openalex-snapshot
Trigger Selection Strategies to Stabilize Program Verifiers
inferredcites →https://doi.org/10.1007/978-3-540-71316-6_35openalex-snapshot
Dependent Types for Low-Level Programming
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-22438-6_11openalex-snapshot
Extending Sledgehammer with SMT Solvers
inferredcites →https://doi.org/10.1007/978-3-642-23702-7_23openalex-snapshot
Satisfiability Modulo Recursive Programs
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_13openalex-snapshot
Abstract Refinement Types
inferredcites →https://doi.org/10.1093/comjnl/32.2.122openalex-snapshot
Algebraic Identities for Program Calculation
inferredcites →https://doi.org/10.1109/32.713327openalex-snapshot
Subtypes for specifications: predicate subtyping in PVS
inferredcites →https://doi.org/10.1109/csf.2008.27openalex-snapshot
Refinement Types for Secure Implementations
inferredcites →https://doi.org/10.1145/1706299.1706325openalex-snapshot
Decision procedures for algebraic data types with abstractions
inferredcites →https://doi.org/10.1145/1806596.1806643openalex-snapshot
Type-preserving compilation of end-to-end verification of security enforcement
inferredcites →https://doi.org/10.1145/2034675.2034685openalex-snapshot
A monad for deterministic parallelism
inferredcites →https://doi.org/10.1145/24697.24706openalex-snapshot
A critique of Abelson and Sussman or why calculating is better than scheming
inferredcites →https://doi.org/10.1145/2535838.2535883openalex-snapshot
Combining proofs and programs in a dependently typed language
inferredcites →https://doi.org/10.1145/2633357.2633361openalex-snapshot
Promoting functions to type families in Haskell
inferredcites →https://doi.org/10.1145/2678015.2682546openalex-snapshot
Verifying Relational Properties of Functional Programs by First-Order Refinement
inferredcites →https://doi.org/10.1145/277650.277732openalex-snapshot
Eliminating array bound checking through dependent types
inferredcites →https://doi.org/10.1145/2837614.2837655openalex-snapshot
Dependent types and multi-monadic effects in F*
inferredcites →https://doi.org/10.1145/289423.289451openalex-snapshot
Cayenne—a language with dependent types
inferredcites →https://doi.org/10.1145/2908080.2908091openalex-snapshot
Occurrence typing modulo theories
inferredcites →https://doi.org/10.1145/2908080.2908092openalex-snapshot
Cartesian hoare logic for verifying k-safety properties
inferredcites →https://doi.org/10.1145/2908080.2908110openalex-snapshot
Refinement types for TypeScript
inferredcites →https://doi.org/10.1145/800027.808417openalex-snapshot
Guarded commands, non-determinacy and a calculus for the derivation of programs
inferredcites →https://doi.org/10.1145/800194.805852openalex-snapshot
Definitional interpreters for higher-order programming languages
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-030-11245-5_15openalex-snapshot
A Decidable Logic for Tree Data-Structures with Measurements
inferred← citeshttps://doi.org/10.1007/978-3-030-17184-1_2openalex-snapshot
Meta-F $$^\star $$ : Proof Automation with SMT, Tactics, and Metaprograms
inferred← citeshttps://doi.org/10.1007/978-3-030-64437-6_4openalex-snapshot
Neural Networks, Secure by Construction
inferred← citeshttps://doi.org/10.1007/978-3-031-22337-2_26openalex-snapshot
Embedded Domain Specific Verifiers
inferred← citeshttps://doi.org/10.1007/978-3-031-71162-6_8openalex-snapshot
Free Facts: An Alternative to Inefficient Axioms in Dafny
inferred← citeshttps://doi.org/10.1007/978-981-97-8943-6_14openalex-snapshot
OBRA: Oracle-Based, Relational, Algorithmic Type Verification
inferred← citeshttps://doi.org/10.1007/s00354-022-00167-1openalex-snapshot
Helmholtz: A Verifier for Tezos Smart Contracts Based on Refinement Types
inferred← citeshttps://doi.org/10.1016/j.cola.2024.101275openalex-snapshot
Towards a Dynabook for verified VM construction
inferred← citeshttps://doi.org/10.1017/s0956796820000283openalex-snapshot
Ready, Set , Verify! Applying hs-to-coq to real-world Haskell code
inferred← citeshttps://doi.org/10.1145/3193776openalex-snapshot
Using functions for easier programming
inferred← citeshttps://doi.org/10.1145/3236784openalex-snapshot
Ready, set, verify! applying hs-to-coq to real-world Haskell code (experience report)
inferred← citeshttps://doi.org/10.1145/3242744.3242756openalex-snapshot
Theorem proving for all: equational reasoning in liquid Haskell (functional pearl)
inferred← citeshttps://doi.org/10.1145/3290360openalex-snapshot
Inferring frame conditions with static correlation analysis
inferred← citeshttps://doi.org/10.1145/3290388openalex-snapshot
LWeb: information flow security for multi-tier web applications
inferred← citeshttps://doi.org/10.1145/3299711.3242756openalex-snapshot
Theorem proving for all: equational reasoning in liquid Haskell (functional pearl)
inferred← citeshttps://doi.org/10.1145/3331545.3342591openalex-snapshot
Generic and flexible defaults for verified, law-abiding type-class instances
inferred← citeshttps://doi.org/10.1145/3360592openalex-snapshot
System FR: formalized foundations for the stainless verifier
inferred← citeshttps://doi.org/10.1145/3408989openalex-snapshot
Lower your guards: a compositional pattern-match coverage checker
inferred← citeshttps://doi.org/10.1145/3409001openalex-snapshot
Stable relations and abstract interpretation of higher-order programs
inferred← citeshttps://doi.org/10.1145/3428284openalex-snapshot
Verifying replicated data types with typeclass refinements in Liquid Haskell
inferred← citeshttps://doi.org/10.1145/3473578openalex-snapshot
Reasoning about effect interaction by fusion
inferred← citeshttps://doi.org/10.1145/3485493openalex-snapshot
Data-driven abductive inference of library specifications
inferred← citeshttps://doi.org/10.1145/3519939.3523725openalex-snapshot
ANOSY: approximated knowledge synthesis with refinement types for declassification
inferred← citeshttps://doi.org/10.1145/3546189.3549919openalex-snapshot
How to safely use extensionality in Liquid Haskell
inferred← citeshttps://doi.org/10.1145/3546189.3549922openalex-snapshot
Coinduction inductively: mechanizing coinductive proofs in Liquid Haskell
inferred← citeshttps://doi.org/10.1145/3547643openalex-snapshot
Safe couplings: coupled refinement types
inferred← citeshttps://doi.org/10.1145/3587216.3587222openalex-snapshot
Verified Causal Broadcast with Liquid Haskell
inferred← citeshttps://doi.org/10.1145/3607852openalex-snapshot
Dependently-Typed Programming with Logical Equality Reflection
inferred← citeshttps://doi.org/10.1145/3622835openalex-snapshot
Complete First-Order Reasoning for Properties of Functional Programs
inferred← citeshttps://doi.org/10.1145/3632869openalex-snapshot
Quotient Haskell: Lightweight Quotient Types for All
inferred← citeshttps://doi.org/10.1145/3632875openalex-snapshot
An Infinite Needle in a Finite Haystack: Finding Infinite Counter-Models in Deductive Verification
inferred← citeshttps://doi.org/10.1145/3632911openalex-snapshot
VST-A: A Foundationally Sound Annotation Verifier
inferred← citeshttps://doi.org/10.1145/3656408openalex-snapshot
Automated Verification of Fundamental Algebraic Laws
inferred← citeshttps://doi.org/10.1145/3677999.3678282openalex-snapshot
Liquid Amortization: Proving Amortized Complexity with LiquidHaskell (Functional Pearl)
inferred← citeshttps://doi.org/10.1145/3720447openalex-snapshot
FO-Complete Program Verification for Heap Logics
inferred← citeshttps://doi.org/10.1145/3763171openalex-snapshot
Validating Soundness and Completeness in Pattern-Match Coverage Analyzers
inferred← citeshttps://doi.org/10.1145/3798248openalex-snapshot
PLEX: Normalization for Refinement Types
inferred← citeshttps://doi.org/10.1145/3808278openalex-snapshot
Code-Specify-Test-Debug-Prove: Flexibly Integrating Separation Logic Specification into Conventional Workflows
inferred← citeshttps://doi.org/10.1145/3808304openalex-snapshot
Verifying Array Properties in Pure Data-Parallel Programs
inferred← citeshttps://doi.org/10.1145/3815001.3815004openalex-snapshot
Refined Remora: Constraining Array Shapes
inferred← citeshttps://doi.org/10.4230/lipics.calco.2025.4openalex-snapshot
Distributive Laws of Monadic Containers
inferred← citeshttps://doi.org/10.48550/arxiv.1803.06547openalex-snapshot
Meta-F*: Proof Automation with SMT, Tactics, and Metaprograms
inferred← citeshttps://doi.org/10.70675/c018de4fz82e7z4dfbz87ddz2d04ae6e4664openalex-snapshot
Programmation vérifiée à l'intersection des types dépendants et de l'analyse statique
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.