Pages that link to "Item:Q2789051"

The following pages link to Resource Analysis of Complex Programs with Cost Equations (Q2789051):

Displayed 19 items.

• Resource-usage-aware configuration in software product lines (Q898611) ‎ (← links)
• From Jinja bytecode to term rewriting: a complexity reflecting transformation (Q1640985) ‎ (← links)
• Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution (Q1647969) ‎ (← links)
• On the complexity of monitoring Orchids signatures, and recurrence equations (Q1667643) ‎ (← 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)
• Cost analysis for an actor-based workflow modelling language (Q2154052) ‎ (← 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)
• Time analysis of actor programs (Q2423757) ‎ (← links)
• Lower Runtime Bounds for Integer Programs (Q2817952) ‎ (← links)
• Proving Termination Through Conditional Termination (Q3303892) ‎ (← links)
• A Transformational Approach to Resource Analysis with Typed-norms Inference (Q4957197) ‎ (← links)
• Resource Analysis driven by (Conditional) Termination Proofs (Q5108498) ‎ (← links)
• Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis (Q5108517) ‎ (← links)
• (Q5111324) ‎ (← links)
• Analysing parallel complexity of term rewriting (Q6160759) ‎ (← links)