A sound and complete abstraction for reasoning about parallel prefix sums

DOI10.1145/2535838.2535882zbMath1284.68387OpenAlexW2022457591MaRDI QIDQ5408435

Nathan Chong, Jeroen Ketema, Alastair F. Donaldson

Publication date: 10 April 2014

Published in: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.850.3891

zbMATH Keywords

formal verificationabstractionGPUsparallel prefix sum computation

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Formal verification of parallel prefix sum and stream compaction algorithms in CUDA

Uses Software

• CUDA
• KLEE
• OpenCL
• GPUVerify
• GKLEE
• Rodinia

This page was built for publication: A sound and complete abstraction for reasoning about parallel prefix sums