Automatic parallelization of recursive functions using quantifier elimination

DOI10.1007/978-3-642-12251-4_23MaRDI QIDQ3558346zbMATH OpenOpenAlexFDO

Authors Akimasa Morihata, Kiminori Matsuzaki

Publication date 4 May 2010

Published in Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-12251-4_23

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• scientific article; zbMATH DE number 1254025
• The static parallelization of loops and recursions
• Quantifier elimination in automatic loop parallelization
• scientific article; zbMATH DE number 1617318
• scientific article; zbMATH DE number 3917685

Cited in

(5)

• Quantifier elimination in automatic loop parallelization
• scientific article; zbMATH DE number 1617318 (Why is no real title available?)
• scientific article; zbMATH DE number 1254025 (Why is no real title available?)
• Lambda calculus with algebraic simplification for reduction parallelisation: extended study
• Counterexample-guided partial bounding for recursive function synthesis

This page was built for publication: Automatic parallelization of recursive functions using quantifier elimination

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