pith. sign in
Pith Number

pith:UP3BLD6V

pith:2026:UP3BLD6VTHMQKBP3DV2ZGSGZ2U
not attested not anchored not stored refs resolved

Source-to-Source Transformations for GPU Code Generation

Arthur Chargu\'eraud, Cl\'ement Pit-Claudel, Julien de Castelnau, Thomas Koehler

OptiGPU turns verified CPU programs into optimized GPU code through proof-preserving source-to-source transformations.

arxiv:2605.13864 v1 · 2026-04-30 · cs.PL

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{UP3BLD6VTHMQKBP3DV2ZGSGZ2U}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp
2 Internet Archive
3 Author claim open · sign in to claim
4 Citations open
5 Replications open
Portable graph bundle live · download bundle · merged state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

OptiGPU applies proof-preserving compilation to GPU programming, allowing verification of low-level, optimized GPU programs through refinement of simple, verified CPU programs via source-to-source transformations that automatically preserve proofs.

C2weakest assumption

The source-to-source transformations correctly model essential GPU features including kernel launches, shared memory, and synchronous barriers while preserving the proofs of data race freedom, deadlock freedom, and functional correctness.

C3one line summary

OptiGPU enables proof-preserving source-to-source compilation to generate safe CUDA code from verified CPU programs by modeling GPU features like kernels, shared memory, and barriers.

References

25 extracted · 25 resolved · 0 Pith anchors

[1] Izumi Asakura, Hidehiko Masuhara, and Tomoyuki Aotani. 2016. Proof of Soundness of Concurrent Separation Logic for GPGPU in Coq. Journal of Information Processing 24, 1 (2016), 132–140. https://doi.or 2016 · doi:10.2197/ipsjjip.24.132
[2] Fabian Bannwart and Peter Müller. 2005. A Program Logic for Bytecode. Electronic Notes in Theoretical Computer Science 141, 1 (2005), 255–273. https://doi.org/ https:// doi.org/10.1016/j.entcs.2005.02 2005 · doi:10.1016/j.entcs.2005.02.026
[3] Cutler, Saman Amarasinghe, and Jonathan Ragan-Kelley 2025
[4] Guillaume Bertholon. 2025. Interactive compilation via trustworthy source-to-source transformations. Theses. Retrieved from https://theses.hal.science/tel-05302456 2025
[5] Adam Betts, Nathan Chong, Alastair Donaldson, Shaz Qadeer, and Paul Thomson
Receipt and verification
First computed 2026-05-17T23:39:19.400098Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

a3f6158fd599d90505fb1d759348d9d53cb2223a318299167b83bb47cb592608

Aliases

arxiv: 2605.13864 · arxiv_version: 2605.13864v1 · doi: 10.48550/arxiv.2605.13864 · pith_short_12: UP3BLD6VTHMQ · pith_short_16: UP3BLD6VTHMQKBP3 · pith_short_8: UP3BLD6V
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/UP3BLD6VTHMQKBP3DV2ZGSGZ2U \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: a3f6158fd599d90505fb1d759348d9d53cb2223a318299167b83bb47cb592608
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "d80f0c3cddf3b173cb25b181843110318bcc634a13ded83d492f08fc447af7f7",
    "cross_cats_sorted": [],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "cs.PL",
    "submitted_at": "2026-04-30T17:27:10Z",
    "title_canon_sha256": "43a905c5a228de393201aa39f952812b4c4d7d50fd79610dc213b5e2bac6c570"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.13864",
    "kind": "arxiv",
    "version": 1
  }
}