On the public citation graph

On continuation-passing transformations and expected cost analysis

https://doi.org/10.1145/3473592
0 signed · 94 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/11526841_9openalex-snapshot
Compositional Specification and Analysis of Cost-Based Properties in Probabilistic Programs
inferredcites →https://doi.org/10.1007/3-540-08921-7_92openalex-snapshot
Probabilistic LCF
inferredcites →https://doi.org/10.1007/3-540-47764-0_7openalex-snapshot
An Abstract Analysis of the Probabilistic Termination of Programs
inferredcites →https://doi.org/10.1007/978-3-030-01090-4_28openalex-snapshot
Ranking and Repulsing Supermartingales for Reachability in Probabilistic Programs
inferredcites →https://doi.org/10.1007/978-3-319-10936-7_6openalex-snapshot
Expectation Invariants for Probabilistic Program Loops as Fixed Points
inferredcites →https://doi.org/10.1007/978-3-319-29604-3_5openalex-snapshot
Probabilistic Inference by Program Transformation in Hakaru (System Description)
inferredcites →https://doi.org/10.1007/978-3-319-41528-4_1openalex-snapshot
Termination Analysis of Probabilistic Programs Through Positivstellensatz’s
inferredcites →https://doi.org/10.1007/978-3-319-41528-4_4openalex-snapshot
PSI: Exact Symbolic Inference for Probabilistic Programs
inferredcites →https://doi.org/10.1007/978-3-319-63387-9_6openalex-snapshot
Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds
inferredcites →https://doi.org/10.1007/978-3-540-32033-3_24openalex-snapshot
Proving Positive Almost-Sure Termination
inferredcites →https://doi.org/10.1007/978-3-642-15769-1_24openalex-snapshot
Linear-Invariant Generation for Probabilistic Programs:
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-39799-8_34openalex-snapshot
Probabilistic Program Analysis with Martingales
inferredcites →https://doi.org/10.1007/978-3-662-48057-1_24openalex-snapshot
On the Hardness of Almost–Sure Termination
inferredcites →https://doi.org/10.1007/978-981-15-2059-4_8openalex-snapshot
Randomized Algorithms
inferredcites →https://doi.org/10.1007/s10458-018-9383-2openalex-snapshot
Spice: a cognitive agent framework for computational crowd simulations in complex environments
inferredcites →https://doi.org/10.1016/0022-0000(81)90036-2openalex-snapshot
Semantics of probabilistic programs
inferredcites →https://doi.org/10.1016/0022-0000(84)90070-9openalex-snapshot
Probabilistic encryption
inferredcites →https://doi.org/10.1016/0022-0000(85)90012-1openalex-snapshot
A probabilistic PDL
inferredcites →https://doi.org/10.1016/0167-6423(87)90029-3openalex-snapshot
A hoare-like proof system for analysing the computation time of programs
inferredcites →https://doi.org/10.1016/0304-3975(75)90017-1openalex-snapshot
Call-by-name, call-by-value and the λ-calculus
inferredcites →https://doi.org/10.1016/j.jcss.2014.06.005openalex-snapshot
Runtime analysis of probabilistic programs with unbounded recursion
inferredcites →https://doi.org/10.1016/j.scico.2019.102338openalex-snapshot
On probabilistic term rewriting
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/s0019-9958(63)90290-0openalex-snapshot
Probabilistic automata
inferredcites →https://doi.org/10.1016/s0304-3975(02)00733-8openalex-snapshot
A first-order one-pass CPS transformation
inferredcites →https://doi.org/10.1016/s1571-0661(05)80216-6openalex-snapshot
The Troublesome Probabilistic Powerdomain
inferredcites →https://doi.org/10.1017/cbo9780511609619openalex-snapshot
Compiling with Continuations
inferredcites →https://doi.org/10.1017/s0960129500001535openalex-snapshot
Representing Control: a Study of the CPS Transformation
inferredcites →https://doi.org/10.1017/s0960129502003833openalex-snapshot
Intersection types and λ-definability
inferredcites →https://doi.org/10.1051/ita/2012012openalex-snapshot
Probabilistic operational semantics for the lambda calculus
inferredcites →https://doi.org/10.1090/s0002-9939-1969-0249221-4openalex-snapshot
Probabilistic Turing Machines and Computability
inferredcites →https://doi.org/10.1109/lics.2005.39openalex-snapshot
Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances
inferredcites →https://doi.org/10.1109/lics.2017.8005137openalex-snapshot
A convenient category for higher-order probability theory
inferredcites →https://doi.org/10.1109/lics.2017.8005153openalex-snapshot
A weakest pre-expectation semantics for mixed-sign expectations
inferredcites →https://doi.org/10.1109/lics.2019.8785725openalex-snapshot
Type-Based Complexity Analysis of Probabilistic Functional Programs
inferredcites →https://doi.org/10.1109/lics.2019.8785809openalex-snapshot
A Probabilistic and Non-Deterministic Call-by-Push-Value Language
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.1480894openalex-snapshot
Formal certification of code-based cryptographic proofs
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/1707801.1706327openalex-snapshot
Static determination of quantitative resource usage for higher-order programs
inferredcites →https://doi.org/10.1145/174675.178047openalex-snapshot
Representing monads
inferredcites →https://doi.org/10.1145/2535838.2535865openalex-snapshot
Probabilistic coherence spaces are fully abstract for probabilistic PCF
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/2933575.2934574openalex-snapshot
The Probabilistic Model Checking Landscape
inferredcites →https://doi.org/10.1145/2933575.2935317openalex-snapshot
Reasoning about Recursive Probabilistic Programs
inferredcites →https://doi.org/10.1145/3009837.3009873openalex-snapshot
Stochastic invariants for probabilistic termination
inferredcites →https://doi.org/10.1145/3064899.3064910openalex-snapshot
Design and Implementation of Probabilistic Programming Language Anglican
inferredcites →https://doi.org/10.1145/3110265openalex-snapshot
A relational logic for higher-order programs
inferredcites →https://doi.org/10.1145/3158121openalex-snapshot
A new proof rule for almost-sure termination
inferredcites →https://doi.org/10.1145/3158122openalex-snapshot
Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs
inferredcites →https://doi.org/10.1145/3158124openalex-snapshot
Monadic refinements for relational cost analysis
inferredcites →https://doi.org/10.1145/3158148openalex-snapshot
Denotational validation of higher-order Bayesian inference
inferredcites →https://doi.org/10.1145/3164540openalex-snapshot
Full Abstraction for Probabilistic PCF
inferredcites →https://doi.org/10.1145/3192366.3192394openalex-snapshot
Bounded expectations: resource analysis for probabilistic programs
inferredcites →https://doi.org/10.1145/3192366.3192408openalex-snapshot
PMAF: an algebraic framework for static analysis of probabilistic programs
inferredcites →https://doi.org/10.1145/3208102openalex-snapshot
Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms
inferredcites →https://doi.org/10.1145/3293605openalex-snapshot
Probabilistic Termination by Monadic Affine Sized Typing
inferredcites →https://doi.org/10.1145/3296979.3192408openalex-snapshot
PMAF: an algebraic framework for static analysis of probabilistic programs
inferredcites →https://doi.org/10.1145/3314221.3314581openalex-snapshot
Cost analysis of nondeterministic probabilistic programs
inferredcites →https://doi.org/10.1145/3408979openalex-snapshot
Denotational recurrence extraction for amortized analysis
inferredcites →https://doi.org/10.1145/3408992openalex-snapshot
Raising expectations: automating expected cost analysis with types
inferredcites →https://doi.org/10.1145/3428240openalex-snapshot
A modular cost analysis for probabilistic programs
inferredcites →https://doi.org/10.1145/3434313openalex-snapshot
Intersection types and (positive) almost-sure termination
inferredcites →https://doi.org/10.1145/3434320openalex-snapshot
Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning
inferredcites →https://doi.org/10.1145/361002.361016openalex-snapshot
Mechanical program analysis
inferredcites →https://doi.org/10.1145/503272.503288openalex-snapshot
Stochastic lambda calculus and monads of probability distributions
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation
inferredcites →https://doi.org/10.1145/565816.503288openalex-snapshot
Stochastic lambda calculus and monads of probability distributions
inferredcites →https://doi.org/10.1145/800119.803889openalex-snapshot
Computational complexity of probabilistic Turing machines
inferredcites →https://doi.org/10.1145/99370.99381openalex-snapshot
Automatic complexity analysis
inferredcites →https://doi.org/10.1515/9781400882618-010openalex-snapshot
Computability by Probabilistic Machines
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.1709.04037openalex-snapshot
Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs
inferredcites →https://doi.org/10.5555/3329995.3330088openalex-snapshot
A weakest pre-expectation semantics for mixed-sign expectations
inferredcites →https://doi.org/10.7551/mitpress/3054.001.0001openalex-snapshot
The Formal Semantics of Programming Languages

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-031-13188-2_4openalex-snapshot
Automated Expected Amortised Cost Analysis of Probabilistic Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8openalex-snapshot
Programming Languages and Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8_2openalex-snapshot
On the Hardness of Analyzing Quantum Programs Quantitatively
inferred← citeshttps://doi.org/10.1007/978-3-032-04167-8_11openalex-snapshot
Weighted Rewriting
inferred← citeshttps://doi.org/10.1145/3531130.3533332openalex-snapshot
Quantum Expectation Transformers for Cost Analysis
inferred← citeshttps://doi.org/10.1145/3547643openalex-snapshot
Safe couplings: coupled refinement types
inferred← citeshttps://doi.org/10.1145/3551357.3551374openalex-snapshot
Contextual Equivalence in a Probabilistic Call-by-Need Lambda-Calculus
inferred← citeshttps://doi.org/10.1145/3591263openalex-snapshot
Automated Expected Value Analysis of Recursive Programs
inferred← citeshttps://doi.org/10.1145/3649839openalex-snapshot
Hopping Proofs of Expectation-Based Properties: Applications to Skiplists and Security Proofs
inferred← citeshttps://doi.org/10.1145/3656448openalex-snapshot
Compiling Probabilistic Programs for Variable Elimination with Information Flow
inferred← citeshttps://doi.org/10.1145/3674632openalex-snapshot
Almost-Sure Termination by Guarded Refinement
inferred← citeshttps://doi.org/10.1145/3674662openalex-snapshot
Automated Verification of Higher-Order Probabilistic Programs via a Dependent Refinement Type System
inferred← citeshttps://doi.org/10.1145/3689725openalex-snapshot
A Modal Type Theory of Expected Cost in Higher-Order Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3689753openalex-snapshot
Tachis: Higher-Order Separation Logic with Credits for Expected Costs
inferred← citeshttps://doi.org/10.1145/3720424openalex-snapshot
Denotational Foundations for Expected Cost Analysis
inferred← citeshttps://doi.org/10.1145/3828674openalex-snapshot
Adequacy for Predicate Transformer Semantics
inferred← citeshttps://doi.org/10.1145/3830439.3831276openalex-snapshot
A Cost-Aware Probability Monad for Liquid Haskell
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.