Iterative-free program analysis

DOI10.1145/944705.944716MaRDI QIDQ5261270zbMATH OpenOpenAlexFDO

Authors Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano

Publication date 2 July 2015

Published in Proceedings of the eighth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/944705.944716

zbMATH Keywords

dynamic programmingprogram analysistree widthregister allocationcontrol flow graphcatamorphismSP term

Mathematics Subject Classification ID

Applications of graph theory (05C90) Theory of programming languages (68N15) Trees (05C05) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cited in

(5)

• scientific article; zbMATH DE number 1324833 (Why is no real title available?)
• Static Analysis
• Improving program analyses, by structure untupling
• scientific article; zbMATH DE number 3845083 (Why is no real title available?)
• Elimination Techniques for Program Analysis

This page was built for publication: Iterative-free program analysis

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