Cost analysis of object-oriented bytecode programs
type: Item
instance of: scholarly article
title: Cost analysis of object-oriented bytecode programs
zbMATH Open document ID: 1236.68042
author: Elvira Albert
author: Puri Arenas
author: Samir Genaim
author: Damiano Zanardini
author: Germán Puebla
published in: Theoretical Computer Science
publication date: 2012-03-13T00:00:00Z
Mathematics Subject Classification ID: 68N30
Mathematics Subject Classification ID: 68N19
Mathematics Subject Classification ID: 68N99
zbMATH DE Number: 6014292
zbMATH Keywords: cost analysis
zbMATH Keywords: resource usage analysis
zbMATH Keywords: bytecode languages
zbMATH Keywords: static analysis
zbMATH Keywords: quantitative analysis
describes a project that uses: CiaoPP
describes a project that uses: net.datastructures
describes a project that uses: PPL
describes a project that uses: PURRS
describes a project that uses: BoogiePL
describes a project that uses: Ciao
describes a project that uses: ACE
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.07.009
OpenAlex ID: W2094712524
cites work: Q3907046
cites work: On the computational power of pushdown automata
cites work: Comparing Cost Functions in Resource Analysis
cites work: Closed-form upper bounds in static cost analysis
cites work: From Object Fields to Local Variables: A Practical Approach to Field-Sensitive Analysis
cites work: More Precise Yet Widely Applicable Cost Analysis
cites work: Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time
cites work: Automated higher-order complexity analysis
cites work: Automatic Abstraction for Intervals Using Boolean Formulae
cites work: FM 2005: Formal Methods
cites work: Long-run cost analysis by approximation of linear operators over dioids
cites work: Programming Languages and Systems
cites work: Resource bound certification
cites work: Verification, Model Checking, and Abstract Interpretation
cites work: Q4446073
cites work: A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis
cites work: Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
cites work: Static prediction of heap space usage for first-order functional programs
cites work: New Computational Paradigms
cites work: Q4671219
cites work: Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs
cites work: A Naïve Time Analysis and its Theory of Cost Equivalence
cites work: Static Analysis
cites work: Mechanical program analysis
DOI: 10.1016/J.TCS.2011.07.009
description: scientific article; zbMATH DE number 6014292