Pleasant Imperative Program Proofs with GallinaC. arxiv.org/abs/2509.13019

Navigating the Python Type Jungle. arxiv.org/abs/2509.13022

Try-Mopsa: Relational Static Analysis in Your Pocket. arxiv.org/abs/2509.13128

Rebound: Efficient, Expressive, and Well-Scoped Binding. arxiv.org/abs/2509.13261

The Hidden Strength of Costrong Functors. arxiv.org/abs/2509.13026

Enhancing Automated Loop Invariant Generation for Complex Programs with Large Language Models. arxiv.org/abs/2412.10483

Catalpa: GC for a Low-Variance Software Stack. arxiv.org/abs/2509.13429

Extended Abstract: Towards a Performance Comparison of Syntax and Type-Directed NbE. arxiv.org/abs/2509.13489

CLMTracing: Black-box User-level Watermarking for Code Language Model Tracing. arxiv.org/abs/2509.13982

Parallelizable Feynman-Kac Models for Universal Probabilistic Programming. arxiv.org/abs/2509.14092

Multi-Threaded Software Model Checking via Parallel Trace Abstraction Refinement. arxiv.org/abs/2509.13699

DeliverC: Teaching Pointers through GenAI-Powered Game-Based Learning. arxiv.org/abs/2509.14496

Refinement-Types Driven Development: A study. arxiv.org/abs/2509.15005

A Taxonomy of Prompt Defects in LLM Systems. arxiv.org/abs/2509.14404

Automating Modelica Module Generation Using Large Language Models: A Case Study on Building Control Description Language. arxiv.org/abs/2509.14623

SWE-QA: Can Language Models Answer Repository-level Code Questions?. arxiv.org/abs/2509.14635

SALT4Decompile: Inferring Source-level Abstract Logic Tree for LLM-Based Binary Decompilation. arxiv.org/abs/2509.14646

Theorem Provers: One Size Fits All?. arxiv.org/abs/2509.15015

Code Less to Code More: Streamlining Language Server Protocol and Type System Development for Language Families. arxiv.org/abs/2509.15150

Mini-Batch Robustness Verification of Deep Neural Networks. arxiv.org/abs/2508.15454