On the public citation graph

Inferring Lower Runtime Bounds for Integer Programs

https://doi.org/10.1145/3410331
0 signed · 69 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/11513988_48openalex-snapshot
Linear Ranking with Reachability
inferredcites →https://doi.org/10.1007/11823230_10openalex-snapshot
Combining Widening and Acceleration in Linear Relation Analysis
inferredcites →https://doi.org/10.1007/3-540-51081-8_107openalex-snapshot
Termination proofs and the length of derivations
inferredcites →https://doi.org/10.1007/978-3-030-11245-5_22openalex-snapshot
Termination of Nondeterministic Probabilistic Programs
inferredcites →https://doi.org/10.1007/978-3-030-17502-3_10openalex-snapshot
The Termination and Complexity Competition
inferredcites →https://doi.org/10.1007/978-3-030-25543-5_24openalex-snapshot
Termination of Triangular Integer Loops is Decidable
inferredcites →https://doi.org/10.1007/978-3-030-29436-6_16openalex-snapshot
Computing Expected Runtimes for Constant Probability 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-319-40229-1_37openalex-snapshot
Lower Runtime Bounds for Integer Programs
inferredcites →https://doi.org/10.1007/978-3-319-48989-6_16openalex-snapshot
Upper and Lower Amortized Cost Bounds of Programs Expressed as Cost Relations
inferredcites →https://doi.org/10.1007/978-3-319-63390-9_4openalex-snapshot
Automated Resource Analysis with Coq Proof Objects
inferredcites →https://doi.org/10.1007/978-3-319-66167-4_8openalex-snapshot
Complexity Analysis for Term Rewriting by Integer Transition Systems
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-71070-7_32openalex-snapshot
Automated Complexity Analysis Based on the Dependency Pair Method
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-00768-2_29openalex-snapshot
Iterating Octagons
inferredcites →https://doi.org/10.1007/978-3-642-10672-9_21openalex-snapshot
Asymptotic Resource Usage Bounds
inferredcites →https://doi.org/10.1007/978-3-642-14295-6_23openalex-snapshot
Fast Acceleration of Ultimately Periodic Relations
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-27705-4_21openalex-snapshot
Termination Analysis of Imperative Programs Using Bitvector Arithmetic
inferredcites →https://doi.org/10.1007/978-3-642-33125-1_27openalex-snapshot
On the Limits of the Classical Approach to Cost Analysis
inferredcites →https://doi.org/10.1007/b138392openalex-snapshot
Abstraction, Refinement and Proof for Probabilistic Systems
inferredcites →https://doi.org/10.1007/s10009-016-0420-7openalex-snapshot
Underapproximation of procedure summaries for integer programs
inferredcites →https://doi.org/10.1007/s10703-015-0228-1openalex-snapshot
Under-approximating loops in C programs for fast counterexample detection
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-016-9397-xopenalex-snapshot
Lower Bounds for Runtime Complexity of Term Rewriting
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/j.jlamp.2018.02.004openalex-snapshot
Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution
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/s0956796815000192openalex-snapshot
Type-based amortized resource analysis with integers and arrays
inferredcites →https://doi.org/10.1109/fmcad.2013.6679413openalex-snapshot
Proving termination of imperative programs using Max-SMT
inferredcites →https://doi.org/10.1109/fmcad.2015.7542253openalex-snapshot
Compositional recurrence analysis
inferredcites →https://doi.org/10.1109/fmcad.2015.7542259openalex-snapshot
Accelerating invariant generation
inferredcites →https://doi.org/10.1109/icse.2009.5070545openalex-snapshot
WISE: Automated test generation for worst-case complexity
inferredcites →https://doi.org/10.1137/1034112openalex-snapshot
Mathematics: A System for Doing Mathematics by Computer, Second Edition (Stephen Wolfram)
inferredcites →https://doi.org/10.1145/1480881.1480898openalex-snapshot
SPEED
inferredcites →https://doi.org/10.1145/2338965.2336772openalex-snapshot
Abstracting path conditions
inferredcites →https://doi.org/10.1145/2362389.2362393openalex-snapshot
Multivariate amortized resource analysis
inferredcites →https://doi.org/10.1145/2499937.2499943openalex-snapshot
On the Inference of Resource Usage Upper and Lower Bounds
inferredcites →https://doi.org/10.1145/2535838.2535843openalex-snapshot
Abstract acceleration of general linear loops
inferredcites →https://doi.org/10.1145/2578855.2535843openalex-snapshot
Abstract acceleration of general linear loops
inferredcites →https://doi.org/10.1145/2629488openalex-snapshot
Ranking Functions for Linear-Constraint Loops
inferredcites →https://doi.org/10.1145/2737924.2737955openalex-snapshot
Compositional certified resource bounds
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/3009837.3009842openalex-snapshot
Towards automatic resource bound analysis for OCaml
inferredcites →https://doi.org/10.1145/3009837.3009864openalex-snapshot
Complexity verification using guided theorem enumeration
inferredcites →https://doi.org/10.1145/3093333.3009842openalex-snapshot
Towards automatic resource bound analysis for OCaml
inferredcites →https://doi.org/10.1145/321992.321996openalex-snapshot
A Transformation System for Developing Recursive Programs
inferredcites →https://doi.org/10.1145/3290326openalex-snapshot
Type-guided worst-case input generation
inferredcites →https://doi.org/10.1145/3410331openalex-snapshot
Inferring Lower Runtime Bounds for Integer Programs
inferredcites →https://doi.org/10.1201/9780429246593openalex-snapshot
An Introduction to the Bootstrap
inferredcites →https://doi.org/10.23919/fmcad.2018.8603005openalex-snapshot
Using Loop Bound Analysis For Invariant Generation
inferredcites →https://doi.org/10.23919/fmcad.2019.8894271openalex-snapshot
Proving Non-Termination via Loop Acceleration
inferredcites →https://doi.org/10.48550/arxiv.cs/0512056openalex-snapshot
PURRS: Towards Computer Algebra Support for Fully Automatic Worst-Case Complexity Analysis
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-45190-5_4openalex-snapshot
A Calculus for Modular Loop Acceleration
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-031-08166-8_10openalex-snapshot
Improving Automatic Complexity Analysis of Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-10769-6_41openalex-snapshot
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)
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-63498-7_21openalex-snapshot
Satisfiability Modulo Exponential Integer Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-031-71162-6_4openalex-snapshot
Integrating Loop Acceleration Into Bounded Model Checking
inferred← citeshttps://doi.org/10.1007/s10009-022-00670-2openalex-snapshot
A calculus for modular loop acceleration and non-termination proofs
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/3705298openalex-snapshot
Certified Cost Bounds for Abstract Programs
showing the first 11 of 12 · page through all 12
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.