output
20112026
most citedAn Inductive Synthesis Framework for Verifiable Reinforcement Learning

52 citations

Showing cs.PLShow all

6 papers · 1 filter

cs.PL2026

CNnotator: LLM-Guided Memory Safety Annotation Synthesis

Twain Byrnes, Mike Dodds

Memory safety errors account for a large proportion of security bugs in systems written in C; modern languages such as Java and Rust prevent such bugs because they are memory-safe…

cs.PL2025

The CoCompiler: DSL Lifting via Relational Compilation

Naomi Spargo, Santiago Cuéllar, Jonathan Daugherty +2

Lifting low-level or legacy code into a domain-specific language (DSL) improves our ability to understand it, enables deeper formal reasoning, and facilitates safe modification. We…

cs.PL2024★ 9 cited

KATch: A Fast Symbolic Verifier for NetKAT

Mark Moeller, Jules Jacobs, Olivier Savary Belanger +5

We develop new data structures and algorithms for checking verification queries in NetKAT, a domain-specific language for specifying the behavior of network data planes. Our result…

cs.PL2019★ 3 cited

Fine-Grained, Language-Based Access Control for Database-Backed Applications

Ezra Zigmond, Stephen Chong, Christos Dimoulas +1

Context: Database-backed applications often run queries with more authority than necessary. Since programs can access more data than they legitimately need, flaws in security check…

cs.PL2019★ 1 cited

Relational Verification via Invariant-Guided Synchronization

Qi Zhou, David Heath, William Harris

Relational properties describe relationships that hold over multiple executions of one or more programs, such as functional equivalence. Conventional approaches for automatically v…

cs.PL2011

ForOpenCL: Transformations Exploiting Array Syntax in Fortran for Accelerator Programming

Matthew J. Sottile, Craig E Rasmussen, Wayne N. Weseloh +3

Emerging GPU architectures for high performance computing are well suited to a data-parallel programming model. This paper presents preliminary work examining a programming methodo…