A provably sound TAL for back-end optimization

Juan Chen, Dinghao Wu, Andrew W. Appel, Hai Fang

Research output: Contribution to journalConference article

5 Citations (Scopus)

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 languages are hand-written and cannot be machine-checked, which is worrisome for such large calculi. We have designed 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 languages, 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 expressive enough to capture dataflow information, support the compiler's choice of data representations and permit typed position-independent code; and its type-checking algorithm is completely syntax-directed. We have built a prototype system, based on Standard ML of New Jersey, that compiles most of core ML to Sparc code. We explain how we were able to make the untyped back end in SML/NJ preserve types during instruction selection and register allocation, without restricting low-level optimizations and without knowledge of any type system pervading the instruction selector and register allocator.

Original languageEnglish (US)
Pages (from-to)208-219
Number of pages12
JournalACM SIGPLAN Notices
Volume38
Issue number5
DOIs
StatePublished - Jan 1 2003
EventProceedings of the ACM Sigplan 2003 Conference on Programming Language Design and Implementation - San Diego, CA, United States
Duration: Jun 9 2003Jun 11 2003

Fingerprint

Acoustic waves
Macros
Semantics
Scheduling

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Graphics and Computer-Aided Design

Cite this

Chen, Juan ; Wu, Dinghao ; Appel, Andrew W. ; Fang, Hai. / A provably sound TAL for back-end optimization. In: ACM SIGPLAN Notices. 2003 ; Vol. 38, No. 5. pp. 208-219.
@article{40985ce5f14d4e5d82abc22e2a90287a,
title = "A provably sound TAL for back-end optimization",
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 languages are hand-written and cannot be machine-checked, which is worrisome for such large calculi. We have designed 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 languages, 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 expressive enough to capture dataflow information, support the compiler's choice of data representations and permit typed position-independent code; and its type-checking algorithm is completely syntax-directed. We have built a prototype system, based on Standard ML of New Jersey, that compiles most of core ML to Sparc code. We explain how we were able to make the untyped back end in SML/NJ preserve types during instruction selection and register allocation, without restricting low-level optimizations and without knowledge of any type system pervading the instruction selector and register allocator.",
author = "Juan Chen and Dinghao Wu and Appel, {Andrew W.} and Hai Fang",
year = "2003",
month = "1",
day = "1",
doi = "10.1145/780822.781155",
language = "English (US)",
volume = "38",
pages = "208--219",
journal = "ACM SIGPLAN Notices",
issn = "1523-2867",
publisher = "Association for Computing Machinery (ACM)",
number = "5",

}

A provably sound TAL for back-end optimization. / Chen, Juan; Wu, Dinghao; Appel, Andrew W.; Fang, Hai.

In: ACM SIGPLAN Notices, Vol. 38, No. 5, 01.01.2003, p. 208-219.

Research output: Contribution to journalConference article

TY - JOUR

T1 - A provably sound TAL for back-end optimization

AU - Chen, Juan

AU - Wu, Dinghao

AU - Appel, Andrew W.

AU - Fang, Hai

PY - 2003/1/1

Y1 - 2003/1/1

N2 - 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 languages are hand-written and cannot be machine-checked, which is worrisome for such large calculi. We have designed 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 languages, 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 expressive enough to capture dataflow information, support the compiler's choice of data representations and permit typed position-independent code; and its type-checking algorithm is completely syntax-directed. We have built a prototype system, based on Standard ML of New Jersey, that compiles most of core ML to Sparc code. We explain how we were able to make the untyped back end in SML/NJ preserve types during instruction selection and register allocation, without restricting low-level optimizations and without knowledge of any type system pervading the instruction selector and register allocator.

AB - 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 languages are hand-written and cannot be machine-checked, which is worrisome for such large calculi. We have designed 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 languages, 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 expressive enough to capture dataflow information, support the compiler's choice of data representations and permit typed position-independent code; and its type-checking algorithm is completely syntax-directed. We have built a prototype system, based on Standard ML of New Jersey, that compiles most of core ML to Sparc code. We explain how we were able to make the untyped back end in SML/NJ preserve types during instruction selection and register allocation, without restricting low-level optimizations and without knowledge of any type system pervading the instruction selector and register allocator.

UR - http://www.scopus.com/inward/record.url?scp=1442313423&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1442313423&partnerID=8YFLogxK

U2 - 10.1145/780822.781155

DO - 10.1145/780822.781155

M3 - Conference article

VL - 38

SP - 208

EP - 219

JO - ACM SIGPLAN Notices

JF - ACM SIGPLAN Notices

SN - 1523-2867

IS - 5

ER -