Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs
From MaRDI portal
Recommendations
Cited in
(31)- A complexity tradeoff in ranking-function termination proofs
- Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution
- Inferring expected runtimes of probabilistic integer programs using expected sizes
- Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. With an application to proving that non-blocking algorithms are bounded lock-free
- A new order-theoretic characterisation of the polytime computable functions
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Complexity and resource bound analysis of imperative programs using difference constraints
- Rely-guarantee termination and cost analyses of loops with concurrent interleavings
- A combination framework for complexity
- Lower runtime bounds for integer programs
- More precise yet widely applicable cost analysis
- Proving termination through conditional termination
- Control-flow refinement by partial evaluation, and its application to termination and cost analysis
- Tight polynomial worst-case bounds for loop programs
- Analysis of executable software models
- Type-based amortized resource analysis with integers and arrays
- Ranking functions for linear-constraint loops
- Type-based analysis of logarithmic amortised complexity
- Affine Loop Invariant Generation via Matrix Algebra
- On Lexicographic Proof Rules for Probabilistic Termination
- MDPs as distribution transformers: affine invariant synthesis for safety objectives
- Multiphase-linear ranking functions and their relation to recurrent sets
- On lexicographic proof rules for probabilistic termination
- Termination analysis of programs with multiphase control-flow
- Quantitative verification with neural networks
- Termination of triangular polynomial loops
- Control-flow refinement for complexity analysis of probabilistic programs in \textsf{KoAT} (short paper)
- Quantitative verification with neural networks
- Constraint-based relational verification
- Learning probabilistic termination proofs
- Decision tree learning in CEGIS-based termination analysis
This page was built for publication: Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4930721)
