A usage analysis with bounded usage polymorphism and subtyping

DOI10.1007/3-540-45361-X_9MaRDI QIDQ2763385zbMATH OpenFDO

Authors Jörgen Gustavsson, Josef Svenningsson

Publication date 15 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2011/20110140

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Computing methodologies and applications (68U99)

Review text

Usage analysis aims to predict the number of times a heap allocated closure is used. Previously proposed usage analyses have proved not to scale up well to large programs. In this paper we present a powerful and accurate type based analysis designed to scale up for large programs. The key features of the type system are usage subtyping and bounded usage polymorphism. Bounded polymorphism can lead to huge constraint sets so to express constraints compactly we introduce a new expressive form of constraints which allows constraints to be represented compactly through calls to \textit{constraint abstractions}. For the entire collection see [Zbl 0977.68824].

Recommendations

• Polymorphism, Subtyping, Whole Program Analysis and Accurate Data Types in Usage Analysis
• A generic usage analysis with subeffect qualifiers
• Constraint abstractions
• Types in program analysis
• Storage use analysis and its applications

Cited in

(5)

• Storage use analysis and its applications
• Constraint abstractions
• A generic usage analysis with subeffect qualifiers
• Modular, higher order cardinality analysis in theory and practice
• Polymorphism, Subtyping, Whole Program Analysis and Accurate Data Types in Usage Analysis

This page was built for publication: A usage analysis with bounded usage polymorphism and subtyping

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