Automatic Parallelization of Recursive Functions Using Quantifier Elimination

DOI10.1007/978-3-642-12251-4_23zbMath1284.68191OpenAlexW1520171143MaRDI QIDQ3558346

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)

Related Items (2)

Counterexample-guided partial bounding for recursive function synthesis ⋮ Lambda calculus with algebraic simplification for reduction parallelisation: Extended study

This page was built for publication: Automatic Parallelization of Recursive Functions Using Quantifier Elimination