Analyzing the implicit computational complexity of object-oriented programs

DOI10.4230/LIPICS.FSTTCS.2008.1763MaRDI QIDQ3165969zbMATH OpenFDO

Authors Jean-Yves Marion, Romain Péchoux

Publication date 19 October 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_c765.html

zbMATH Keywords

implicit computational complexityobject-oriented programsresource upper boundssup-interpretation

Mathematics Subject Classification ID

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

Recommendations

• A type-based complexity analysis of object oriented programs
• Sup-interpretations, a semantic method for static analysis of program resources
• Synthesis of sup-interpretations: a survey
• Higher-order interpretations and program complexity
• Higher-order interpretations and program complexity

Cited in

(3)

• A type-based complexity analysis of object oriented programs
• scientific article; zbMATH DE number 1508929 (Why is no real title available?)
• scientific article; zbMATH DE number 1569677 (Why is no real title available?)

Describes a project that uses

Uses Software

• Featherweight Java

This page was built for publication: Analyzing the implicit computational complexity of object-oriented programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3165969)