Automated reasoning about parallel algorithms using powerlists

DOI10.1007/3-540-60043-4_68MaRDI QIDQ5096401OpenAlexFDO

Authors Deepak Kapur, Mahadevan Subramaniam

Publication date 16 August 2022

Published in Algebraic Methodology and Software Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60043-4_68

Mathematics Subject Classification ID

Data structures (68P05) Parallel algorithms in computer science (68W10) Abstract data types; algebraic specification (68Q65) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• A formalization of powerlist algebra in ACL2
• The correctness of the fast Fourier transform: A structured proof in ACL2
• Mapping a functional notation for parallel programs onto hypercubes
• Data-Distributions in PowerList Theory
• Massive parallelization of divide-and-conquer algorithms over powerlists

Cites work

• scientific article; zbMATH DE number 4074541 (Why is no real title available?)
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 194509 (Why is no real title available?)
• New uses of linear arithmetic in automated theorem proving by induction

Cited in

(5)

• Data-Distributions in PowerList Theory
• The correctness of the fast Fourier transform: A structured proof in ACL2
• A formalization of powerlist algebra in ACL2
• Massive parallelization of divide-and-conquer algorithms over powerlists
• Coverset induction with partiality and subsorts: a powerlist case study

This page was built for publication: Automated reasoning about parallel algorithms using powerlists

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