Stem ssa$ (all stems)

35 papers:

CC-2015-DemangePS #coq #optimisation #performance #verification

Verifying Fast and Sparse SSA-Based Optimizations in Coq (DD, DP, LS), pp. 233–252.

CC-2014-Dinechin #code generation #using

Using the SSA-Form in a Code Generator (BDdD), pp. 1–17.

CC-2014-SurendranBZS #array #using

Inter-iteration Scalar Replacement Using Array SSA Form (RS, RB, JZ, VS), pp. 40–60.

PLDI-2013-ZhaoNMZ #optimisation #verification

Formal verification of SSA-based optimizations for LLVM (JZ, SN, MMKM, SZ), pp. 175–186.

ESOP-2012-BartheDP

A Formally Verified SSA-Based Middle-End — Static Single Assignment Meets CompCert (GB, DD, DP), pp. 47–66.

PLDI-2011-ZhouCC #algorithm #execution

An SSA-based algorithm for optimal speculative code motion under an execution profile (HZ, WC, FCC), pp. 98–108.

CC-2011-BuchwaldZB

SSA-Based Register Allocation with PBQP (SB, AZ, TB), pp. 42–61.

CC-2011-RimsadP #analysis #source code

Tainted Flow Analysis on e-SSA-Form Programs (AR, Md, FMQP), pp. 124–143.

PASTE-2010-CalmanZ #analysis #induction #information retrieval #interprocedural

Interprocedural induction variable analysis based on interprocedural SSA form IR (SC, JZ), pp. 37–44.

CC-2010-RoyS #optimisation

The Hot Path SSA Form: Extending the Static Single Assignment Form for Speculative Optimizations (SR, YNS), pp. 304–323.

CGO-2010-WimmerF #linear

Linear scan register allocation on SSA form (CW, MF), pp. 170–179.

CC-2009-BraunH #source code

Register Spilling and Live-Range Splitting for SSA-Form Programs (MB, SH), pp. 174–189.

CC-2009-PereiraP

SSA Elimination after Register Allocation (FMQP, JP), pp. 158–173.

CGO-2009-BoissinotDRDG #correctness #performance #quality

Revisiting Out-of-SSA Translation for Correctness, Code Quality and Efficiency (BB, AD, FR, BDdD, CG), pp. 114–125.

ISMM-2009-NaeemL #alias #analysis #performance #set #using

Efficient alias set analysis using SSA form (NAN, OL), pp. 79–88.

SAS-2008-PrabhuS #analysis #array #java #pointer #using

Field Flow Sensitive Pointer and Escape Analysis for Java Using Heap Array SSA (PP, PS), pp. 110–127.

CGO-2008-BoissinotHGDR #liveness #performance #source code

Fast liveness checking for ssa-form programs (BB, SH, DG, BDdD, FR), pp. 35–44.

LCTES-2008-EbnerBSKWK #using

Generalized instruction selection using SSA-graphs (DE, FB, BS, AK, PW, AK), pp. 31–40.

LCTES-2007-BouchezDR #complexity #on the

On the complexity of spill everywhere under SSA form (FB, AD, FR), pp. 103–112.

FoSSaCS-2006-PereiraP

Register Allocation After Classical SSA Elimination is NP-Complete (FMQP, JP), pp. 79–93.

POPL-2006-MenonGMMSAP #compilation #optimisation #representation

A verifiable SSA program representation for aggressive compiler optimization (VM, NG, BRM, AM, TS, ARAT, LP), pp. 397–408.

CC-2006-HackGG #source code

Register Allocation for Programs in SSA-Form (SH, DG, GG), pp. 247–262.

COCV-J-2005-AmmeRF #mobile

Quantifying the Benefits of SSA-Based Mobile Code (WA, JvR, MF), pp. 103–119.

COCV-J-2005-BlechGLM #code generation #comparison #correctness #higher-order #optimisation #proving

Optimizing Code Generation from SSA Form: A Comparison Between Two Formal Correctness Proofs in Isabelle/HOL (JOB, SG, JL, SM), pp. 33–51.

CGO-2004-RastelloFG #constraints #optimisation #using

Optimizing Translation Out of SSA Using Renaming Constraints (FR, FdF, CG), pp. 265–278.

CC-2002-MossenbockP #constraints #linear

Linear Scan Register Allocation in the Context of SSA Form and Register Constraints (HM, MP), pp. 229–246.

SAC-2000-LenartSG #analysis #constant

SSA-based Flow-sensitive Type Analysis: Combining Constant and Type Propagation (AL, CS, SKSG), pp. 813–817.

LCTES-2000-CintraA #array #using

Array Reference Allocation Using SSA-Form and Live Range Growth (MSC, GA), pp. 48–62.

PLDI-1998-SastryJ #algorithm

A New Algorithm for Scalar Register Promotion based on SSA Form (AVSS, RDCJ), pp. 15–25.

SAS-1998-SarkarK #array #constant

Enabling Sparse Constant Propagation of Array Elements via Array SSA Form (VS, KK), pp. 33–56.

POPL-1998-KnobeS #array #parallel

Array SSA Form and Its Use in Parallelization (KK, VS), pp. 107–120.

CC-1998-LapkowskiH #multi #pointer

Extended SSA Numbering: Introducing SSA Properties to Language with Multi-level Pointers (CL, LJH), pp. 128–143.

PLDI-1997-ChowCKLLT #algorithm

A New Algorithm for Partial Redundancy Elimination based on SSA Form (FCC, SC, RK, SML, RL, PT), pp. 273–286.

CC-1996-ChowCLLS #alias #effectiveness #memory management #representation

Effective Representation of Aliases and Indirect Memory Operations in SSA Form (FCC, SC, SML, RL, MS), pp. 253–267.

PLDI-1993-CytronG #alias #performance

Efficient Accomodation of May-Alias Information in SSA Form (RC, RG), pp. 36–45.