An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic
From MaRDI portal
(Redirected from Publication:478379)
Recommendations
- scientific article; zbMATH DE number 1393310
- scientific article; zbMATH DE number 1760048
- scientific article; zbMATH DE number 194121
- Parallelizing functional programs by generalization
- scientific article; zbMATH DE number 1088022
- scientific article; zbMATH DE number 4205977
- scientific article; zbMATH DE number 549875
Cites work
- A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
- A calculus of durations
- A practical approach to model checking duration calculus using Presburger arithmetic
- Algorithm + strategy = parallelism
- Automata, Languages and Programming
- Bounds on the automata size for Presburger arithmetic
- Cache-oblivious algorithms
- Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant
- scientific article; zbMATH DE number 5764815 (Why is no real title available?)
- scientific article; zbMATH DE number 3501006 (Why is no real title available?)
- scientific article; zbMATH DE number 5194318 (Why is no real title available?)
- scientific article; zbMATH DE number 3408928 (Why is no real title available?)
- Lazy tree splitting
- Linear quantifier elimination as an abstract decision procedure
- ManySAT: a parallel SAT solver
- Parallel programming with a pattern language
- Routing, merging, and sorting on parallel models of computation
This page was built for publication: An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q478379)