Cost analysis of object-oriented bytecode programs
From MaRDI portal
Publication:764297
DOI10.1016/j.tcs.2011.07.009zbMath1236.68042OpenAlexW2094712524MaRDI QIDQ764297
Puri Arenas, Samir Genaim, Elvira Albert, Damiano Zanardini, Germán Puebla
Publication date: 13 March 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.07.009
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of software (68N99)
Related Items (30)
\textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs ⋮ Verifying Procedural Programs via Constrained Rewriting Induction ⋮ Automatically proving termination and memory safety for programs with pointer arithmetic ⋮ A type-based complexity analysis of object oriented programs ⋮ From Jinja bytecode to term rewriting: a complexity reflecting transformation ⋮ Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution ⋮ Cost analysis for an actor-based workflow modelling language ⋮ Complexity and resource bound analysis of imperative programs using difference constraints ⋮ Inference of Field-Sensitive Reachability and Cyclicity ⋮ Denotational semantics as a foundation for cost recurrence extraction for functional languages ⋮ Parallel Logic Programming: A Sequel ⋮ Analysis and Transformation of Constrained Horn Clauses for Program Verification ⋮ Horn clauses as an intermediate representation for program analysis and transformation ⋮ Time analysis of actor programs ⋮ Resource Analysis driven by (Conditional) Termination Proofs ⋮ Analysing parallel complexity of term rewriting ⋮ Unnamed Item ⋮ Closed-form upper bounds in static cost analysis ⋮ Type-based amortized resource analysis with integers and arrays ⋮ Unnamed Item ⋮ Quantified abstract configurations of distributed systems ⋮ The abstract domain of trapezoid step functions ⋮ A framework for computing finite SLD trees ⋮ A Transformational Approach to Resource Analysis with Typed-norms Inference ⋮ Incremental and Modular Context-sensitive Analysis ⋮ Certified abstract cost analysis ⋮ Inferring expected runtimes of probabilistic integer programs using expected sizes ⋮ Unnamed Item ⋮ Ranking Functions for Linear-Constraint Loops ⋮ A multi-domain incremental analysis engine and its application to incremental resource analysis
Uses Software
Cites Work
- Automated higher-order complexity analysis
- Closed-form upper bounds in static cost analysis
- On the computational power of pushdown automata
- Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
- Static prediction of heap space usage for first-order functional programs
- More Precise Yet Widely Applicable Cost Analysis
- Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time
- A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis
- Long-run cost analysis by approximation of linear operators over dioids
- Mechanical program analysis
- A Naïve Time Analysis and its Theory of Cost Equivalence
- From Object Fields to Local Variables: A Practical Approach to Field-Sensitive Analysis
- Automatic Abstraction for Intervals Using Boolean Formulae
- Resource bound certification
- Programming Languages and Systems
- Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs
- Verification, Model Checking, and Abstract Interpretation
- FM 2005: Formal Methods
- New Computational Paradigms
- Comparing Cost Functions in Resource Analysis
- Static Analysis
- Verification, Model Checking, and Abstract Interpretation
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Cost analysis of object-oriented bytecode programs
