An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic

DOI10.1016/j.jlamp.2014.07.002zbMath1304.68130OpenAlexW2026366530MaRDI QIDQ478379

Anh-Dung Phan, Michael R. Hansen

Publication date: 3 December 2014

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2014.07.002

zbMATH Keywords

parallelismfunctional programmingmulticoredecision procedurePresburger arithmetic

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60)

Uses Software

• ManySAT
• Cilk
• F#

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Routing, merging, and sorting on parallel models of computation
• A calculus of durations
• A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
• Parallel programming with a pattern language
• A practical approach to model checking duration calculus using Presburger arithmetic
• Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant
• Cache-Oblivious Algorithms
• Algorithm + strategy = parallelism
• Lazy tree splitting
• Bounds on the automata size for Presburger arithmetic
• Automata, Languages and Programming
• Linear Quantifier Elimination as an Abstract Decision Procedure