Pages that link to "Item:Q764297"
From MaRDI portal
The following pages link to Cost analysis of object-oriented bytecode programs (Q764297):
Displaying 29 items.
- Quantified abstract configurations of distributed systems (Q493525) (← links)
- A type-based complexity analysis of object oriented programs (Q1640983) (← 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)
- The abstract domain of trapezoid step functions (Q1749121) (← links)
- Certified abstract cost analysis (Q2044174) (← links)
- Inferring expected runtimes of probabilistic integer programs using expected sizes (Q2044203) (← links)
- \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs (Q2119987) (← links)
- Cost analysis for an actor-based workflow modelling language (Q2154052) (← links)
- A framework for computing finite SLD trees (Q2258840) (← links)
- A multi-domain incremental analysis engine and its application to incremental resource analysis (Q2346994) (← links)
- Automatically proving termination and memory safety for programs with pointer arithmetic (Q2362494) (← links)
- Complexity and resource bound analysis of imperative programs using difference constraints (Q2398171) (← links)
- Time analysis of actor programs (Q2423757) (← links)
- Closed-form upper bounds in static cost analysis (Q2429987) (← links)
- Inference of Field-Sensitive Reachability and Cyclicity (Q2946745) (← links)
- Horn clauses as an intermediate representation for program analysis and transformation (Q4592995) (← links)
- A Transformational Approach to Resource Analysis with Typed-norms Inference (Q4957197) (← links)
- Incremental and Modular Context-sensitive Analysis (Q4957220) (← links)
- (Q5020651) (← links)
- Denotational semantics as a foundation for cost recurrence extraction for functional languages (Q5101922) (← links)
- Resource Analysis driven by (Conditional) Termination Proofs (Q5108498) (← links)
- (Q5111324) (← links)
- Verifying Procedural Programs via Constrained Rewriting Induction (Q5278212) (← links)
- Type-based amortized resource analysis with integers and arrays (Q5371954) (← links)
- Ranking Functions for Linear-Constraint Loops (Q5501930) (← links)
- (Q5875426) (← links)
- Parallel Logic Programming: A Sequel (Q6063892) (← links)
- Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)
