Improvements to the Psi-SSA representation

Simple item page
dc.creatorDe Ferriere, Francois
dc.date2007-05-15
dc.date.accessioned2026-07-07T08:01:39Z
dc.date.available2026-07-07T08:01:39Z
dc.descriptionModern compiler implementations use the Static Single Assignment representation as a way to efficiently implement optimizing algorithms. However this representation is not well adapted to architectures with a predicated instruction set. The Psi-SSA representation extends the SSA representation such that standard SSA algorithms can be easily adapted to an architecture with a fully predicated instruction set. A new pseudo operation, the Psi operation, is introduced to merge several conditional definitions into a unique definition.
dc.identifierhttps://arxiv.org/abs/0705.2126
dc.identifierhttp://arxiv.org/abs/0705.2126
dc.identifierPublished in proceedings for the workshop "Software and Compilers for Embedded Systems (SCOPES) 2007" (20/04/2007)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/128979
dc.subjectProgramming Languages
dc.titleImprovements to the Psi-SSA representation
dc.typetext

Files

Collections

arXiv