On the public citation graph

Relatively complete refinement type system for verification of higher-order non-deterministic programs

0 signed · 76 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/11513988_8openalex-snapshot
Abstraction for Falsification
inferredcites →https://doi.org/10.1007/11691372_14openalex-snapshot
Why Waste a Perfectly Good Abstraction?
inferredcites →https://doi.org/10.1007/11787006_31openalex-snapshot
Descriptive and Relative Completeness of Logics for Higher-Order Functions
inferredcites →https://doi.org/10.1007/11817963_18openalex-snapshot
Yasm: A Software Model-Checker for Verification and Refutation
inferredcites →https://doi.org/10.1007/3-540-12896-4_365openalex-snapshot
Reasoning about procedures as parameters
inferredcites →https://doi.org/10.1007/3-540-15648-8_9openalex-snapshot
A Hoare Calculus for functions defined by recursion on higher types
inferredcites →https://doi.org/10.1007/3-540-44685-0_29openalex-snapshot
Abstraction-Based Model Checking Using Modal Transition Systems
inferredcites →https://doi.org/10.1007/978-3-319-21668-3_17openalex-snapshot
Predicate Abstraction and CEGAR for Disproving Termination of Higher-Order Functional Programs
inferredcites →https://doi.org/10.1007/978-3-319-21690-4_2openalex-snapshot
On Automation of CTL* Verification for Infinite-State Systems
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_40openalex-snapshot
Monotonic Abstraction-Refinement for CTL
inferredcites →https://doi.org/10.1007/978-3-540-88387-6_9openalex-snapshot
Model Checking Recursive Programs with Exact Predicate Abstraction
inferredcites →https://doi.org/10.1007/978-3-642-22110-1_38openalex-snapshot
HMC: Verifying Functional Programs Using Abstract Interpreters
inferredcites →https://doi.org/10.1007/978-3-642-28756-5_17openalex-snapshot
Compositional Termination Proofs for Multi-threaded Programs
inferredcites →https://doi.org/10.1007/978-3-642-35873-9_19openalex-snapshot
Compositional and Lightweight Dependent Type Inference for ML
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_61openalex-snapshot
Solving Existentially Quantified Horn Clauses
inferredcites →https://doi.org/10.1007/978-3-642-54833-8_21openalex-snapshot
Automatic Termination Verification for Higher-Order Functional Programs
inferredcites →https://doi.org/10.1007/978-3-642-54862-8_11openalex-snapshot
Proving Nontermination via Safety
inferredcites →https://doi.org/10.1007/978-3-662-48288-9_12openalex-snapshot
Refinement Type Inference via Horn Constraint Optimization
inferredcites →https://doi.org/10.1007/bf00264295openalex-snapshot
A sound and relatively complete Hoare-logic for a language with higher type procedures
inferredcites →https://doi.org/10.1016/0304-3975(84)90066-5openalex-snapshot
Correctness of programs with Pascal-like procedures without global variables
inferredcites →https://doi.org/10.1016/0890-5401(89)90040-0openalex-snapshot
Reasoning about procedures as parameters in the language L4
inferredcites →https://doi.org/10.1023/a:1019916231463openalex-snapshot
Dependent Types for Program Termination Verification
inferredcites →https://doi.org/10.1093/jigpal/jzn018openalex-snapshot
A Sound and Complete Deductive System for CTL* Verification
inferredcites →https://doi.org/10.1109/lics.2001.932500openalex-snapshot
Dependent types for program termination verification
inferredcites →https://doi.org/10.1109/lics.2005.28openalex-snapshot
Model Checking Vs. Generalized Model Checking: Semantic Minimizations for Temporal Logics
inferredcites →https://doi.org/10.1109/lics.2006.38openalex-snapshot
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
inferredcites →https://doi.org/10.1109/lics.2009.29openalex-snapshot
A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes
inferredcites →https://doi.org/10.1145/1133981.1134029openalex-snapshot
Termination proofs for systems code
inferredcites →https://doi.org/10.1145/1190215.1190257openalex-snapshot
Proving that programs eventually do something good
inferredcites →https://doi.org/10.1145/1190216.1190257openalex-snapshot
Proving that programs eventually do something good
inferredcites →https://doi.org/10.1145/1297658.1297659openalex-snapshot
A game-based framework for CTL counterexamples and 3-valued abstraction-refinement
inferredcites →https://doi.org/10.1145/1375581.1375602openalex-snapshot
Liquid types
inferredcites →https://doi.org/10.1145/1480881.1480933openalex-snapshot
Types and higher-order recursion schemes for verification of higher-order programs
inferredcites →https://doi.org/10.1145/1594834.1480933openalex-snapshot
Types and higher-order recursion schemes for verification of higher-order programs
inferredcites →https://doi.org/10.1145/1599410.1599445openalex-snapshot
Dependent type inference with interpolants
inferredcites →https://doi.org/10.1145/1706299.1706307openalex-snapshot
Compositional may-must program analysis
inferredcites →https://doi.org/10.1145/1706299.1706315openalex-snapshot
Dependent types from counterexamples
inferredcites →https://doi.org/10.1145/1707801.1706307openalex-snapshot
Compositional may-must program analysis
inferredcites →https://doi.org/10.1145/1707801.1706315openalex-snapshot
Dependent types from counterexamples
inferredcites →https://doi.org/10.1145/1890028.1890031openalex-snapshot
Refinement types for secure implementations
inferredcites →https://doi.org/10.1145/1925844.1926453openalex-snapshot
Verifying higher-order functional programs with pattern-matching algebraic data types
inferredcites →https://doi.org/10.1145/1926385.1926453openalex-snapshot
Verifying higher-order functional programs with pattern-matching algebraic data types
inferredcites →https://doi.org/10.1145/1993316.1993525openalex-snapshot
Predicate abstraction and CEGAR for higher-order model checking
inferredcites →https://doi.org/10.1145/1993498.1993525openalex-snapshot
Predicate abstraction and CEGAR for higher-order model checking
inferredcites →https://doi.org/10.1145/2034574.2034811openalex-snapshot
Secure distributed programming with value-dependent types
inferredcites →https://doi.org/10.1145/2034773.2034811openalex-snapshot
Secure distributed programming with value-dependent types
inferredcites →https://doi.org/10.1145/2429069.2429081openalex-snapshot
Automating relatively complete verification of higher-order functional programs
inferredcites →https://doi.org/10.1145/2491956.2491969openalex-snapshot
Reasoning about nondeterminism in programs
inferredcites →https://doi.org/10.1145/2603088.2603138openalex-snapshot
Local temporal reasoning
inferredcites →https://doi.org/10.1145/2628136.2628161openalex-snapshot
Refinement types for Haskell
inferredcites →https://doi.org/10.1145/2784731.2784766openalex-snapshot
Learning refinement types
inferredcites →https://doi.org/10.1145/2837614.2837655openalex-snapshot
Dependent types and multi-monadic effects in F*
inferredcites →https://doi.org/10.1145/2837614.2837667openalex-snapshot
Temporal verification of higher-order functional programs
inferredcites →https://doi.org/10.1145/3158100openalex-snapshot
Relatively complete refinement type system for verification of higher-order non-deterministic programs
inferredcites →https://doi.org/10.1145/73560openalex-snapshot
Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '88
inferredcites →https://doi.org/10.4230/lipics.csl.2011.470openalex-snapshot
Relative Completeness for Logics of Functional Programs

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-65474-0_7openalex-snapshot
Predicate Abstraction and CEGAR for $$\nu \mathrm {HFL}_\mathbb {Z}$$ Validity Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-71995-1_21openalex-snapshot
A General Semantic Construction of Dependent Refinement Type Systems, Categorically
inferred← citeshttps://doi.org/10.1007/978-3-030-72019-3_20openalex-snapshot
Temporal Refinements for Guarded Recursive Types
inferred← citeshttps://doi.org/10.1007/978-3-031-99536-1_11openalex-snapshot
Infinitary Refinement Types for Temporal Properties in Scott Domains
inferred← citeshttps://doi.org/10.1007/978-3-032-22720-1_15openalex-snapshot
A Category-Theoretic Framework for Dependent Effect Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-96145-3_6openalex-snapshot
Propositional Dynamic Logic for Higher-Order Functional Programs
inferred← citeshttps://doi.org/10.1017/s0960129522000330openalex-snapshot
Weakest preconditions in fibrations
inferred← citeshttps://doi.org/10.1109/lics.2019.8785674openalex-snapshot
Lambda Y-Calculus With Priorities
inferred← citeshttps://doi.org/10.1145/3209108.3209204openalex-snapshot
A Fixpoint Logic and Dependent Effects for Temporal Property Verification
inferred← citeshttps://doi.org/10.1145/3236950.3236964openalex-snapshot
Nondeterministic Manifest Contracts
inferred← citeshttps://doi.org/10.1145/3373718.3394766openalex-snapshot
On Computability of Logical Approaches to Branching-Time Property Verification of Programs
inferred← citeshttps://doi.org/10.1145/3632909openalex-snapshot
Ill-Typed Programs Don’t Evaluate
inferred← citeshttps://doi.org/10.1145/3633280openalex-snapshot
Answer Refinement Modification: Refinement Type System for Algebraic Effects and Handlers
inferred← citeshttps://doi.org/10.1145/3704914openalex-snapshot
Algebraic Temporal Effects: Temporal Verification of Recursively Typed Higher-Order Programs
inferred← citeshttps://doi.org/10.1145/3729320openalex-snapshot
Verifying Solutions to Semantics-Guided Synthesis Problems
inferred← citeshttps://doi.org/10.1145/3729333openalex-snapshot
Thrust: A Prophecy-Based Refinement Type System for Rust
inferred← citeshttps://doi.org/10.1145/3776724openalex-snapshot
A Complementary Approach to Incorrectness Typing
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25cbaopenalex-snapshot
A General Semantic Construction of Dependent Refinement Type Systems, Categorically
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25d14openalex-snapshot
Temporal Refinements for Guarded Recursive Types
showing the first 19 of 20 · page through all 20
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.