A type-based complexity analysis of object oriented programs

DOI10.1016/j.ic.2018.05.006zbMath1395.68087arXiv1802.06653OpenAlexW2964137868WikidataQ129726623 ScholiaQ129726623MaRDI QIDQ1640983

Romain Péchoux, Emmanuel Hainry

Publication date: 14 June 2018

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.06653

zbMATH Keywords

complexitypolynomial timetype systemobject-oriented program

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Related Items (1)

\textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs

Uses Software

• COSTA
• Featherweight Java

Cites Work

• Unnamed Item
• Cost analysis of object-oriented bytecode programs
• A new recursion-theoretic characterization of the polytime functions
• Light linear logic
• On the Termination of Integer Loops
• Static prediction of heap space usage for first-order functional programs
• Resource control graphs
• Pure pointer programs with iteration
• Objects in Polynomial Time
• SPEED: Symbolic Complexity Bound Analysis
• Efficient Type-Checking for Amortised Heap-Space Analysis
• Space Lower Bounds for Maze Threadability on Restricted Machines
• Type-Based Complexity Analysis for Fork Processes
• Static determination of quantitative resource usage for higher-order programs
• SPEED
• Transition predicate abstraction and fair termination
• Evolving Graph-Structures and Their Implicit Computational Complexity
• Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs
• Logic for Programming, Artificial Intelligence, and Reasoning
• FM 2005: Formal Methods
• Static Analysis
• Programming Languages and Systems
• Size-Change Termination, Monotonicity Constraints and Ranking Functions

This page was built for publication: A type-based complexity analysis of object oriented programs