Semantic Reification: A New Paradigm for Random Program Generation
Semantic reification is a new approach to random program generation that focuses on program semantics instead of syntax. It captures both compile-time and runtime semantics to ensure generated programs are well-behaved and produce expected outputs. The implementation, called Reify, has successfully identified numerous bugs in existing compilers, highlighting its potential for broader applications in software validation.
- ▪Semantic reification emphasizes program semantics over syntax for random program generation.
- ▪It captures compile-time and runtime semantics to ensure well-behaved program outputs.
- ▪The Reify implementation has uncovered 59 bugs in GCC and LLVM, including high-priority issues.
Hacker News (Newest) files mainly under programming. We currently carry 5,306 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | Sigplan |
| Canonical URL | https://pldi26.sigplan.org/details/pldi-2026-papers/25/Semantic-Reification-A-New-Paradigm-for-Random-Program-Generation |
| Publication time | Wed, 03 Jun 2026 05:07:36 +0000 |
| Retrieval time | 2026-06-03T05:41:56.797Z |
| Last seen | 2026-06-03T05:41:56.797Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | und79_xp39nQ |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
We introduce semantic reification, a novel paradigm for random program generation that centers on program semantics rather than syntax. Our key insight is to reformulate random program generation to capture two types of program semantics: (1) compile-time semantics (what a program can do), represented by the control flow graph (CFG), and (2) runtime semantics (what a program actually does), represented by execution paths within the CFG. For any CFG and any execution path on it, semantic reification constructs a program guaranteed to be well-behaved with respect to a specific input and output. This means that when executed with this input, the program deterministically follows the designated execution path to produce the expected output.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Sigplan.
Discussion
0 commentsMore from Sigplan
