Update README.md
Browse files
README.md
CHANGED
|
@@ -1446,7 +1446,62 @@ configs:
|
|
| 1446 |
path: predtrace-IMP-SOS-uk-human-written/train-*
|
| 1447 |
---
|
| 1448 |
|
| 1449 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1450 |
|
| 1451 |
## Table of Contents
|
| 1452 |
- [About](#about)
|
|
|
|
| 1446 |
path: predtrace-IMP-SOS-uk-human-written/train-*
|
| 1447 |
---
|
| 1448 |
|
| 1449 |
+
<div align="center">
|
| 1450 |
+
<h1>
|
| 1451 |
+
LLMs Lean on Priors, Not Programming Language
|
| 1452 |
+
<span style="white-space: nowrap;">
|
| 1453 |
+
Semantics
|
| 1454 |
+
<img
|
| 1455 |
+
src="https://raw.githubusercontent.com/EngineeringSoftware/PLSemanticsBench/main/docs/logo.png"
|
| 1456 |
+
alt="PLSemanticsBench logo"
|
| 1457 |
+
width="60"
|
| 1458 |
+
style="display: inline-block !important;
|
| 1459 |
+
vertical-align: -1.0em;
|
| 1460 |
+
margin-left: 10px;
|
| 1461 |
+
margin-bottom: 0;">
|
| 1462 |
+
</span>
|
| 1463 |
+
</h1>
|
| 1464 |
+
|
| 1465 |
+
<p style="font-size: 20px;">
|
| 1466 |
+
by
|
| 1467 |
+
<a href="https://www.adityathimmaiah.com">Aditya Thimmaiah</a><sup>1</sup>,
|
| 1468 |
+
<a href="https://jiyangzhang.github.io/">Jiyang Zhang</a><sup>1</sup>,
|
| 1469 |
+
<a href="https://scholar.google.com/citations?user=HtNfeKYAAAAJ&hl=en">Jayanth Srinivasa</a><sup>2</sup>,
|
| 1470 |
+
<a href="https://www.jessyli.com">Junyi Jessy Li</a><sup>1</sup>,
|
| 1471 |
+
<a href="https://users.ece.utexas.edu/~gligoric/">Milos Gligoric</a><sup>1</sup>
|
| 1472 |
+
</p>
|
| 1473 |
+
|
| 1474 |
+
<p>
|
| 1475 |
+
<sup>1</sup>The University of Texas at Austin
|
| 1476 |
+
<sup>2</sup>Cisco Research
|
| 1477 |
+
</p>
|
| 1478 |
+
</div>
|
| 1479 |
+
|
| 1480 |
+
<div align="center">
|
| 1481 |
+
|
| 1482 |
+
[](https://engineeringsoftware.github.io/PLSemanticsBench/)
|
| 1483 |
+
[](https://arxiv.org/pdf/2510.03415v3)
|
| 1484 |
+
[](https://github.com/EngineeringSoftware/PLSemanticsBench)
|
| 1485 |
+
[](https://huggingface.co/datasets/EngineeringSoftware/PLSemanticsBench)
|
| 1486 |
+
|
| 1487 |
+
</div>
|
| 1488 |
+
|
| 1489 |
+
---
|
| 1490 |
+
|
| 1491 |
+
**TLDR:** Frontier LLMs execute programs with up to 90–100% accuracy when symbols retain their usual meanings (e.g., + means addition). Under counterfactual semantic shifts (e.g., redefining + to mean subtraction) accuracy collapses by 40–70 percentage points. Despite handing the complete formal rules, the models keep answering as if the rules were never changed.
|
| 1492 |
+
LLMs don't faithfully interpret the semantics they are given—they retrieve what symbols usually mean from pretraining.
|
| 1493 |
+
|
| 1494 |
+
## Abstract
|
| 1495 |
+
Recent work asks whether large language models (LLMs) condition their reasoning on explicit rules rather than statistical regularities from pre-training.
|
| 1496 |
+
Program execution provides a canonical instance: formal semantics define behavior through symbolic transition rules that can be systematically altered
|
| 1497 |
+
under distribution shift. We investigate whether LLMs can condition their reasoning on formal semantics through program execution and introduce PLSEMANTICSBENCH,
|
| 1498 |
+
pairing featherweight C programs with two semantic systems—small-step operational semantics and K semantics—and probing four capabilities: composing rules for
|
| 1499 |
+
final states, selecting rules when state is unmutated, sustaining such conditioning over long traces, and following supplied rules under novel semantics. To
|
| 1500 |
+
decouple semantic reasoning from syntactic familiarity, we redefine familiar operators to induce symbol-meaning conflict and introduce novel symbols defined only
|
| 1501 |
+
through the supplied rules, and stress-test models on Human-Written, LLM-Translated, and Fuzzer-Generated splits with increasing structural complexity. Across
|
| 1502 |
+
11 frontier LLMs, strong final-state accuracy under standard semantics (up to 90%) drops sharply—by as much as 40–60% points—under semantic mutations and increasing
|
| 1503 |
+
structural complexity. Only a handful of models achieve non-zero long-horizon conditioning accuracy, and even the best systems reach just 35%. Together, these results
|
| 1504 |
+
suggest that contemporary LLMs often rely on pretrained lexical associations rather than systematically conditioning on supplied formal rules.
|
| 1505 |
|
| 1506 |
## Table of Contents
|
| 1507 |
- [About](#about)
|