On the public citation graph
A modular cost analysis for probabilistic programs
0 signed · 128 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.
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.
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-45937-5_13openalex-snapshot
Modular Static Program Analysis
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/3-540-55719-9_74openalex-snapshot
Analytic analysis of algorithms
inferredcites →https://doi.org/10.1007/978-1-4612-4400-4openalex-snapshot
The Design and Analysis of Algorithms
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-030-17127-8_5openalex-snapshot
Tight Worst-Case Bounds for Polynomial Loop Programs
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-10936-7_6openalex-snapshot
Expectation Invariants for Probabilistic Program Loops as Fixed Points
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-319-66845-1_6openalex-snapshot
Complexity Analysis for Java with AProVE
inferredcites →https://doi.org/10.1007/978-3-319-73721-8_10openalex-snapshot
From Shapes to Amortized Complexity
inferredcites →https://doi.org/10.1007/978-3-319-90686-7_9openalex-snapshot
On Probabilistic Term Rewriting
inferredcites →https://doi.org/10.1007/978-3-540-24622-0_20openalex-snapshot
A Complete Method for the Synthesis of Linear Ranking Functions
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-540-71070-7_32openalex-snapshot
Automated Complexity Analysis Based on the Dependency Pair Method
inferredcites →https://doi.org/10.1007/978-3-540-72788-0_33openalex-snapshot
SAT Solving for Termination Analysis with Polynomial Interpretations
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-15769-1_8openalex-snapshot
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
inferredcites →https://doi.org/10.1007/978-3-642-22438-6_32openalex-snapshot
A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems
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-39799-8_34openalex-snapshot
Probabilistic Program Analysis with Martingales
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-48057-1_24openalex-snapshot
On the Hardness of Almost–Sure Termination
inferredcites →https://doi.org/10.1007/978-3-662-49498-1_15openalex-snapshot
Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs
inferredcites →https://doi.org/10.1007/978-3-662-49674-9_24openalex-snapshot
TcT: Tyrolean Complexity Tool
inferredcites →https://doi.org/10.1007/s10817-005-9022-xopenalex-snapshot
Mechanically Proving Termination Using Polynomial Interpretations
inferredcites →https://doi.org/10.1007/s10817-016-9388-yopenalex-snapshot
Analyzing Program Termination and Complexity Automatically with AProVE
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/0022-0000(81)90036-2openalex-snapshot
Semantics of probabilistic programs
inferredcites →https://doi.org/10.1016/0304-3975(89)90005-4openalex-snapshot
Complexity analysis of term-rewriting systems
inferredcites →https://doi.org/10.1016/b978-0-12-622760-4.x5000-6openalex-snapshot
Handbook of Analysis and Its Foundations
inferredcites →https://doi.org/10.1016/j.ic.2018.05.007openalex-snapshot
From Jinja bytecode to term rewriting: A complexity reflecting transformation
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/s0304-3975(00)00208-5openalex-snapshot
Partial correctness for probabilistic demonic programs
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.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/mc.2008.209openalex-snapshot
Amdahl's Law in the Multicore Era
inferredcites →https://doi.org/10.1109/mic.2004.1260710openalex-snapshot
Response-time analysis of composite web services
inferredcites →https://doi.org/10.1109/sp.2017.53openalex-snapshot
Verifying and Synthesizing Constant-Resource Implementations with Types
inferredcites →https://doi.org/10.1142/10875openalex-snapshot
An Introduction to the Analysis of Algorithms
inferredcites →https://doi.org/10.1142/s0129054112400588openalex-snapshot
ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS
inferredcites →https://doi.org/10.1145/1133255.1134026openalex-snapshot
Combining abstract interpreters
inferredcites →https://doi.org/10.1145/1133981.1134026openalex-snapshot
Combining abstract interpreters
inferredcites →https://doi.org/10.1145/1347375.1347389openalex-snapshot
The worst-case execution-time problem—overview of methods and survey of tools
inferredcites →https://doi.org/10.1145/1480881.1480894openalex-snapshot
Formal certification of code-based cryptographic proofs
inferredcites →https://doi.org/10.1145/1555746.1555752openalex-snapshot
A flow calculus ofmwp-bounds for complexity analysis
inferredcites →https://doi.org/10.1145/1809028.1806630openalex-snapshot
The reachability-bound problem
inferredcites →https://doi.org/10.1145/2500886openalex-snapshot
Computation takes time, but how much?
inferredcites →https://doi.org/10.1145/2813885.2737955openalex-snapshot
Compositional certified resource bounds
inferredcites →https://doi.org/10.1145/2866575openalex-snapshot
Analyzing Runtime and Size Complexity of Integer Programs
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.3009842openalex-snapshot
Towards automatic resource bound analysis for OCaml
inferredcites →https://doi.org/10.1145/3009837.3009873openalex-snapshot
Stochastic invariants for probabilistic termination
inferredcites →https://doi.org/10.1145/3093333.3009873openalex-snapshot
Stochastic invariants for probabilistic termination
inferredcites →https://doi.org/10.1145/3110287openalex-snapshot
Automating sized-type inference for complexity analysis
inferredcites →https://doi.org/10.1145/3158121openalex-snapshot
A new proof rule for almost-sure termination
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/3236950.3236968openalex-snapshot
On Intersection Types and Probabilistic Lambda Calculi
inferredcites →https://doi.org/10.1145/3296979.3192394openalex-snapshot
Bounded expectations: resource analysis for probabilistic programs
inferredcites →https://doi.org/10.1145/3314221.3314581openalex-snapshot
Cost analysis of nondeterministic probabilistic programs
inferredcites →https://doi.org/10.1145/3385412.3386002openalex-snapshot
Proving almost-sure termination by omega-regular decomposition
inferredcites →https://doi.org/10.1145/355616.361015openalex-snapshot
Two languages for estimating program efficiency
inferredcites →https://doi.org/10.2140/pjm.1988.132.35openalex-snapshot
Representing polynomials by positive linear functions on compact convex polyhedra
inferredcites →https://doi.org/10.2168/lmcs-7(3:4)2011openalex-snapshot
Monotonicity Constraints for Termination in the Integer Domain
inferredcites →https://doi.org/10.3233/com-150032openalex-snapshot
Mortality of iterated piecewise affine functions over the integers: Decidability and complexity
inferredcites →https://doi.org/10.48550/arxiv.1302.0973openalex-snapshot
A Combination Framework for Complexity
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.48550/arxiv.1711.03588openalex-snapshot
A New Proof Rule for Almost-Sure Termination
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.003.0004openalex-snapshot
Introduction to operational semantics
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-72016-2_14openalex-snapshot
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
inferred← citeshttps://doi.org/10.1007/978-3-030-81688-9_1openalex-snapshot
Learning Probabilistic Termination Proofs
inferred← citeshttps://doi.org/10.1007/978-3-030-90870-6_33openalex-snapshot
On Lexicographic Proof Rules for Probabilistic Termination
inferred← citeshttps://doi.org/10.1007/978-3-030-90870-6_36openalex-snapshot
The Probabilistic Termination Tool Amber
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-38499-8_20openalex-snapshot
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
inferred← citeshttps://doi.org/10.1007/978-3-031-57231-9openalex-snapshot
Foundations of Software Science and Computation Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-57231-9_10openalex-snapshot
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
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-031-63498-7_14openalex-snapshot
Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT (Short Paper)
inferred← citeshttps://doi.org/10.1007/978-3-031-75783-9_14openalex-snapshot
Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-031-75783-9_8openalex-snapshot
Polar: An Algebraic Analyzer for (Probabilistic) Loops
inferred← citeshttps://doi.org/10.1007/978-3-031-90653-4_14openalex-snapshot
Refuting Equivalence in Probabilistic Programs with Conditioning
inferred← citeshttps://doi.org/10.1007/978-3-032-05792-1_15openalex-snapshot
Positive Almost-Sure Termination of Polynomial Random Walks
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-26204-2_29openalex-snapshot
Highly Incremental: A Simple Programmatic Approach for Many Objectives
inferred← citeshttps://doi.org/10.1007/978-3-032-32537-2_27openalex-snapshot
Caesar: A Deductive Verifier for Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-032-40374-2_18openalex-snapshot
Inferring Empirical Sound Resource Bounds via Symbolic Execution and Linear Programming
inferred← citeshttps://doi.org/10.1007/978-981-97-2300-3_4openalex-snapshot
A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
inferred← citeshttps://doi.org/10.1007/s10703-023-00424-zopenalex-snapshot
The probabilistic termination tool amber
inferred← citeshttps://doi.org/10.1016/j.scico.2025.103417openalex-snapshot
The annotated dependency pair framework for almost-sure termination of probabilistic term rewriting
inferred← citeshttps://doi.org/10.1109/cbs65871.2025.11267679openalex-snapshot
Improved Robot Path Planning Integrating Bidirectional Alternating JPS and SA Algorithms
inferred← citeshttps://doi.org/10.1145/3473592openalex-snapshot
On continuation-passing transformations and expected cost analysis
inferred← citeshttps://doi.org/10.1145/3519939.3523435openalex-snapshot
Differential cost analysis with simultaneous potentials and anti-potentials
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/3585391openalex-snapshot
On Lexicographic Proof Rules for Probabilistic Termination
inferred← citeshttps://doi.org/10.1145/3591263openalex-snapshot
Automated Expected Value Analysis of Recursive Programs
inferred← citeshttps://doi.org/10.1145/3622870openalex-snapshot
A Deductive Verification Infrastructure for Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3649822openalex-snapshot
Newtonian Program Analysis of Probabilistic 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/3656380openalex-snapshot
Robust Resource Bounds with Static Analysis and Bayesian Inference
inferred← citeshttps://doi.org/10.1145/3656462openalex-snapshot
Equivalence and Similarity Refutation for Probabilistic Programs
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/3729317openalex-snapshot
Probabilistic Refinement Session Types
inferred← citeshttps://doi.org/10.1145/3756907.3756917openalex-snapshot
Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25cf4openalex-snapshot
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
inferred← citeshttps://doi.org/10.46298/lmcs-20(4:26)2024openalex-snapshot
Worst-Case Input Generation for Concurrent Programs under Non-Monotone Resource Metrics
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.