Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Provably Sound TAL for Back-end Optimization Juan Chen Dinghao Wu
 

Summary: A Provably Sound TAL for Back-end Optimization
Juan Chen Dinghao Wu
Princeton University
{juanchen, dinghao, appel}@cs.princeton.edu
Andrew W. Appel Hai Fang
Yale University
hai.fang@yale.edu
ABSTRACT
Typed assembly languages provide a way to generate machine-
checkable safety proofs for machine-language programs. But
the soundness proofs of most existing typed assembly lan-
guages are hand-written and cannot be machine-checked,
which is worrisome for such large calculi. We have de-
signed and implemented a low-level typed assembly language
(LTAL) with a semantic model and established its soundness
from the model. Compared to existing typed assembly lan-
guages, LTAL is more scalable and more secure; it has no
macro instructions that hinder low-level optimizations such
as instruction scheduling; its type constructors are expres-
sive enough to capture dataflow information, support the

  

Source: Appel, Andrew W. - Department of Computer Science, Princeton University

 

Collections: Computer Technologies and Information Sciences