The automated proof of a trace transformation for a bitonic sort
From MaRDI portal
Publication:1822503
DOI10.1016/0304-3975(86)90033-2zbMath0618.68053OpenAlexW2091172700MaRDI QIDQ1822503
Christian Lengauer, Chua-Huang Huang
Publication date: 1986
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(86)90033-2
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Parallelization of divide-and-conquer in the Bird-Meertens formalism ⋮ Odd-even sort in powerlists ⋮ On optimal parallelization of sorting networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compiler specification and verification
- A methodology for programming with concurrency: An informal presentation
- A methodology for programming with concurrency: The formalism
- On the role of automated theorem proving in the compile-time derivation of concurrency
- Automatic program verification. I: A logical basis and its implementation
- Mechanical proofs about computer programs
- Programming as a Discipline of Mathematical Nature
This page was built for publication: The automated proof of a trace transformation for a bitonic sort
