Programming Languages Papers of the Week

Conclusion This study demonstrates the potential of LLMs to assist in architectural refactoring tasks and provides insights into optimizing their use through tailored prompting and retrieval techniques.

However, parsing the format is non-trivial and can become a bottleneck, e.g. when retrieving benchmark metadata or normalising the input for solvers. We introduce blazing-smtlib, a Rust parsing library for SMT-LIB, and BSmtLib, its port to Lean.

Hardware profilers report how busy each unit was, not where each warp's time went; intra-kernel tracers can show it, but only with hand-placed probes and a recompilation that alters the very kernel being measured. We present Warpline, which gives agents this view automatically while leaving the kernel essentially unchanged.

Despite being a nearly universal practice, systematic study has been limited because these logs are ephemeral: they usually remain only in local environments and are removed before code is committed, making them difficult to capture. In this work, we addressed this challenge by mining accidental commits where developers unintentionally left ad-hoc logs and later deleted them, and by analyzing live-streamed programming sessions to observe their use in practice.

By providing a concrete semantics that formally describes the Aliasing XOR Mutability discipline, we prove the soundness of this abstract interpretation, from which we derive memory safety of checked programs.

This paper will show the traditional financial modelling techniques for spreadsheets can be replaced by radically different approaches that have significant gains in readability, performance and flexibility.

In this work, we investigate the effectiveness of LLMs in code translation and translation error repair.

We present \textsf{MBUndo}, an integrated compiler pass that automatically converts circuits to measurement-based uncomputation.

The thematic analysis identifies Banking Security as the only Motor theme and Service Logistics as a Basic theme, whereas AI Finance and Banking Cybersecurity occupy Marginal positions despite their greater citation visibility.

However, some programming paradigms do not take their semantics in a cartesian setting; this is the case for concurrency, reversible and quantum programming for example. In this paper, we focus on reversible programming through its categorical model in dagger categories, which are categories that contain an involutive operator on morphisms.

In this paper, we conduct a comprehensive study of GPU-NBs by analyzing 397 real-world bug samples from GitHub.

The goal of our extension is to support representation and reasoning about context-dependent effects in the most painless way possible.

This study examines GPT model outputs of novel and correct, and notably very insecure, versions of implementations of the cryptographic hash function SHA-1.

We present $\lambda_{\mathsf{SCE}}$, a simply typed calculus in which linking, modules, and environments are all first-class.

Languages that target hardware accelerators typically expose a restricted, first-order core without recursion or first-class functions, leaving programmers without a principled way to express computational effects. This paper presents a technique for compiling effect handlers to such a constrained target.

We present the first empirical study of miscompilation as a threat to zkVM guarantees, on the production zkVMs SP1 and Jolt.

We developed WFDB-x, a cross-language, performance-optimized reimplementation of WFDB in seven programming languages, with extensive unit tests, to provide consistent WFDB processing across programming languages.

Goldblatt bypasses this restriction by using intricate order-theoretic completion arguments to prove completeness. In this article, we present a conservative extension of relational cover semantics that alleviates this restriction and is amenable to simpler and standard model construction techniques.

Although coding agents have been explored for automated proof construction, existing Verus benchmarks offer limited coverage of concurrency-specific examples that connect atomic operations to abstract protocols. To address this gap, we introduce VerusWeave, the first benchmark dedicated to concurrent proof repair, derived from four open-source projects.

In this paper, we present an algebra of recurrences over semirings and study algebraic identities that enable vectorization.