works on

From the 9 of 204 papers with an AI index.

most citedSolving QBF with Counterexample Guided Refinement

150 citations

Showing cs.PLShow all

6 papers · 1 filter

cs.PL20261 cited

Let it Flow: A Formally Verified Compilation Framework for Asynchronous Dataflow

Zhengyao Lin, Yi Cai, Milijana Surbatovich

Dataflow architectures have gained renewed interest due to their balance between power efficiency and performance. In (spatial) dataflow architectures, a program is represented as…

cs.PL2026

Potential Functions as Types

Harrison Grodin, Ethan Chu, Runming Li +2

Amortized analysis can be framed from the physicist's view, amenable to manual verification in dependent type theory using potential functions, and the banker's view, amenable to a…

cs.PL2026

GradInf: Gradient Estimation as Probabilistic Inference

Gaurav Arya, Mathieu Huot, Moritz Schauer +2

Gradient estimation -- the task of computing the gradient of the expected value of a probabilistic program -- has diverse applications in scientific computing, but is notoriously d…

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.PL202611 cited

Decalf: A Directed, Effectful Cost-Aware Logical Framework

Harrison Grodin, Yue Niu, Jonathan Sterling +1

We present Decalf, a directed, effectful cost-aware logical framework for studying quantitative aspects of functional programs with effects. Like Calf, the language is based on an…

cs.PL2026

Handling Exceptions and Effects with Automatic Resource Analysis

Ethan Chu, Yiyang Guo, Jan Hoffmann

There exist many techniques for automatically deriving parametric resource (or cost) bounds by analyzing the source code of a program. These techniques work effectively for a large…