Pages that link to "Item:Q2398171"

The following pages link to Complexity and resource bound analysis of imperative programs using difference constraints (Q2398171):

Displaying 17 items.

• ATLAS: automated amortised complexity analysis of self-adjusting data structures (Q832253) (← links)
• Lower-bound synthesis using loop specialization and Max-SMT (Q832313) (← links)
• Certified abstract cost analysis (Q2044174) (← 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)
• Automatic complexity analysis of integer programs via triangular weakly non-linear loops (Q2104561) (← links)
• Selectively-amortized resource bounding (Q2145338) (← links)
• Exponential automatic amortized resource analysis (Q2200835) (← links)
• The polynomial complexity of vector addition systems with states (Q2200853) (← links)
• Run-time complexity bounds using squeezers (Q2233463) (← 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)
• Relational cost analysis in a functional-imperative setting (Q5020903) (← links)
• (Q5028427) (← links)
• (Q5111324) (← links)
• (Q5114822) (← links)
• Type-based analysis of logarithmic amortised complexity (Q5875895) (← links)