The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.
Mechanised Semantics for Gated Static Single Assignment
The work
| Authors | Yann Herklotz; Delphine Demange; Sandrine Blazy |
|---|---|
| Editors | |
| Type | misc |
| Year | 2023 |
| Citekey | herklotz2023mechanised |
Where it appeared
| Published in | ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP) |
|---|---|
| Pages | 182--196 |
Identifiers
| DOI | 10.1145/3573105.3575681 |
|---|---|
| OpenAlex | W4315630515 |
Access
| Landing page | https://doi.org/10.1145/3573105.3575681 |
|---|---|
| Free full text | https://dl.acm.org/doi/pdf/10.1145/3573105.3575681 |
From OpenAlex, which stores abstracts as an index of words and their positions: what is shown is rebuilt from that, and reads fluently whether or not it is what the author wrote.
Abstract
The Gated Static Single Assignment (GSA) form was proposed by Ottenstein et al. in 1990, as an intermediate representation for implementing advanced static analyses and optimisation passes in compilers. Compared to SSA, GSA records additional data dependencies and provides more context, making optimisations more effective and allowing one to reason about programs as data-flow graphs.
How it got here
| How it got here | agent via openalex |
|---|---|
| Added | 2026-10-25 20:43 UTC |
| Not denied by | a person 2026-10-29 17:12 UTC |
Cite it as
@misc{herklotz2023mechanised,
title = {Mechanised Semantics for Gated Static Single Assignment},
author = {Yann Herklotz and Delphine Demange and Sandrine Blazy},
year = {2023},
journal = {ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP)},
pages = {182--196},
doi = {10.1145/3573105.3575681},
}
This record lives at https://refs.drheap.org/herklotz2023mechanised/ and will keep doing so.