# Semantic-Type-Guided Bug Finding

Source: [Semantic-Type-Guided Bug Finding](<https://www.sota2.com/research/paper/68fa74e91e209131cea64a8a>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-26T03:21:26.418Z

Authors: Kelvin Qian, Scott Smith, Brandon Stride, Shiwei Weng, Ke Wu

Published: 2024-09-20T20:53:21.000Z

## Abstract

In recent years, there has been an increased interest in tools that establish \\emph{incorrectness} rather than correctness of program properties. In this work we build on this approach by developing a novel methodology to prove incorrectness of \\emph{semantic typing} properties of functional programs, extending the incorrectness approach to the model theory of functional program typing. We define a semantic type refuter which refutes semantic typings for a simple functional language. We prove our refuter is co-recursively enumerable, and that it is sound and complete with respect to a semantic typing notion. An initial implementation is described which uses symbolic evaluation to efficiently find type errors over a functional language with a rich type system.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2409.13896>)

[PDF](<https://arxiv.org/pdf/2409.13896.pdf>)
