On the public citation graph

Monadic refinements for relational cost analysis

https://doi.org/10.1145/3158124
0 signed · 85 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/978-3-319-08867-9_50openalex-snapshot
A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis
inferredcites →https://doi.org/10.1007/978-3-319-12736-1_15openalex-snapshot
Resource Analysis of Complex Programs with Cost Equations
inferredcites →https://doi.org/10.1007/978-3-319-89884-1_8openalex-snapshot
Relational Reasoning for Markov Chains in a Probabilistic Guarded Lambda Calculus
inferredcites →https://doi.org/10.1007/978-3-642-15769-1_8openalex-snapshot
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
inferredcites →https://doi.org/10.1007/978-3-642-23702-7_22openalex-snapshot
Bound Analysis of Imperative Programs with the Size-Change Abstraction
inferredcites →https://doi.org/10.1007/978-3-642-31424-7_64openalex-snapshot
Resource Aware ML
inferredcites →https://doi.org/10.1007/s10817-016-9398-9openalex-snapshot
Type-Based Cost Analysis for Lazy Functional Languages
inferredcites →https://doi.org/10.1007/s10817-016-9402-4openalex-snapshot
Complexity and Resource Bound Analysis of Imperative Programs Using Difference Constraints
inferredcites →https://doi.org/10.1016/j.scico.2005.02.006openalex-snapshot
Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
inferredcites →https://doi.org/10.1016/j.tcs.2011.02.007openalex-snapshot
Quasi-interpretations a way to control resources
inferredcites →https://doi.org/10.1016/j.tcs.2011.07.009openalex-snapshot
Cost analysis of object-oriented bytecode programs
inferredcites →https://doi.org/10.1016/s0049-237x(98)x8028-6openalex-snapshot
Categorical logic and type theory
inferredcites →https://doi.org/10.1017/s0956796808006953openalex-snapshot
Hoare type theory, polymorphism and separation
inferredcites →https://doi.org/10.1017/s0960129501003322openalex-snapshot
A judgmental reconstruction of modal logic
inferredcites →https://doi.org/10.1109/lics.2011.22openalex-snapshot
Linear Dependent Types and Relative Completeness
inferredcites →https://doi.org/10.1109/sp.2017.53openalex-snapshot
Verifying and Synthesizing Constant-Resource Implementations with Types
inferredcites →https://doi.org/10.1145/1328438.1328457openalex-snapshot
Lightweight semiformal time complexity analysis for purely functional data structures
inferredcites →https://doi.org/10.1145/1480881.1480898openalex-snapshot
SPEED
inferredcites →https://doi.org/10.1145/1594834.1480898openalex-snapshot
SPEED
inferredcites →https://doi.org/10.1145/1706299.1706327openalex-snapshot
Static determination of quantitative resource usage for higher-order programs
inferredcites →https://doi.org/10.1145/1806596.1806630openalex-snapshot
The reachability-bound problem
inferredcites →https://doi.org/10.1145/2429069.2429090openalex-snapshot
The geometry of types
inferredcites →https://doi.org/10.1145/2491522.2491523openalex-snapshot
Dependent Type Theory for Verification of Information Flow and Access Control Policies
inferredcites →https://doi.org/10.1145/2535838.2535847openalex-snapshot
Probabilistic relational verification for cryptographic implementations
inferredcites →https://doi.org/10.1145/2676726.2677000openalex-snapshot
Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy
inferredcites →https://doi.org/10.1145/2737924.2737955openalex-snapshot
Compositional certified resource bounds
inferredcites →https://doi.org/10.1145/2784731.2784749openalex-snapshot
Denotational cost semantics for functional languages with inductive types
inferredcites →https://doi.org/10.1145/2784731.2784753openalex-snapshot
Analysing the complexity of functional programs: higher-order meets first-order
inferredcites →https://doi.org/10.1145/2837614.2837655openalex-snapshot
Dependent types and multi-monadic effects in F*
inferredcites →https://doi.org/10.1145/2866575openalex-snapshot
Analyzing Runtime and Size Complexity of Integer Programs
inferredcites →https://doi.org/10.1145/292540.292560openalex-snapshot
Dependent types in practical programming
inferredcites →https://doi.org/10.1145/3009837.3009842openalex-snapshot
Towards automatic resource bound analysis for OCaml
inferredcites →https://doi.org/10.1145/3009837.3009858openalex-snapshot
Relational cost analysis
inferredcites →https://doi.org/10.1145/3009837.3009874openalex-snapshot
Contract-based resource verification for higher-order functions with memoization
inferredcites →https://doi.org/10.1145/3110265openalex-snapshot
A relational logic for higher-order programs
inferredcites →https://doi.org/10.1145/3110287openalex-snapshot
Automating sized-type inference for complexity analysis
inferredcites →https://doi.org/10.1145/3133903openalex-snapshot
TiML: a functional language for practical complexity analysis with invariants
inferredcites →https://doi.org/10.1145/325694.325716openalex-snapshot
Resource bound certification
inferredcites →https://doi.org/10.1145/507635.507666openalex-snapshot
Cost recurrences for DML programs
inferredcites →https://doi.org/10.1145/601775.601776openalex-snapshot
The marriage of effects and monads
inferredcites →https://doi.org/10.1145/604131.604148openalex-snapshot
Static prediction of heap space usage for first-order functional programs
inferredcites →https://doi.org/10.1145/93542.93564openalex-snapshot
Task granularity analysis in logic programs
inferredcites →https://doi.org/10.2168/lmcs-12(3:7)2016openalex-snapshot
The Guarded Lambda-Calculus: Programming and Reasoning with Guarded Recursion for Coinductive Types
inferredcites →https://doi.org/10.2168/lmcs-7(2:17)2011openalex-snapshot
Amortised Resource Analysis with Separation Logic
inferredcites →https://doi.org/10.48550/arxiv.1104.0193openalex-snapshot
Linear Dependent Types and Relative Completeness
inferredcites →https://doi.org/10.5282/edoc.13955openalex-snapshot
Types with potential: polynomial resource bounds via automatic amortized analysis

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-45231-5_19openalex-snapshot
Exponential Automatic Amortized Resource Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-71500-7_2openalex-snapshot
Certified Abstract Cost Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-83128-8_10openalex-snapshot
Ever Change a Running System: Structured Software Reengineering Using Automatically Proven-Correct Transformation Rules
inferred← citeshttps://doi.org/10.1007/978-3-031-24841-2_4openalex-snapshot
Execution Time Program Verification with Tight Bounds
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-981-97-8943-6_14openalex-snapshot
OBRA: Oracle-Based, Relational, Algorithmic Type Verification
inferred← citeshttps://doi.org/10.1007/s10817-023-09692-0openalex-snapshot
Schematic Program Proofs with Abstract Execution
inferred← citeshttps://doi.org/10.1016/j.jlamp.2023.100894openalex-snapshot
Operationally-based program equivalence proofs using LCTRSs
inferred← citeshttps://doi.org/10.1017/s0956796821000071openalex-snapshot
Relational cost analysis in a functional-imperative setting
inferred← citeshttps://doi.org/10.1017/s095679682200003xopenalex-snapshot
Denotational semantics as a foundation for cost recurrence extraction for functional languages
inferred← citeshttps://doi.org/10.1017/s0960129521000487openalex-snapshot
Two decades of automatic amortized resource analysis
inferred← citeshttps://doi.org/10.1017/s0960129523000245openalex-snapshot
Divergences on monads for relational program logics
inferred← citeshttps://doi.org/10.1109/csf51468.2021.00004openalex-snapshot
Resource-Aware Session Types for Digital Contracts
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175720openalex-snapshot
Automatic Amortized Resource Analysis with Regular Recursive Types
inferred← citeshttps://doi.org/10.1145/3290351openalex-snapshot
Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, Bayesian inference, and optimization
inferred← citeshttps://doi.org/10.1145/3314221.3314602openalex-snapshot
Resource-guided program synthesis
inferred← citeshttps://doi.org/10.1145/3341696openalex-snapshot
Relational cost analysis for functional-imperative programs
inferred← citeshttps://doi.org/10.1145/3371072openalex-snapshot
The next 700 relational program logics
inferred← citeshttps://doi.org/10.1145/3371092openalex-snapshot
Liquidate your assets: reasoning about resource usage in liquid Haskell
inferred← citeshttps://doi.org/10.1145/3408988openalex-snapshot
Liquid resource types
inferred← citeshttps://doi.org/10.1145/3408992openalex-snapshot
Raising expectations: automating expected cost analysis with types
inferred← citeshttps://doi.org/10.1145/3434306openalex-snapshot
Modeling and analyzing evaluation cost of CUDA kernels
inferred← citeshttps://doi.org/10.1145/3473581openalex-snapshot
Automatic amortized resource analysis with the Quantum physicist’s method
inferred← citeshttps://doi.org/10.1145/3473592openalex-snapshot
On continuation-passing transformations and expected cost analysis
inferred← citeshttps://doi.org/10.1145/3498680openalex-snapshot
Effectful program distancing
inferred← citeshttps://doi.org/10.1145/3519939.3523435openalex-snapshot
Differential cost analysis with simultaneous potentials and anti-potentials
inferred← citeshttps://doi.org/10.1145/3551497openalex-snapshot
A Relational Program Logic with Data Abstraction and Dynamic Framing
inferred← citeshttps://doi.org/10.1145/3589962openalex-snapshot
Mechanized Proofs of Adversarial Complexity and Application to Universal Composability
inferred← citeshttps://doi.org/10.1145/3632852openalex-snapshot
Decalf: A Directed, Effectful Cost-Aware Logical Framework
inferred← citeshttps://doi.org/10.1145/3639403openalex-snapshot
Modeling and Analyzing Evaluation Cost of CUDA Kernels
inferred← citeshttps://doi.org/10.1145/3649824openalex-snapshot
Quantitative Bounds on Resource Usage of Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3705298openalex-snapshot
Certified Cost Bounds for Abstract Programs
inferred← citeshttps://doi.org/10.1145/3776693openalex-snapshot
A Modular Static Cost Analysis for GPU Warp-Level Parallelism
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25d03openalex-snapshot
Certified Abstract Cost Analysis
inferred← citeshttps://doi.org/10.26226/morressier.604907f51a80aac83ca25d6copenalex-snapshot
Exponential Automatic Amortized Resource Analysis
inferred← citeshttps://doi.org/10.4230/lipics.csl.2021.34openalex-snapshot
Typable Fragments of Polynomial Automatic Amortized Resource Analysis
inferred← citeshttps://doi.org/10.46298/lmcs-17(3:9)2021openalex-snapshot
ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity
inferred← citeshttps://doi.org/10.48550/arxiv.2307.05938openalex-snapshot
Decalf: A Directed, Effectful Cost-Aware Logical Framework
inferred← citeshttps://doi.org/10.70675/adcfd403z5566z460dz9591zebb0e4f5a766openalex-snapshot
Principles of program verification for arbitrary monadic effects
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.