Iterative-free program analysis

DOI10.1145/944705.944716zbMATH Open1315.68042OpenAlexW2104429191MaRDI QIDQ5261270FDOQ5261270

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

Recommendations

• scientific article; zbMATH DE number 3874581
• scientific article; zbMATH DE number 1107741
• Publication:4886067
• scientific article; zbMATH DE number 2087560
• Publication:4940927

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)

• Title not available (Why is that?)
• Static Analysis
• Improving program analyses, by structure untupling
• Title not available (Why is that?)
• 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)