Single Static Assignment - significado y definición. Qué es Single Static Assignment
Diclib.com
Diccionario ChatGPT
Ingrese una palabra o frase en cualquier idioma 👆
Idioma:

Traducción y análisis de palabras por inteligencia artificial ChatGPT

En esta página puede obtener un análisis detallado de una palabra o frase, producido utilizando la mejor tecnología de inteligencia artificial hasta la fecha:

  • cómo se usa la palabra
  • frecuencia de uso
  • se utiliza con más frecuencia en el habla oral o escrita
  • opciones de traducción
  • ejemplos de uso (varias frases con traducción)
  • etimología

Qué (quién) es Single Static Assignment - definición

INTERMEDIATE REPRESENTATION (IR) IN WHICH EACH VARIABLE IS ASSIGNED EXACTLY ONCE, AND EVERY VARIABLE IS DEFINED BEFORE IT IS USED
SSA form; SSA Form; SSA (compilers); SSAF; Static single assignment; Single static assignment; SSA optimisation algorithm; Static single-assignment representation; Static single assignment representation; Static Single Assignment; Static Single Assignment form; SSA (computing); Static single assignment form

Static single assignment form         
In compiler design, static single assignment form (often abbreviated as SSA form or simply SSA) is a property of an intermediate representation (IR), which requires that each variable be assigned exactly once, and every variable be defined before it is used. Existing variables in the original IR are split into versions, new variables typically indicated by the original name with a subscript in textbooks, so that every definition gets its own version.
single static assignment         
<compiler> (Also known as SSA form) A special form of code where each variable has only one single definition in the program code. "Static" comes from the fact that the definition site may be in a loop, thus dynamically executed several times. SSA form is used for program optimization or static analysis and optimisation. (2003-04-12)
Static single-assignment form         
In compiler design, static single assignment form (often abbreviated as SSA form or simply SSA) is a property of an intermediate representation (IR), which requires that each variable be assigned exactly once, and every variable be defined before it is used. Existing variables in the original IR are split into versions, new variables typically indicated by the original name with a subscript in textbooks, so that every definition gets its own version.

Wikipedia

Static single-assignment form

In compiler design, static single assignment form (often abbreviated as SSA form or simply SSA) is a property of an intermediate representation (IR) that requires each variable to be assigned exactly once and defined before it is used. Existing variables in the original IR are split into versions, new variables typically indicated by the original name with a subscript in textbooks, so that every definition gets its own version. In SSA form, use-def chains are explicit and each contains a single element.

SSA was proposed by Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck in 1988. Zadeck shared a brief history of how SSA came into being in his presentation The Development of Static Single Assignment Form at the "Static Single-Assignment Form Seminar" conducted at the Saarland University. Ron Cytron, Jeanne Ferrante and the previous three researchers at IBM developed an algorithm that can compute the SSA form efficiently.

One can expect to find SSA in a compiler for Fortran, C, C++, or Java (Android Runtime); whereas in functional language compilers, such as those for Scheme and ML, continuation-passing style (CPS) is generally used. SSA is formally equivalent to a well-behaved subset of CPS excluding non-local control flow, which does not occur when CPS is used as intermediate representation. So optimizations and transformations formulated in terms of one immediately apply to the other.