On the public citation graph
Refinement Types: A Tutorial
0 signed · 131 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/11575467_19openalex-snapshot
Termination Analysis of Higher-Order Functional Programs
inferredcites →https://doi.org/10.1007/3-540-15983-5_13openalex-snapshot
Constructions: A higher order proof system for mechanizing mathematics
inferredcites →https://doi.org/10.1007/3-540-45251-6_29openalex-snapshot
Houdini, an Annotation Assistant for ESC/Java
inferredcites →https://doi.org/10.1007/978-3-030-17184-1_2openalex-snapshot
Meta-F $$^\star $$ : Proof Automation with SMT, Tactics, and Metaprograms
inferredcites →https://doi.org/10.1007/978-3-319-04132-2_2openalex-snapshot
Partial Type Signatures for Haskell
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-10575-8_15openalex-snapshot
Predicate Abstraction for Program Verification
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-642-17511-4_20openalex-snapshot
Dafny: An Automatic Program Verifier for Functional Correctness
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.1007/978-3-662-49122-5_3openalex-snapshot
Predicate Abstraction for Linked Data Structures
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_18openalex-snapshot
Extensible Datasort Refinements
inferredcites →https://doi.org/10.1007/bfb0059696openalex-snapshot
Procedures and parameters: An axiomatic approach
inferredcites →https://doi.org/10.1007/s10703-016-0249-4openalex-snapshot
SMT-based model checking for recursive programs
inferredcites →https://doi.org/10.1016/0022-0000(78)90014-4openalex-snapshot
A theory of type polymorphism in programming
inferredcites →https://doi.org/10.1016/0304-3975(77)90044-5openalex-snapshot
LCF considered as a programming language
inferredcites →https://doi.org/10.1016/0890-5401(88)90005-3openalex-snapshot
The calculus of constructions
inferredcites →https://doi.org/10.1017/s0956796808006953openalex-snapshot
Hoare type theory, polymorphism and separation
inferredcites →https://doi.org/10.1017/s0956796809007345openalex-snapshot
Algebra of programming in Agda: Dependent types for relational program derivation
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.1017/s0960129503004122openalex-snapshot
Type-based termination of recursive definitions
inferredcites →https://doi.org/10.1090/psapm/019/0235771openalex-snapshot
Assigning meanings to programs
inferredcites →https://doi.org/10.1090/s0002-9947-1953-0053041-6openalex-snapshot
Classes of Recursively Enumerable Sets and Their Decision Problems
inferredcites →https://doi.org/10.1093/comjnl/32.2.122openalex-snapshot
Algebraic Identities for Program Calculation
inferredcites →https://doi.org/10.1109/lics.2003.1210042openalex-snapshot
Types and programming languages: the next generation
inferredcites →https://doi.org/10.1109/sp.2019.00064openalex-snapshot
Formally Verified Cryptographic Web Applications in WebAssembly
inferredcites →https://doi.org/10.1109/synasc49474.2019.00010openalex-snapshot
The Science, Art, and Magic of Constrained Horn Clauses
inferredcites →https://doi.org/10.1145/1016848.1016878openalex-snapshot
A nanopass infrastructure for compiler education
inferredcites →https://doi.org/10.1145/1066100.1066102openalex-snapshot
Simplify: a theorem prover for program checking
inferredcites →https://doi.org/10.1145/1159803.1159811openalex-snapshot
Simple unification-based type inference for GADTs
inferredcites →https://doi.org/10.1145/1190216.1190247openalex-snapshot
Logic-flow analysis of higher-order programs
inferredcites →https://doi.org/10.1145/1328438.1328486openalex-snapshot
The design and implementation of typed scheme
inferredcites →https://doi.org/10.1145/1481848.1481853openalex-snapshot
Compositional reasoning and decidable checking for dependent contract types
inferredcites →https://doi.org/10.1145/155090.155113openalex-snapshot
The essence of compiling with continuations
inferredcites →https://doi.org/10.1145/1596550.1596599openalex-snapshot
Complete and decidable type inference for GADTs
inferredcites →https://doi.org/10.1145/1863543.1863560openalex-snapshot
Semantic subtyping with an SMT solver
inferredcites →https://doi.org/10.1145/1890028.1890030openalex-snapshot
Automated termination proofs for haskell by term rewriting
inferredcites →https://doi.org/10.1145/1890028.1890031openalex-snapshot
Refinement types for secure implementations
inferredcites →https://doi.org/10.1145/1953122.1953145openalex-snapshot
Specification and verification
inferredcites →https://doi.org/10.1145/2034773.2034811openalex-snapshot
Secure distributed programming with value-dependent types
inferredcites →https://doi.org/10.1145/237721.240882openalex-snapshot
Proving the correctness of reactive systems using sized types
inferredcites →https://doi.org/10.1145/2384616.2384659openalex-snapshot
Dependent types for JavaScript
inferredcites →https://doi.org/10.1145/2429069.2429134openalex-snapshot
Subjective auxiliary state for coarse-grained concurrency
inferredcites →https://doi.org/10.1145/2491956.2462169openalex-snapshot
Natural proofs for structure, data, and separation
inferredcites →https://doi.org/10.1145/2500365.2500582openalex-snapshot
Complete and easy bidirectional typechecking for higher-rank polymorphism
inferredcites →https://doi.org/10.1145/2676726.2676970openalex-snapshot
Functors are Type Refinement Systems
inferredcites →https://doi.org/10.1145/2676726.2676996openalex-snapshot
Manifest Contracts for Datatypes
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/2908080.2908091openalex-snapshot
Occurrence typing modulo theories
inferredcites →https://doi.org/10.1145/2908080.2908093openalex-snapshot
Program synthesis from polymorphic refinement types
inferredcites →https://doi.org/10.1145/2908080.2908110openalex-snapshot
Refinement types for TypeScript
inferredcites →https://doi.org/10.1145/3064850openalex-snapshot
Verifying Invariants of Lock-Free Data Structures with Rely-Guarantee and Refinement Types
inferredcites →https://doi.org/10.1145/3133956.3134043openalex-snapshot
HACL*: A Verified Modern Cryptographic Library
inferredcites →https://doi.org/10.1145/3158141openalex-snapshot
Refinement reflection: complete verification with SMT
inferredcites →https://doi.org/10.1145/3290388openalex-snapshot
LWeb: information flow security for multi-tier web applications
inferredcites →https://doi.org/10.1145/3314221.3314618openalex-snapshot
Lazy counterfactual symbolic execution
inferredcites →https://doi.org/10.1145/3314221.3314643openalex-snapshot
Size-change termination as a contract: dynamically and statically enforcing termination for higher-order programs
inferredcites →https://doi.org/10.1145/3360573openalex-snapshot
Leveraging rust types for modular specification and verification
inferredcites →https://doi.org/10.1145/3360592openalex-snapshot
System FR: formalized foundations for the stainless verifier
inferredcites →https://doi.org/10.1145/3371076openalex-snapshot
Coq Coq correct! verification of type checking and erasure for Coq, in Coq
inferredcites →https://doi.org/10.1145/3371092openalex-snapshot
Liquidate your assets: reasoning about resource usage in liquid Haskell
inferredcites →https://doi.org/10.1145/3381915openalex-snapshot
A Principled Approach to Selective Context Sensitivity for Pointer Analysis
inferredcites →https://doi.org/10.1145/3428284openalex-snapshot
Verifying replicated data types with typeclass refinements in Liquid Haskell
inferredcites →https://doi.org/10.1145/360204.375719openalex-snapshot
BI as an assertion language for mutable data structures
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/512557.512558openalex-snapshot
Extended static checking for Java
inferredcites →https://doi.org/10.1145/514188.514190openalex-snapshot
Parametric shape analysis via 3-valued logic
inferredcites →https://doi.org/10.1145/582153.582176openalex-snapshot
Principal type-schemes for functional programs
inferredcites →https://doi.org/10.1145/947783.948659openalex-snapshot
The NYU Ada translator and interpreter
inferredcites →https://doi.org/10.1145/99370.99392openalex-snapshot
F-bounded polymorphism for object-oriented programming
inferredcites →https://doi.org/10.2168/lmcs-6(4:5)2010openalex-snapshot
Refinement Types for Logical Frameworks and Their Interpretation as Proof Irrelevance
inferredcites →https://doi.org/10.2307/1995158openalex-snapshot
The Principal Type-Scheme of an Object in Combinatory Logic
inferredcites →https://doi.org/10.4204/eptcs.149.8openalex-snapshot
OpenJML: Software verification for Java 7 using JML, OpenJDK, and Eclipse
inferredcites →https://doi.org/10.4230/lipics.ecoop.2015.396openalex-snapshot
Asynchronous Liquid Separation Types
inferredcites →https://doi.org/10.4230/lipics.itp.2025.26openalex-snapshot
Improving the SMT Proof Reconstruction Pipeline in Isabelle/HOL
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-22337-2_26openalex-snapshot
Embedded Domain Specific Verifiers
inferred← citeshttps://doi.org/10.1007/978-3-032-28079-4_21openalex-snapshot
Towards Formal Verification of Hybrid Synchronous Programs with Refinement Types
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.1016/j.cola.2024.101275openalex-snapshot
Towards a Dynabook for verified VM construction
inferred← citeshttps://doi.org/10.1016/j.scico.2025.103386openalex-snapshot
An overview of research with Slco on seamless integration of formal verification into model-driven software engineering
inferred← citeshttps://doi.org/10.1109/csf64896.2025.00031openalex-snapshot
Securing P4 Programs by Information Flow Control
inferred← citeshttps://doi.org/10.1109/icse48619.2023.00132openalex-snapshot
Usability-Oriented Design of Liquid Types for Java
inferred← citeshttps://doi.org/10.1109/sp46215.2023.10179477openalex-snapshot
Owl: Compositional Verification of Security Protocols via an Information-Flow Type System
inferred← citeshttps://doi.org/10.1145/3546189.3549922openalex-snapshot
Coinduction inductively: mechanizing coinductive proofs in Liquid Haskell
inferred← citeshttps://doi.org/10.1145/3546196.3550162openalex-snapshot
A Hoare logic style refinement types formalisation
inferred← citeshttps://doi.org/10.1145/3591271openalex-snapshot
Covering All the Bases: Type-Based Verification of Test Input Generators
inferred← citeshttps://doi.org/10.1145/3656433openalex-snapshot
A HAT Trick: Automatically Verifying Representation Invariants using Symbolic Finite Automata
inferred← citeshttps://doi.org/10.1145/3674657openalex-snapshot
Synchronous Programming with Refinement Types
inferred← citeshttps://doi.org/10.1145/3689492.3689814openalex-snapshot
Use Site Checking Considered Harmful
inferred← citeshttps://doi.org/10.1145/3763158openalex-snapshot
We’ve Got You Covered: Type-Guided Repair of Incomplete Input Generators
inferred← citeshttps://doi.org/10.1145/3798248openalex-snapshot
PLEX: Normalization for Refinement Types
inferred← citeshttps://doi.org/10.1145/3808264openalex-snapshot
Trace-Guided Synthesis of Effectful Test Generators
inferred← citeshttps://doi.org/10.18255/1818-1015-2021-4-414-433openalex-snapshot
A Recursive Inclusion Checker for Recursively Defined Subtypes
inferred← citeshttps://doi.org/10.23939/csn2026.01.028openalex-snapshot
A HYBRID LLM-BASED ARCHITECTURE FOR DOMAIN-SPECIFIC MATHEMATICAL MODEL CONSTRUCTION AND COMPUTATION
inferred← citeshttps://doi.org/10.4204/eptcs.396.1openalex-snapshot
On the Practicality and Soundness of Refinement Types
inferred← citeshttps://doi.org/10.46298/entics.12286openalex-snapshot
Dependent Type Refinements for Futures
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.