On the public citation graph

TiML: a functional language for practical complexity analysis with invariants

https://doi.org/10.1145/3133903
0 signed · 103 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/3-540-68697-5_9openalex-snapshot
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
inferredcites →https://doi.org/10.1007/978-3-319-08867-9_51openalex-snapshot
Symbolic Resource Bound Inference for Functional Programs
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-29604-3_10openalex-snapshot
A Coq Library for Internal Verification of Running-Times
inferredcites →https://doi.org/10.1007/978-3-540-27861-0_6openalex-snapshot
Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs
inferredcites →https://doi.org/10.1007/978-3-540-69166-2_15openalex-snapshot
Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
inferredcites →https://doi.org/10.1007/978-3-540-70545-1_35openalex-snapshot
A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis
inferredcites →https://doi.org/10.1007/978-3-540-71316-6_12openalex-snapshot
Cost Analysis of Java Bytecode
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-540-92188-2_5openalex-snapshot
COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode
inferredcites →https://doi.org/10.1007/978-3-642-11957-6_16openalex-snapshot
Amortized Resource Analysis with Polynomial Potential
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-17511-4_20openalex-snapshot
Dafny: An Automatic Program Verifier for Functional Correctness
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_13openalex-snapshot
Abstract Refinement Types
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-46669-8_17openalex-snapshot
Refinement Types for Incremental Computational Complexity
inferredcites →https://doi.org/10.1007/978-3-662-46669-8_6openalex-snapshot
Automatic Static Cost Analysis for Parallel Programs
inferredcites →https://doi.org/10.1016/j.tcs.2003.10.022openalex-snapshot
Automated higher-order complexity analysis
inferredcites →https://doi.org/10.1016/j.tcs.2007.09.003openalex-snapshot
A program logic for resources
inferredcites →https://doi.org/10.1017/cbo9780511530104openalex-snapshot
Purely Functional Data Structures
inferredcites →https://doi.org/10.1017/s0956796800003865openalex-snapshot
Automated complexity analysis of Nuprl extracted programs
inferredcites →https://doi.org/10.1017/s0956796897002876openalex-snapshot
Three algorithms on Braun trees
inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1137/0606031openalex-snapshot
Amortized Computational Complexity
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/1375581.1375602openalex-snapshot
Liquid types
inferredcites →https://doi.org/10.1145/1480881.1480898openalex-snapshot
SPEED
inferredcites →https://doi.org/10.1145/1542431.1542450openalex-snapshot
Live heap space analysis for languages with garbage collection
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/182409.182439openalex-snapshot
Static dependent costs for estimating execution time
inferredcites →https://doi.org/10.1145/1925844.1926425openalex-snapshot
Geometry of synthesis III
inferredcites →https://doi.org/10.1145/1925844.1926427openalex-snapshot
Multivariate amortized resource analysis
inferredcites →https://doi.org/10.1145/1926385.1926425openalex-snapshot
Geometry of synthesis III
inferredcites →https://doi.org/10.1145/1926385.1926427openalex-snapshot
Multivariate amortized resource analysis
inferredcites →https://doi.org/10.1145/237721.240882openalex-snapshot
Proving the correctness of reactive systems using sized types
inferredcites →https://doi.org/10.1145/2429069.2429090openalex-snapshot
The geometry of types
inferredcites →https://doi.org/10.1145/2491956.2491978openalex-snapshot
Verifying higher-order programs with the dijkstra monad
inferredcites →https://doi.org/10.1145/263699.263712openalex-snapshot
Proof-carrying code
inferredcites →https://doi.org/10.1145/277650.277732openalex-snapshot
Eliminating array bound checking through dependent types
inferredcites →https://doi.org/10.1145/2784731.2784745openalex-snapshot
Bounded refinement types
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.2837646openalex-snapshot
The complexity of interaction
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/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.3009864openalex-snapshot
Complexity verification using guided theorem enumeration
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/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/604131.604148openalex-snapshot
Static prediction of heap space usage for first-order functional programs
inferredcites →https://doi.org/10.1184/r1/6609977openalex-snapshot
Structure and Efficiency of Computer 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-45231-5_19openalex-snapshot
Exponential Automatic Amortized Resource Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-65474-0_1openalex-snapshot
Static Resource Analysis at Scale (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-030-68446-4_2openalex-snapshot
Runtime Complexity Analysis of Logically Constrained Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-030-72019-3_11openalex-snapshot
For a Few Dollars More
inferred← citeshttps://doi.org/10.1007/978-3-030-81685-8_37openalex-snapshot
Synthesis with Asymptotic Resource Bounds
inferred← citeshttps://doi.org/10.1007/978-3-030-81688-9_5openalex-snapshot
ATLAS: Automated Amortised Complexity Analysis of Self-adjusting Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-01807-7_3openalex-snapshot
The Next 700 Smart Contract Languages
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-032-22720-1_17openalex-snapshot
The Memorist Tale: Every Thunk Every Cost All At Once
inferred← citeshttps://doi.org/10.1007/978-3-032-22723-2_13openalex-snapshot
Dependently-Typed AARA: A Non-Affine Approach for Resource Analysis of Higher-Order Programs
inferred← citeshttps://doi.org/10.1007/978-3-032-24839-8_3openalex-snapshot
LLM-Guided Fuzzing for Pathological Input Generation
inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_19openalex-snapshot
A Fistful of Dollars: Formalizing Asymptotic Complexity Claims via Deductive Program Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-94205-6_35openalex-snapshot
Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle
inferred← citeshttps://doi.org/10.1016/j.cola.2022.101103openalex-snapshot
On the cost semantics for spreadsheets with sheet-defined functions
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/s0960129521000232openalex-snapshot
Type-based analysis of logarithmic amortised complexity
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175720openalex-snapshot
Automatic Amortized Resource Analysis with Regular Recursive Types
inferred← citeshttps://doi.org/10.1109/mc.2019.2913138openalex-snapshot
Security of Cyberphysical Systems: Chaining Induction and Deduction
inferred← citeshttps://doi.org/10.1145/3158124openalex-snapshot
Monadic refinements for relational cost analysis
inferred← citeshttps://doi.org/10.1145/3183713.3199671openalex-snapshot
The Data Calculator
inferred← citeshttps://doi.org/10.1145/3290326openalex-snapshot
Type-guided worst-case input generation
inferred← citeshttps://doi.org/10.1145/3341687openalex-snapshot
Closure conversion is safe for space
inferred← citeshttps://doi.org/10.1145/3341696openalex-snapshot
Relational cost analysis for functional-imperative programs
inferred← citeshttps://doi.org/10.1145/3371092openalex-snapshot
Liquidate your assets: reasoning about resource usage in liquid Haskell
inferred← citeshttps://doi.org/10.1145/3408979openalex-snapshot
Denotational recurrence extraction for amortized analysis
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/3416507.3423189openalex-snapshot
Using dynamically inferred invariants to analyze program runtime complexity
inferred← citeshttps://doi.org/10.1145/3426428.3426916openalex-snapshot
Demystifying dependence
inferred← citeshttps://doi.org/10.1145/3428257openalex-snapshot
DynamiTe: dynamic termination and non-termination proofs
inferred← citeshttps://doi.org/10.1145/3428272openalex-snapshot
Do you have space for dessert? a verified space cost semantics for CakeML programs
inferred← citeshttps://doi.org/10.1145/3473581openalex-snapshot
Automatic amortized resource analysis with the Quantum physicist’s method
inferred← citeshttps://doi.org/10.1145/3473585openalex-snapshot
Reasoning about the garden of forking paths
inferred← citeshttps://doi.org/10.1145/3485515openalex-snapshot
Dynaplex: analyzing program complexity using dynamically inferred recurrence relations
inferred← citeshttps://doi.org/10.1145/3486169openalex-snapshot
For a Few Dollars More: Verified Fine-Grained Algorithm Analysis Down to LLVM
inferred← citeshttps://doi.org/10.1145/3498670openalex-snapshot
A cost-aware logical framework
inferred← citeshttps://doi.org/10.1145/3544885.3544887openalex-snapshot
A flat reachability-based measure for CakeML’s cost semantics
inferred← citeshttps://doi.org/10.1145/3579990.3580016openalex-snapshot
Fine-Tuning Data Structures for Query Processing
inferred← citeshttps://doi.org/10.1145/3610408openalex-snapshot
Focusing on Refinement Typing
inferred← citeshttps://doi.org/10.1145/3611643.3617853openalex-snapshot
Inferring Complexity Bounds from Recurrence Relations
inferred← citeshttps://doi.org/10.1145/3720424openalex-snapshot
Denotational Foundations for Expected Cost Analysis
inferred← citeshttps://doi.org/10.1145/3720492openalex-snapshot
Automatic Linear Resource Bound Analysis for Rust via Prophecy Potentials
inferred← citeshttps://doi.org/10.1145/3763798openalex-snapshot
Integrating Resource Analyses via Resource Decomposition
inferred← citeshttps://doi.org/10.1145/3779031.3779088openalex-snapshot
Foundational Verification of Running-Time Bounds for Interactive Programs
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25d21openalex-snapshot
For a Few Dollars More -- Verified Fine-Grained Algorithm Analysis Down to LLVM
inferred← citeshttps://doi.org/10.29007/xkwxopenalex-snapshot
Automatic Space Bound Analysis for Functional Programs with Garbage Collection
inferred← citeshttps://doi.org/10.48550/arxiv.1808.02066openalex-snapshot
The Internals of the Data Calculator
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.