Automated reasoning about parallel algorithms using powerlists

DOI10.1007/3-540-60043-4_68OpenAlexW1501195639MaRDI QIDQ5096401FDOQ5096401

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• New uses of linear arithmetic in automated theorem proving by induction

Cited In (5)

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

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)