Pages that link to "Item:Q4930721"

The following pages link to Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs (Q4930721):

Displaying 20 items.

• A combination framework for complexity (Q276251) (← links)
• Constraint-based relational verification (Q832229) (← links)
• Learning probabilistic termination proofs (Q832245) (← links)
• Decision tree learning in CEGIS-based termination analysis (Q832251) (← links)
• Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution (Q1647969) (← links)
• Inferring expected runtimes of probabilistic integer programs using expected sizes (Q2044203) (← links)
• Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. With an application to proving that non-blocking algorithms are bounded lock-free (Q2058383) (← links)
• A new order-theoretic characterisation of the polytime computable functions (Q2346988) (← links)
• Analyzing program termination and complexity automatically with \textsf{AProVE} (Q2362493) (← links)
• Complexity and resource bound analysis of imperative programs using difference constraints (Q2398171) (← links)
• Rely-guarantee termination and cost analyses of loops with concurrent interleavings (Q2398172) (← links)
• Lower Runtime Bounds for Integer Programs (Q2817952) (← links)
• More Precise Yet Widely Applicable Cost Analysis (Q3075469) (← links)
• Proving Termination Through Conditional Termination (Q3303892) (← links)
• Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis (Q5108517) (← links)
• (Q5114822) (← links)
• Analysis of Executable Software Models (Q5175771) (← links)
• Type-based amortized resource analysis with integers and arrays (Q5371954) (← links)
• Ranking Functions for Linear-Constraint Loops (Q5501930) (← links)
• Type-based analysis of logarithmic amortised complexity (Q5875895) (← links)