On the public citation graph

Relational cost analysis for functional-imperative programs

https://doi.org/10.1145/3341696
0 signed · 65 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-48092-7_6openalex-snapshot
Type and Effect Systems
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-22102-1_9openalex-snapshot
Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation
inferredcites →https://doi.org/10.1007/978-3-319-63390-9_30openalex-snapshot
Automating Induction for Solving Horn Clauses
inferredcites →https://doi.org/10.1007/978-3-642-11957-6_6openalex-snapshot
Amortised Resource Analysis with Separation Logic
inferredcites →https://doi.org/10.1007/978-3-642-31424-7_64openalex-snapshot
Resource Aware ML
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_8openalex-snapshot
Why3 — Where Programs Meet Provers
inferredcites →https://doi.org/10.1007/978-3-642-54862-8_10openalex-snapshot
Alternating Runtime and Size Complexity Analysis of Integer Programs
inferredcites →https://doi.org/10.1007/978-3-662-03811-6_5openalex-snapshot
Type and Effect Systems
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.1017/s0956796808006953openalex-snapshot
Hoare type theory, polymorphism and separation
inferredcites →https://doi.org/10.1017/s0956796811000165openalex-snapshot
Non-parametric parametricity
inferredcites →https://doi.org/10.1090/s0025-5718-1965-0178586-1openalex-snapshot
An Algorithm for the Machine Calculation of Complex Fourier Series
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.1480925openalex-snapshot
State-dependent representation independence
inferredcites →https://doi.org/10.1145/1631687.1596572openalex-snapshot
Non-parametric parametricity
inferredcites →https://doi.org/10.1145/182409.182439openalex-snapshot
Static dependent costs for estimating execution time
inferredcites →https://doi.org/10.1145/182590.182439openalex-snapshot
Static dependent costs for estimating execution time
inferredcites →https://doi.org/10.1145/1882362.1882405openalex-snapshot
Differential static analysis
inferredcites →https://doi.org/10.1145/1926385.1926427openalex-snapshot
Multivariate amortized resource analysis
inferredcites →https://doi.org/10.1145/2362389.2362393openalex-snapshot
Multivariate amortized resource analysis
inferredcites →https://doi.org/10.1145/2429069.2429111openalex-snapshot
Logical relations for fine-grained concurrency
inferredcites →https://doi.org/10.1145/2429069.2429113openalex-snapshot
Linear dependent types for differential privacy
inferredcites →https://doi.org/10.1145/2480359.2429111openalex-snapshot
Logical relations for fine-grained concurrency
inferredcites →https://doi.org/10.1145/2480359.2429113openalex-snapshot
Linear dependent types for differential privacy
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/2535838.2535869openalex-snapshot
Abstract effects and proof-relevant logical relations
inferredcites →https://doi.org/10.1145/2578855.2535869openalex-snapshot
Abstract effects and proof-relevant logical relations
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/2694344.2694372openalex-snapshot
A Hardware Design Language for Timing-Sensitive Information-Flow Security
inferredcites →https://doi.org/10.1145/2737924.2737955openalex-snapshot
Compositional certified resource bounds
inferredcites →https://doi.org/10.1145/2775051.2677000openalex-snapshot
Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy
inferredcites →https://doi.org/10.1145/2775054.2694372openalex-snapshot
A Hardware Design Language for Timing-Sensitive Information-Flow Security
inferredcites →https://doi.org/10.1145/292540.292560openalex-snapshot
Dependent types in practical programming
inferredcites →https://doi.org/10.1145/2951913.2951950openalex-snapshot
A type theory for incremental computational complexity with control flow changes
inferredcites →https://doi.org/10.1145/2967973.2968602openalex-snapshot
Effect-dependent transformations for concurrent programs
inferredcites →https://doi.org/10.1145/3009837.3009858openalex-snapshot
Relational cost analysis
inferredcites →https://doi.org/10.1145/3022670.2951950openalex-snapshot
A type theory for incremental computational complexity with control flow changes
inferredcites →https://doi.org/10.1145/3093333.3009858openalex-snapshot
Relational cost analysis
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/3158124openalex-snapshot
Monadic refinements for relational cost analysis
inferredcites →https://doi.org/10.1145/3314221.3314603openalex-snapshot
Bidirectional type checking for relational properties
inferredcites →https://doi.org/10.1145/345099.345100openalex-snapshot
Local type inference
inferredcites →https://doi.org/10.1145/504709.504712openalex-snapshot
An indexed model of recursive types for foundational proof-carrying code
inferredcites →https://doi.org/10.1145/507635.507666openalex-snapshot
Cost recurrences for DML programs
inferredcites →https://doi.org/10.1145/507663.507666openalex-snapshot
Cost recurrences for DML programs
inferredcites →https://doi.org/10.1145/964001.964003openalex-snapshot
Simple relational correctness proofs for static analyses and program transformations
inferredcites →https://doi.org/10.1145/982962.964003openalex-snapshot
Simple relational correctness proofs for static analyses and program transformations
inferredcites →https://doi.org/10.4230/lipics.fscd.2017.26openalex-snapshot
Arrays and References in Resource Aware ML
inferredcites →https://doi.org/10.48550/arxiv.1104.0193openalex-snapshot
Linear Dependent Types and Relative Completeness

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_2openalex-snapshot
Cost Analysis of Smart Contracts Via Parametric Resource Analysis
inferred← citeshttps://doi.org/10.1007/978-3-031-86637-1_38openalex-snapshot
A Static Over-Approximate Detection Tool for At-Risk DLLs
inferred← citeshttps://doi.org/10.1007/s10817-023-09692-0openalex-snapshot
Schematic Program Proofs with Abstract Execution
inferred← citeshttps://doi.org/10.1109/ccci61916.2024.10736454openalex-snapshot
Penetration Testing Operating Systems: Exploiting Vulnerabilities
inferred← citeshttps://doi.org/10.1145/3371072openalex-snapshot
The next 700 relational program logics
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/3649824openalex-snapshot
Quantitative Bounds on Resource Usage of Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3776693openalex-snapshot
A Modular Static Cost Analysis for GPU Warp-Level Parallelism
inferred← citeshttps://doi.org/10.48550/arxiv.2001.04439openalex-snapshot
Session Types with Arithmetic Refinements and Their Application to Work Analysis
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.