On the public citation graph

System FR: formalized foundations for the stainless verifier

https://doi.org/10.1145/3360592
0 signed · 67 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/11693024_6openalex-snapshot
Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types
inferredcites →https://doi.org/10.1007/3-540-39185-1_9openalex-snapshot
A Unifying Approach to Recursive and Co-recursive Definitions
inferredcites →https://doi.org/10.1007/3-540-45413-6_27openalex-snapshot
The Implicit Calculus of Constructions Extending Pure Type Systems with an Intersection Type Binder and Subtyping
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-08970-6_3openalex-snapshot
Towards a Formally Verified Proof Assistant
inferredcites →https://doi.org/10.1007/978-3-319-29778-1_16openalex-snapshot
Conc-Trees for Functional and Parallel Programming
inferredcites →https://doi.org/10.1007/978-3-319-40229-1_38openalex-snapshot
Translating Scala Programs to Isabelle/HOL
inferredcites →https://doi.org/10.1007/978-3-540-25979-4_15openalex-snapshot
Automated Termination Proofs with AProVE
inferredcites →https://doi.org/10.1007/978-3-540-30569-9_3openalex-snapshot
The Spec# Programming System: An Overview
inferredcites →https://doi.org/10.1007/978-3-642-03153-3_3openalex-snapshot
A Tutorial on Type-Based Termination
inferredcites →https://doi.org/10.1007/978-3-642-14052-5_29openalex-snapshot
Equations: A Dependent Pattern-Matching Compiler
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-07964-5openalex-snapshot
Interactive Theorem Proving and Program Development
inferredcites →https://doi.org/10.1007/s10817-011-9225-2openalex-snapshot
The Locally Nameless Representation
inferredcites →https://doi.org/10.1016/s0049-237x(08)70843-7openalex-snapshot
Une Extension De ĽInterpretation De Gödel a ĽAnalyse, Et Son Application a ĽElimination Des Coupures Dans ĽAnalyse Et La Theorie Des Types
inferredcites →https://doi.org/10.1017/s0956796816000216openalex-snapshot
Higher order symbolic execution for contract verification and refutation
inferredcites →https://doi.org/10.1017/s0960129503004122openalex-snapshot
Type-based termination of recursive definitions
inferredcites →https://doi.org/10.1051/ita:2004015openalex-snapshot
Termination checking with types
inferredcites →https://doi.org/10.1109/lics.2001.932500openalex-snapshot
Dependent types for program termination verification
inferredcites →https://doi.org/10.1109/lics.2013.29openalex-snapshot
Type-Based Productivity of Stream Definitions in the Calculus of Constructions
inferredcites →https://doi.org/10.1145/1890028.1890030openalex-snapshot
Automated termination proofs for haskell by term rewriting
inferredcites →https://doi.org/10.1145/2428116.2428118openalex-snapshot
Idris
inferredcites →https://doi.org/10.1145/2491956.2491978openalex-snapshot
Verifying higher-order programs with the dijkstra monad
inferredcites →https://doi.org/10.1145/2500365.2500591openalex-snapshot
Wellfounded recursion with copatterns
inferredcites →https://doi.org/10.1145/2535838.2535883openalex-snapshot
Combining proofs and programs in a dependently typed language
inferredcites →https://doi.org/10.1145/2628136.2628161openalex-snapshot
Refinement types for Haskell
inferredcites →https://doi.org/10.1145/2774975.2774978openalex-snapshot
Counter-example complete verification for higher-order functions
inferredcites →https://doi.org/10.1145/2774975.2774980openalex-snapshot
Sound reasoning about integral data types with a reusable SMT solver interface
inferredcites →https://doi.org/10.1145/3009837.3009878openalex-snapshot
Dijkstra monads for free
inferredcites →https://doi.org/10.1145/3158130openalex-snapshot
Simplicitly: foundations and applications of implicit function types
inferredcites →https://doi.org/10.1145/3158141openalex-snapshot
Refinement reflection: complete verification with SMT
inferredcites →https://doi.org/10.1145/3314221.3314618openalex-snapshot
Lazy counterfactual symbolic execution
inferredcites →https://doi.org/10.2168/lmcs-4(2:3)2008openalex-snapshot
Semi-continuous Sized Types and Termination
inferredcites →https://doi.org/10.2307/2271658openalex-snapshot
Intensional interpretations of functionals of finite type I
inferredcites →https://doi.org/10.29007/322qopenalex-snapshot
MiniAgda: Integrating Sized and Dependent Types
inferredcites →https://doi.org/10.4204/eptcs.77.1openalex-snapshot
Type-Based Termination, Inflationary Fixed-Points, and Mixed Inductive-Coinductive Types
inferredcites →https://doi.org/10.4230/lipics.fscd.2018.19openalex-snapshot
Index-Stratified Types
inferredcites →https://doi.org/10.6092/issn.1972-5787/1695openalex-snapshot
Sets in Coq, Coq in Sets

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-94583-1_17openalex-snapshot
Generalized Arrays for Stainless Frames
inferred← citeshttps://doi.org/10.1007/978-3-030-99527-0_11openalex-snapshot
Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-031-06773-0_21openalex-snapshot
From Verified Scala to STIX File System Embedded Code Using Stainless
inferred← citeshttps://doi.org/10.1007/978-3-031-08166-8_15openalex-snapshot
Further Lessons from the JML Project
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-37709-9_19openalex-snapshot
Formula Normalizations in Verification
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8_13openalex-snapshot
Higher-Order LCTRSs and Their Termination
inferred← citeshttps://doi.org/10.1007/978-3-031-63498-7_18openalex-snapshot
Verifying a Realistic Mutable Hash Table
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-3-031-76554-4_5openalex-snapshot
Proving Termination via Measure Transfer in Equivalence Checking
inferred← citeshttps://doi.org/10.1007/978-3-031-82703-7_9openalex-snapshot
Formally Verifiable Generated ASN.1/ACN Encoders and Decoders: A Case Study
inferred← citeshttps://doi.org/10.1007/978-3-031-91121-7_7openalex-snapshot
Formal Autograding in a Classroom
inferred← citeshttps://doi.org/10.1007/978-3-032-22749-2_1openalex-snapshot
Verifying Floating-Point Programs in Stainless
inferred← citeshttps://doi.org/10.1007/978-3-032-26220-2_6openalex-snapshot
Can LLM Aid in Solving Constraints with Inductive Definitions?
inferred← citeshttps://doi.org/10.1007/978-3-032-26743-6_3openalex-snapshot
Autograding Weakest Precondition Proofs and Dafny Specifications
inferred← citeshttps://doi.org/10.1017/s1471068421000211openalex-snapshot
Analysis and Transformation of Constrained Horn Clauses for Program Verification
inferred← citeshttps://doi.org/10.1017/s1471068422000175openalex-snapshot
Verifying Catamorphism-Based Contracts using Constrained Horn Clauses
inferred← citeshttps://doi.org/10.1109/icse55347.2025.00090openalex-snapshot
Neurosymbolic Modular Refinement Type Inference
inferred← citeshttps://doi.org/10.1145/3547643openalex-snapshot
Safe couplings: coupled refinement types
inferred← citeshttps://doi.org/10.1145/3591258openalex-snapshot
Proving and Disproving Equivalence of Functional Programming Assignments
inferred← citeshttps://doi.org/10.1145/3608443openalex-snapshot
A Model Checker for Operator Precedence Languages
inferred← citeshttps://doi.org/10.1145/3622835openalex-snapshot
Complete First-Order Reasoning for Properties of Functional Programs
inferred← citeshttps://doi.org/10.1145/3632912openalex-snapshot
Mechanizing Refinement Types
inferred← citeshttps://doi.org/10.1145/3689745openalex-snapshot
Refinement Type Refutations
inferred← citeshttps://doi.org/10.1145/3798248openalex-snapshot
PLEX: Normalization for Refinement Types
inferred← citeshttps://doi.org/10.1561/2500000032openalex-snapshot
Refinement Types: A Tutorial
inferred← citeshttps://doi.org/10.4204/eptcs.320.7openalex-snapshot
Transformational Verification of Quicksort
inferred← citeshttps://doi.org/10.4204/eptcs.373.3openalex-snapshot
Contract Strengthening through Constrained Horn Clause Verification
inferred← citeshttps://doi.org/10.4204/eptcs.396.1openalex-snapshot
On the Practicality and Soundness of Refinement Types
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.