On the public citation graph
Analyzing Runtime and Size Complexity of Integer Programs
0 signed · 109 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/978-3-319-02444-8_23openalex-snapshot
Precise Cost Analysis via Local Reasoning
inferredcites →https://doi.org/10.1007/978-3-319-07151-0_10openalex-snapshot
Type-Based Amortized Resource Analysis with Integers and Arrays
inferredcites →https://doi.org/10.1007/978-3-319-08587-6_13openalex-snapshot
Proving Termination of Programs Automatically with AProVE
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-08867-9_53openalex-snapshot
Termination Analysis by Learning Terminating Programs
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-540-24622-0_20openalex-snapshot
A Complete Method for the Synthesis of Linear Ranking Functions
inferredcites →https://doi.org/10.1007/978-3-540-68863-1_2openalex-snapshot
Termination Analysis of Java Bytecode
inferredcites →https://doi.org/10.1007/978-3-540-69407-6_7openalex-snapshot
Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time
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-540-74061-2_11openalex-snapshot
A New Algorithm for Identifying Loops in Decompilation
inferredcites →https://doi.org/10.1007/978-3-540-74610-2_24openalex-snapshot
User-Definable Resource Bounds Analysis for Logic Programs
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-642-02348-4_3openalex-snapshot
Proving Termination of Integer Term Rewriting
inferredcites →https://doi.org/10.1007/978-3-642-02658-4_52openalex-snapshot
Apron: A Library of Numerical Abstract Domains for Static Analysis
inferredcites →https://doi.org/10.1007/978-3-642-15769-1_19openalex-snapshot
Alternation for Termination
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-17511-4_7openalex-snapshot
ABC: Algebraic Bound Computation for Loops
inferredcites →https://doi.org/10.1007/978-3-642-19835-9_9openalex-snapshot
Loop Summarization and Termination Analysis
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-28717-6_34openalex-snapshot
r-TuBound: Loop Bounds for WCET Analysis (Tool Paper)
inferredcites →https://doi.org/10.1007/978-3-642-31424-7_13openalex-snapshot
Automated Termination Proofs for Java Programs with Cyclic Data
inferredcites →https://doi.org/10.1007/978-3-642-32759-9_21openalex-snapshot
A Verification Toolkit for Numerical Transition Systems
inferredcites →https://doi.org/10.1007/978-3-642-36742-7_4openalex-snapshot
Ramsey vs. Lexicographic Termination Proving
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_28openalex-snapshot
Better Termination Proving through Cooperation
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-642-54862-8_12openalex-snapshot
Ranking Templates for Linear Loops
inferredcites →https://doi.org/10.1007/s10817-006-9057-7openalex-snapshot
Mechanizing and Improving Dependency Pairs
inferredcites →https://doi.org/10.1007/s10817-010-9174-1openalex-snapshot
Closed-Form Upper Bounds in Static Cost Analysis
inferredcites →https://doi.org/10.1007/s10817-013-9277-6openalex-snapshot
Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs
inferredcites →https://doi.org/10.1007/s10990-006-8609-1openalex-snapshot
The octagon abstract domain
inferredcites →https://doi.org/10.1016/j.ic.2012.03.003openalex-snapshot
A new look at the automatic synthesis of linear ranking functions
inferredcites →https://doi.org/10.1016/j.tcs.2011.07.009openalex-snapshot
Cost analysis of object-oriented bytecode programs
inferredcites →https://doi.org/10.1017/s1471068411000457openalex-snapshot
An overview of Ciao and its design philosophy
inferredcites →https://doi.org/10.1017/s147106841400057xopenalex-snapshot
Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types
inferredcites →https://doi.org/10.1109/fmcad.2013.6679413openalex-snapshot
Proving termination of imperative programs using Max-SMT
inferredcites →https://doi.org/10.1145/1133255.1134029openalex-snapshot
Termination proofs for systems code
inferredcites →https://doi.org/10.1145/1133981.1134029openalex-snapshot
Termination proofs for systems code
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/161468.161472openalex-snapshot
Cost analysis of logic programs
inferredcites →https://doi.org/10.1145/1706299.1706326openalex-snapshot
Automatic numeric abstractions for heap-manipulating programs
inferredcites →https://doi.org/10.1145/1709093.1709095openalex-snapshot
A termination analyzer for Java bytecode based on path-length
inferredcites →https://doi.org/10.1145/1929501.1929513openalex-snapshot
Verified resource guarantees using COSTA and KeY
inferredcites →https://doi.org/10.1145/2254064.2254112openalex-snapshot
Synthesizing software verifiers from proof rules
inferredcites →https://doi.org/10.1145/2362389.2362393openalex-snapshot
Multivariate amortized resource analysis
inferredcites →https://doi.org/10.1145/2370776.2370778openalex-snapshot
Symbolic evaluation graphs and term rewriting
inferredcites →https://doi.org/10.1145/2429069.2429078openalex-snapshot
On the linear ranking problem for integer linear-constraint loops
inferredcites →https://doi.org/10.1145/360204.360210openalex-snapshot
The size-change principle for program termination
inferredcites →https://doi.org/10.4204/eptcs.169openalex-snapshot
Proceedings First Workshop on Horn Clauses for Verification and Synthesis
inferredcites →https://doi.org/10.4230/lipics.rta.2011.41openalex-snapshot
Termination Analysis of C Programs Using Compiler Intermediate Languages
inferredcites →https://doi.org/10.48550/arxiv.1302.0973openalex-snapshot
A Combination Framework for Complexity
inferredcites →https://doi.org/10.7551/mitpress/4283.003.0035openalex-snapshot
Lower Bound Cost Estimation for Logic 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-17502-3_10openalex-snapshot
The Termination and Complexity Competition
inferred← citeshttps://doi.org/10.1007/978-3-030-29007-8openalex-snapshot
Frontiers of Combining Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-29007-8_20openalex-snapshot
Transforming Derivational Complexity of Term Rewriting to Runtime Complexity
inferred← citeshttps://doi.org/10.1007/978-3-030-29436-6_16openalex-snapshot
Computing Expected Runtimes for Constant Probability Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-32304-2_22openalex-snapshot
Multiphase-Linear Ranking Functions and Their Relation to Recurrent Sets
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-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_40openalex-snapshot
Lower-Bound Synthesis Using Loop Specialization and Max-SMT
inferred← citeshttps://doi.org/10.1007/978-3-030-99429-7_5openalex-snapshot
Estimating Worst-case Resource Usage by Resource-usage-aware Fuzzing
inferred← citeshttps://doi.org/10.1007/978-3-031-08166-8_10openalex-snapshot
Improving Automatic Complexity Analysis of Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-08166-8_2openalex-snapshot
When COSTA Met KeY: Verified Cost Bounds
inferred← citeshttps://doi.org/10.1007/978-3-031-10769-6_43openalex-snapshot
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
inferred← citeshttps://doi.org/10.1007/978-3-031-43369-6_1openalex-snapshot
Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-45332-8_14openalex-snapshot
pymwp: A Static Analyzer Determining Polynomial Growth Bounds
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-032-22723-2_1openalex-snapshot
Modular Automatic Complexity Analysis of Recursive Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-032-32537-2_3openalex-snapshot
KoAT: Automatic Complexity and Termination Analysis of Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_3openalex-snapshot
Non-polynomial Worst-Case Analysis of Recursive Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_32openalex-snapshot
On Multiphase-Linear Ranking Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-66167-4_8openalex-snapshot
Complexity Analysis for Term Rewriting by Integer Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-66845-1_6openalex-snapshot
Complexity Analysis for Java with AProVE
inferred← citeshttps://doi.org/10.1007/s10703-021-00370-8openalex-snapshot
Rely-guarantee bound analysis of parameterized concurrent shared-memory programs
inferred← citeshttps://doi.org/10.1007/s10817-016-9388-yopenalex-snapshot
Analyzing Program Termination and Complexity Automatically with AProVE
inferred← citeshttps://doi.org/10.1007/s10817-016-9402-4openalex-snapshot
Complexity and Resource Bound Analysis of Imperative Programs Using Difference Constraints
inferred← citeshttps://doi.org/10.1016/j.jlamp.2018.02.004openalex-snapshot
Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution
inferred← citeshttps://doi.org/10.1016/j.jss.2021.110923openalex-snapshot
Don’t run on fumes—Parametric gas bounds for smart contracts
inferred← citeshttps://doi.org/10.1017/s1471068419000310openalex-snapshot
Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis
inferred← citeshttps://doi.org/10.1080/09540091.2019.1650329openalex-snapshot
A fuzzy irregular cellular automata-based method for the vertex colouring problem
inferred← citeshttps://doi.org/10.1109/issre52982.2021.00048openalex-snapshot
Static Bound Analysis of Dynamically Allocated Resources for C Programs
inferred← citeshttps://doi.org/10.1145/3009837.3009874openalex-snapshot
Contract-based resource verification for higher-order functions with memoization
inferred← citeshttps://doi.org/10.1145/3093333.3009874openalex-snapshot
Contract-based resource verification for higher-order functions with memoization
inferred← citeshttps://doi.org/10.1145/3121136openalex-snapshot
Bit-Precise Procedure-Modular Termination Analysis
inferred← citeshttps://doi.org/10.1145/3133956.3134058openalex-snapshot
Precise Detection of Side-Channel Vulnerabilities using Quantitative Cartesian Hoare Logic
inferred← citeshttps://doi.org/10.1145/3158124openalex-snapshot
Monadic refinements for relational cost analysis
inferred← citeshttps://doi.org/10.1145/3236024.3236039openalex-snapshot
Singularity: pattern fuzzing for worst case complexity
inferred← citeshttps://doi.org/10.1145/3314221.3314581openalex-snapshot
Cost analysis of nondeterministic probabilistic programs
inferred← citeshttps://doi.org/10.1145/3385412.3386035openalex-snapshot
Templates and recurrences: better together
inferred← citeshttps://doi.org/10.1145/3410331openalex-snapshot
Inferring Lower Runtime Bounds for Integer Programs
inferred← citeshttps://doi.org/10.1145/3428240openalex-snapshot
A modular cost analysis for probabilistic programs
inferred← citeshttps://doi.org/10.1145/3485515openalex-snapshot
Dynaplex: analyzing program complexity using dynamically inferred recurrence relations
inferred← citeshttps://doi.org/10.1145/3519939.3523435openalex-snapshot
Differential cost analysis with simultaneous potentials and anti-potentials
inferred← citeshttps://doi.org/10.1145/3626232.3653258openalex-snapshot
Estimating the Runtime and Global Network Traffic of SMPC Protocols
inferred← citeshttps://doi.org/10.1145/3656414openalex-snapshot
Program Analysis for Adaptive Data Analysis
inferred← citeshttps://doi.org/10.1145/3705298openalex-snapshot
Certified Cost Bounds for Abstract Programs
inferred← citeshttps://doi.org/10.1145/3763798openalex-snapshot
Integrating Resource Analyses via Resource Decomposition
inferred← citeshttps://doi.org/10.23638/lmcs-16(2:4)2020openalex-snapshot
Tight Polynomial Worst-Case Bounds for Loop Programs
inferred← citeshttps://doi.org/10.23919/fmcad.2018.8603020openalex-snapshot
Rely-Guarantee Reasoning for Automated Bound Analysis of Lock-Free Algorithms
inferred← citeshttps://doi.org/10.23919/fmcad.2019.8894271openalex-snapshot
Proving Non-Termination via Loop Acceleration
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25cf4openalex-snapshot
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
inferred← citeshttps://doi.org/10.4204/eptcs.344.2openalex-snapshot
Termination Analysis of Programs with Multiphase Control-Flow
inferred← citeshttps://doi.org/10.46298/lmcs-17(4:7)2021openalex-snapshot
Tight Polynomial Bounds for Loop Programs in Polynomial Space
inferred← citeshttps://doi.org/10.48550/arxiv.1703.07547openalex-snapshot
On Multiphase-Linear Ranking Functions
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.