|
Download README.md from EngineeringSoftware/PLSemanticsBench: direct link, hf CLI and curl.
- Browser
- Download file 15.8 kB
-
https://huggingface.co/datasets/EngineeringSoftware/PLSemanticsBench/resolve/main/README.md
- Command line
-
hf download hf://datasets/EngineeringSoftware/PLSemanticsBench/README.md
-
curl -L -o README.md https://huggingface.co/datasets/EngineeringSoftware/PLSemanticsBench/resolve/main/README.md
15.8 kB
| license: cc-by-4.0 | |
| configs: | |
| - config_name: nl2rule | |
| data_files: | |
| - split: K_Standard_NumRule5 | |
| path: nl2rule/K_Standard_NumRule5-* | |
| - split: K_NonStandard_NumRule5 | |
| path: nl2rule/K_NonStandard_NumRule5-* | |
| - split: S_Standard_NumRule5 | |
| path: nl2rule/S_Standard_NumRule5-* | |
| - split: S_NonStandard_NumRule5 | |
| path: nl2rule/S_NonStandard_NumRule5-* | |
| - config_name: rule2nl | |
| data_files: | |
| - split: K_Standard_NumDescription5 | |
| path: rule2nl/K_Standard_NumDescription5-* | |
| - split: K_NonStandard_NumDescription5 | |
| path: rule2nl/K_NonStandard_NumDescription5-* | |
| - split: S_Standard_NumDescription5 | |
| path: rule2nl/S_Standard_NumDescription5-* | |
| - split: S_NonStandard_NumDescription5 | |
| path: rule2nl/S_NonStandard_NumDescription5-* | |
| - config_name: predrule | |
| data_files: | |
| - split: K_Standard_Human_Written | |
| path: predrule/K_Standard_Human_Written-* | |
| - split: K_NonStandard_Human_Written | |
| path: predrule/K_NonStandard_Human_Written-* | |
| - split: S_Standard_Human_Written | |
| path: predrule/S_Standard_Human_Written-* | |
| - split: S_NonStandard_Human_Written | |
| path: predrule/S_NonStandard_Human_Written-* | |
| - config_name: predstate | |
| data_files: | |
| - split: K_Standard_Human_Written | |
| path: predstate/K_Standard_Human_Written-* | |
| - split: K_NonStandard_Human_Written | |
| path: predstate/K_NonStandard_Human_Written-* | |
| - split: S_Standard_Human_Written | |
| path: predstate/S_Standard_Human_Written-* | |
| - split: S_NonStandard_Human_Written | |
| path: predstate/S_NonStandard_Human_Written-* | |
| - split: K_Standard_LLM_Translated | |
| path: predstate/K_Standard_LLM_Translated-* | |
| - split: K_NonStandard_LLM_Translated | |
| path: predstate/K_NonStandard_LLM_Translated-* | |
| - split: S_Standard_LLM_Translated | |
| path: predstate/S_Standard_LLM_Translated-* | |
| - split: S_NonStandard_LLM_Translated | |
| path: predstate/S_NonStandard_LLM_Translated-* | |
| - split: K_Standard_Fuzzer_Generated | |
| path: predstate/K_Standard_Fuzzer_Generated-* | |
| - split: K_NonStandard_Fuzzer_Generated | |
| path: predstate/K_NonStandard_Fuzzer_Generated-* | |
| - split: S_Standard_Fuzzer_Generated | |
| path: predstate/S_Standard_Fuzzer_Generated-* | |
| - split: S_NonStandard_Fuzzer_Generated | |
| path: predstate/S_NonStandard_Fuzzer_Generated-* | |
| - config_name: predtrace | |
| data_files: | |
| - split: K_Standard_Human_Written | |
| path: predtrace/K_Standard_Human_Written-* | |
| - split: K_NonStandard_Human_Written | |
| path: predtrace/K_NonStandard_Human_Written-* | |
| - split: S_Standard_Human_Written | |
| path: predtrace/S_Standard_Human_Written-* | |
| - split: S_NonStandard_Human_Written | |
| path: predtrace/S_NonStandard_Human_Written-* | |
| <div align="center"> | |
| <p>The 43rd International Conference on Machine Learning (ICML 2026), Seoul, South Korea</p> | |
| <h1> | |
| LLMs Lean on Priors, Not Programming Language | |
| <span style="white-space: nowrap;"> | |
| Semantics | |
| <img | |
| src="https://raw.githubusercontent.com/EngineeringSoftware/PLSemanticsBench/main/docs/icons/logo.png" | |
| alt="PLSemanticsBench logo" | |
| width="60" | |
| style="display: inline-block !important; | |
| vertical-align: -1.0em; | |
| margin-left: 10px; | |
| margin-bottom: 0;"> | |
| </span> | |
| </h1> | |
| <p style="font-size: 20px;"> | |
| by | |
| <a href="https://www.adityathimmaiah.com">Aditya Thimmaiah</a><sup>1</sup>, | |
| <a href="https://jiyangzhang.github.io/">Jiyang Zhang</a><sup>1</sup>, | |
| <a href="https://scholar.google.com/citations?user=HtNfeKYAAAAJ&hl=en">Jayanth Srinivasa</a><sup>2</sup>, | |
| <a href="https://www.jessyli.com">Junyi Jessy Li</a><sup>1</sup>, | |
| <a href="https://users.ece.utexas.edu/~gligoric/">Milos Gligoric</a><sup>1</sup> | |
| </p> | |
| <p> | |
| <sup>1</sup>The University of Texas at Austin | |
| <sup>2</sup>Cisco Research | |
| </p> | |
| </div> | |
| <div align="center"> | |
| [](https://engineeringsoftware.github.io/PLSemanticsBench/) | |
| [](https://arxiv.org/pdf/2510.03415v3) | |
| [](https://github.com/EngineeringSoftware/PLSemanticsBench) | |
| [](https://huggingface.co/datasets/EngineeringSoftware/PLSemanticsBench) | |
| </div> | |
| --- | |
| **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. | |
| LLMs don't faithfully interpret the semantics they are given—they retrieve what symbols usually mean from pretraining. | |
| ## Abstract | |
| Recent work asks whether large language models (LLMs) condition their reasoning on explicit rules rather than statistical regularities from pre-training. | |
| Program execution provides a canonical instance: formal semantics define behavior through symbolic transition rules that can be systematically altered | |
| under distribution shift. We investigate whether LLMs can condition their reasoning on formal semantics through program execution and introduce PLSEMANTICSBENCH, | |
| pairing featherweight C programs with two semantic systems—small-step operational semantics and K semantics—and probing four capabilities: composing rules for | |
| final states, selecting rules when state is unmutated, sustaining such conditioning over long traces, and following supplied rules under novel semantics. To | |
| decouple semantic reasoning from syntactic familiarity, we redefine familiar operators to induce symbol-meaning conflict and introduce novel symbols defined only | |
| through the supplied rules, and stress-test models on Human-Written, LLM-Translated, and Fuzzer-Generated splits with increasing structural complexity. Across | |
| 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 | |
| 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 | |
| suggest that contemporary LLMs often rely on pretrained lexical associations rather than systematically conditioning on supplied formal rules. | |
| ## Table of Contents | |
| - [About](#about) | |
| - [Installation](#installation) | |
| - [Quick Start](#quick-start) | |
| - [Detailed Usage](#detailed-usage) | |
| - [Benchmark](#benchmark) | |
| - [Citation](#citation) | |
| ## About | |
| PLSemanticsBench is the first counterfactual programming language (PL) semantics dataset for evaluating rule-conditioned reasoning in LLMs. | |
| It contains the semantics formalization of `C*`, a featherweight C programming language, in two approaches: small-step | |
| operational semantics and the K-framework semantics. Execution of `C*` programs under counterfactual and standard semantics is then used as a | |
| lens for evaluating rule-conditioned reasoning in LLMs via three tasks: | |
| | Task | Description | | |
| |------|-------------| | |
| | ✨ **PredState**| Predict the final program state | | |
| | ✨ **PredRule** | Predict the ordered sequence of semantic rules needed to evaluate a program| | |
| | ✨ **PredTrace**| Predict the step-by-step execution of a program | | |
| It also includes the auxiliary tasks below, to rule out formal notation understanding as an influencing | |
| factor: | |
| | Task | Description | | |
| |------|-------------| | |
| | ✨ **NL2Rule**| Select the correct formal semantic rule (out of 5) given its natural language description | | |
| | ✨ **Rule2NL** | Select the correct natural language description (out of 5) given the formal semantic rule| | |
| ## Installation | |
| ### System Requirements | |
| - [Conda](https://docs.conda.io/projects/conda/en/stable/user-guide/install/index.html) package management system | |
| - Python 3.11 or higher | |
| - OpenAI API key (for running experiments with OpenAI models) | |
| ### Step-by-Step Installation | |
| 1. Create and activate the conda environment: | |
| ```bash | |
| conda env create -f env.yaml | |
| conda activate plsemanticsbench | |
| ``` | |
| 2. Set up your OpenAI API key (only for OpenAI models): | |
| ```bash | |
| export OPENAI_API_KEY='your-api-key-here' | |
| ``` | |
| ## Quick Start | |
| We provide a bash script `quick` that: | |
| 1. Sets up the `plsemanticsbench` conda environment. | |
| 2. Pulls the `DeepSeek-R1 1.5B` model. | |
| 3. Evaluates the `DeepSeek-R1 1.5B` model on the `PredState` task with `no-semantics` and `chain-of-thought` prompting on the `Human-Written` dataset. | |
| 4. Prints the `accuracy` and `malformed-count` to screen. | |
| 5. Creates `metrics-predstate-deepseek-r1:1.5b.json` that contains the evaluation result. | |
| ```bash | |
| bash quick | |
| ``` | |
| ## Detailed Usage | |
| ### Basic Example | |
| Here's a minimal example to get started: | |
| ```python | |
| from plsemanticsbench import GPTRunner | |
| from plsemanticsbench import ExperimentArgs, LLMEvaluator | |
| from plsemanticsbench import ( | |
| PROMPT_STRATEGY, | |
| Task, | |
| Formalization, | |
| Semantics_Type, | |
| Language, | |
| PLDataset | |
| ) | |
| # Model name | |
| model_name = "o3-mini" | |
| # Experiment args: Run the PredState task on the C* language with | |
| # standard semantics formalized using SOS and with direct prompting | |
| exp_args = ExperimentArgs( | |
| dataset=PLDataset.Human_Written, | |
| task=Task.PredState, | |
| language=Language.CSTAR, | |
| formalization=Formalization.SOS, | |
| semantics_type=Semantics_Type.Standard, | |
| model_name=model_name, | |
| prompt_strategy=PROMPT_STRATEGY.DA, | |
| num_datapoints_to_run=2, # Run just 2 datapoints (omit to run entire dataset) | |
| ) | |
| # Run inference using the OpenAI API | |
| gpt_runner = GPTRunner(args=exp_args) | |
| # Generation (generate LLM prediction on the predstate task) | |
| predictions = gpt_runner.do_experiment() # path to dump results can be provided | |
| # Evaluation (evaluate LLM prediction against ground-truth) | |
| llm_eval = LLMEvaluator(task=exp_args.task, semantics_type=exp_args.semantics_type) | |
| evaluation_result = llm_eval.evaluate_from_list(results=predictions, model_name=model_name) | |
| print(evaluation_result) | |
| ``` | |
| ### Expected Output | |
| ```python | |
| { | |
| 'accuracy': 1, | |
| 'malformed-count': 0, | |
| } | |
| ``` | |
| ### Extending Providers | |
| You must implement [BaseRunner](https://github.com/EngineeringSoftware/PLSemanticsBench/blob/main/src/plsemanticsbench/core/exps/base_experiment.py)(`_query` method) to evaluate your models. We provide two example implementations for OpenAI models ([GPTRunner](https://github.com/EngineeringSoftware/PLSemanticsBench/blob/main/src/plsemanticsbench/core/exps/gpt_experiment.py)) and Ollama models ([OllamaRunner](https://github.com/EngineeringSoftware/PLSemanticsBench/blob/main/src/plsemanticsbench/core/exps/ollama_experiment.py)). | |
| ## Dataset | |
| ### Access | |
| You can load the dataset using the `datasets` library. Here is an example: | |
| ```python | |
| from datasets import load_dataset | |
| # Load PredState task with standard semantics under K formalization for the LLM Translated dataset | |
| predstate_K_standard_llm_translated = load_dataset("EngineeringSoftware/PLSemanticsBench", name="predstate")["K_Standard_LLM_Translated"] | |
| # Load PredRule task with nonstandard semantics under S formalization for the Human Written dataset | |
| predrule_S_nonstandard_human_written = load_dataset("EngineeringSoftware/PLSemanticsBench", name="predrule")["S_NonStandard_Human_Written"] | |
| # Load nl2rule task with standard semantics under S formalization | |
| nl2rule_S_standard = load_dataset("EngineeringSoftware/PLSemanticsBench", name="nl2rule")["S_Standard_NumRule5"] | |
| ``` | |
| ### Splits | |
| <table> | |
| <tr> | |
| <th>Task</th> | |
| <th>Split</th> | |
| <th>Description</th> | |
| </tr> | |
| <tr> | |
| <td rowspan="4">✨ <strong>PredState</strong><br>(Final State Prediction)</td> | |
| <td> predstate/K_Standard_{dataset-name} </td> | |
| <td>Standard semantics with K formalization</td> | |
| </tr> | |
| <tr> | |
| <td> predstate/K_NonStandard_{dataset-name} </td> | |
| <td>Nonstandard semantics with K formalization</td> | |
| </tr> | |
| <tr> | |
| <td> predstate/S_Standard_{dataset-name} </td> | |
| <td>Standard semantics with S formalization</td> | |
| </tr> | |
| <tr> | |
| <td> predstate/S_NonStandard_{dataset-name} </td> | |
| <td>Nonstandard semantics with S formalization</td> | |
| </tr> | |
| <tr> | |
| <td rowspan="4">✨ <strong>PredRule</strong><br>(Semantic Rule Prediction)</td> | |
| <td> predrule/K_Standard_Human_Written </td> | |
| <td>Standard semantics with K formalization</td> | |
| </tr> | |
| <tr> | |
| <td> predrule/K_NonStandard_Human_Written </td> | |
| <td>Nonstandard semantics with K formalization</td> | |
| </tr> | |
| <tr> | |
| <td> predrule/S_Standard_Human_Written </td> | |
| <td>Standard semantics with S formalization</td> | |
| </tr> | |
| <tr> | |
| <td> predrule/S_NonStandard_Human_Written </td> | |
| <td>Nonstandard semantics with S formalization</td> | |
| </tr> | |
| <tr> | |
| <td rowspan="4">✨ <strong>PredTrace</strong><br>(Execution Trace Prediction)</td> | |
| <td> predtrace/K_Standard_Human_Written </td> | |
| <td>Standard semantics with K formalization</td> | |
| </tr> | |
| <tr> | |
| <td> predtrace/K_NonStandard_Human_Written </td> | |
| <td>Nonstandard semantics with K formalization</td> | |
| </tr> | |
| <tr> | |
| <td> predtrace/S_Standard_Human_Written </td> | |
| <td>Standard semantics with S formalization</td> | |
| </tr> | |
| <tr> | |
| <td> predtrace/S_NonStandard_Human_Written </td> | |
| <td>Nonstandard semantics with S formalization</td> | |
| </tr> | |
| <tr> | |
| <td colspan="3" align="center"><strong>Auxiliary Tasks (formal notation understanding)</strong></td> | |
| </tr> | |
| <tr> | |
| <td rowspan="4">✨ <strong>NL2Rule</strong><br>(Natural language description to semantic rule)</td> | |
| <td> nl2rule/K_Standard_NumRule5 </td> | |
| <td>Standard semantics with K formalization</td> | |
| </tr> | |
| <tr> | |
| <td> nl2rule/K_NonStandard_NumRule5 </td> | |
| <td>Nonstandard semantics with K formalization</td> | |
| </tr> | |
| <tr> | |
| <td> nl2rule/S_Standard_NumRule5 </td> | |
| <td>Standard semantics with S formalization</td> | |
| </tr> | |
| <tr> | |
| <td> nl2rule/S_NonStandard_NumRule5 </td> | |
| <td>Nonstandard semantics with S formalization</td> | |
| </tr> | |
| <tr> | |
| <td rowspan="4">✨ <strong>Rule2NL</strong><br>(Semantic rule to natural language description)</td> | |
| <td> rule2nl/K_Standard_NumDescription5 </td> | |
| <td>Standard semantics with K formalization</td> | |
| </tr> | |
| <tr> | |
| <td> rule2nl/K_NonStandard_NumDescription5 </td> | |
| <td>Nonstandard semantics with K formalization</td> | |
| </tr> | |
| <tr> | |
| <td> rule2nl/S_Standard_NumDescription5 </td> | |
| <td>Standard semantics with S formalization</td> | |
| </tr> | |
| <tr> | |
| <td> rule2nl/S_NonStandard_NumDescription5 </td> | |
| <td>Nonstandard semantics with S formalization</td> | |
| </tr> | |
| </table> | |
| ### Example Data Point | |
| An example of a data point from the `predstate/None-human-written` split: | |
| ```json | |
| { | |
| "program": "int ans; ans = 1; ...", | |
| "syntax": "<program> :: ...", | |
| "semantics": "ℤ := Set of integers ...", | |
| "mutated-program": "int ans; ans = 1; ...", | |
| "mutation-pattern": "KeyWordSwap", | |
| "exec-trace": [ | |
| { | |
| "linenumber": 1, | |
| "rule": ["Rule 38", "Rule 39"], | |
| "state": {"ans": 1} | |
| } | |
| ], | |
| "ground-truth": "<answer>...</answer>" | |
| } | |
| ``` | |
| ## Citation | |
| ```bibtex | |
| @inproceedings{ThimmaiahETAL25PLSemanticsBench, | |
| title = {LLMs Lean on Priors, Not Programming Language Semantics}, | |
| author = {Aditya Thimmaiah, Jiyang Zhang, Jayanth Srinivasa, Junyi Jessy Li, Milos Gligoric}, | |
| year = {2026}, | |
| booktitle = {ICML}, | |
| } | |
| ``` | |
| ## License | |
| This project is licensed under the [CC BY 4.0 License](https://creativecommons.org/licenses/by/4.0/). | |