research-article

Type-preserving compilation for large-scale optimizing object-oriented compilers

Authors:

Chris Hawblitzel,

Derrick Coetzee,

Polyvios PratikakiAuthors Info & Claims

PLDI '08: Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation

Pages 183 - 192

https://doi.org/10.1145/1375581.1375604

Published: 07 June 2008 Publication History

Abstract

Type-preserving compilers translate well-typed source code, such as Java or C#, into verifiable target code, such as typed assembly language or proof-carrying code. This paper presents the implementation of type-preserving compilation in a complex, large-scale optimizing compiler. Compared to prior work, this implementation supports extensive optimizations, and it verifies a large portion of the interface between the compiler and the runtime system. This paper demonstrates the practicality of type-preserving compilation in complex optimizing compilers: the generated typed assembly language is only 2.3% slower than the base compiler's generated untyped assembly language, and the type-preserving compiler is 82.8% slower than the base compiler.

References

[1]

R. Bodik, R. Gupta, and V. Sarkar. ABCD: eliminating array-bounds checks on demand. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 321--333, 2000.

Digital Library

[2]

J. Chen and D. Tarditi. A simple typed intermediate language for object-oriented languages. In ACM Symposium on Principles of Programming Languages, pages 38--49, 2005.

Digital Library

[3]

J. Chen, D. Wu, A. W. Appel, and H. Fang. A provably sound TAL for back-end optimization. In ACM SIGPLAN Conference on Programming Language Design and Implementation, 2003.

Digital Library

[4]

C. Colby, P. Lee, G. C. Necula, F. Blau, K. Cline, and M. Plesko. A certifying compiler for Java. In ACM SIGPLAN Conference on Programming Language Design and Implementation, June 2000.

Digital Library

[5]

K. Crary and J. C. Vanderwaart. An expressive, scalable type theory for certified code. In ACM SIGPLAN International Conference on Functional Programming, pages 191--205, 2002.

Digital Library

[6]

Microsoft Corp. et al. Common Language Infrastructure. 2002. http://msdn.microsoft.com/net/ecma/.

[7]

D. Grossman and J. G. Morrisett. Scalable certification for typed assembly language. In International Workshop on Types in Compilation, pages 117--146, 2001.

Digital Library

[8]

X. Leroy. Formal certification of a compiler back-end or: programming a compiler with a proof assistant. In ACM Symposium on Principles of Programming Languages, pages 42--54, 2006.

Digital Library

[9]

V. S. Menon, N. Glew, B. R. Murphy, A. McCreight, T. Shpeisman, A. Adl-Tabatabai, and L. Petersen. A verifiable ssa program representation for aggressive compiler optimization. In ACM Symposium on Principles of Programming Languages, pages 397--408, 2006.

Digital Library

[10]

G. Morrisett, K. Crary, N. Glew, D. Grossman, R. Samuels, F. Smith, D. Walker, S. Weirich, and S. Zdancewic. TALx86: A realistic typed assembly language. In ACM SIGPLAN Workshop on Compiler Support for System Software, pages 25--35, 1999.

[11]

G. Morrisett, D. Walker, K. Crary, and N. Glew. From System F to typed assembly language. In ACM Symposium on Principles of Programming Languages, pages 85--97, 1998.

Digital Library

[12]

G. Necula. Proof-Carrying Code. In ACM Symposium on Principles of Programming Languages, pages 106--119, 1997.

Digital Library

[13]

F. Perry, C. Hawblitzel, and J. Chen. Simple and flexible stack types. In International Workshop on Aliasing, Confinement, and Ownership (IWACO), July 2007.

[14]

Z. Shao, B. Saha, V. Trifonov, and N. Papaspyrou. A type system for certified binaries. In ACM Symposium on Principles of Programming Languages, 2002.

Digital Library

[15]

J. C. Vanderwaart and K. Crary. A typed interface for garbage collection. In ACM SIGPLAN workshop on Types in languages design and implementation, pages 109--122, 2003.

Digital Library

[16]

H. Xi and R. Harper. A dependently typed assembly language. In 2001 ACM SIGPLAN International Conference on Functional Programming, pages 169--180, September 2001.

Digital Library

Cited By

McCreight AChevalier TTolmach A(2010)A certified framework for compiling and executing garbage-collected languagesACM SIGPLAN Notices10.1145/1932681.186358445:9(273-284)Online publication date: 27-Sep-2010
https://dl.acm.org/doi/10.1145/1932681.1863584
McCreight AChevalier TTolmach AHudak PWeirich S(2010)A certified framework for compiling and executing garbage-collected languagesProceedings of the 15th ACM SIGPLAN international conference on Functional programming10.1145/1863543.1863584(273-284)Online publication date: 27-Sep-2010
https://dl.acm.org/doi/10.1145/1863543.1863584
Tate RChen JHawblitzel C(2010)Inferable object-oriented typed assembly languageACM SIGPLAN Notices10.1145/1809028.180664445:6(424-435)Online publication date: 5-Jun-2010
https://dl.acm.org/doi/10.1145/1809028.1806644
Show More Cited By

Index Terms

Type-preserving compilation for large-scale optimizing object-oriented compilers
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Classes and objects

Recommendations

Type-preserving compilation for large-scale optimizing object-oriented compilers
PLDI '08

Type-preserving compilers translate well-typed source code, such as Java or C#, into verifiable target code, such as typed assembly language or proof-carrying code. This paper presents the implementation of type-preserving compilation in a complex, ...
Finitary polymorphism for optimizing type-directed compilation

We develop a type-theoretical method for optimizing type directed compilation of polymorphic languages, implement the method in SML#, which is a full-scale compiler of Standard ML extended with several advanced features that require type-passing ...
Typed closure conversion for the calculus of constructions
PLDI '18

Dependently typed languages such as Coq are used to specify and verify the full functional correctness of source programs. Type-preserving compilation can be used to preserve these specifications and proofs of correctness through compilation into the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PLDI '08: Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation

June 2008

396 pages

ISBN:9781595938602

DOI:10.1145/1375581

General Chair:
Rajiv Gupta
University of California, Riverside, USA
,
Program Chair:
Saman Amarasinghe
Massachusetts Institute of Technology, USA

ACM SIGPLAN Notices Volume 43, Issue 6
PLDI '08
June 2008
382 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/1379022
Issue’s Table of Contents

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 June 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

PLDI '08

Sponsor:

PLDI '08: ACM SIGPLAN Conference on Programming Language Design and Implementation

June 7 - 13, 2008

AZ, Tucson, USA

Acceptance Rates

Overall Acceptance Rate 406 of 2,067 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
500
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

McCreight AChevalier TTolmach A(2010)A certified framework for compiling and executing garbage-collected languagesACM SIGPLAN Notices10.1145/1932681.186358445:9(273-284)Online publication date: 27-Sep-2010
https://dl.acm.org/doi/10.1145/1932681.1863584
McCreight AChevalier TTolmach AHudak PWeirich S(2010)A certified framework for compiling and executing garbage-collected languagesProceedings of the 15th ACM SIGPLAN international conference on Functional programming10.1145/1863543.1863584(273-284)Online publication date: 27-Sep-2010
https://dl.acm.org/doi/10.1145/1863543.1863584
Tate RChen JHawblitzel C(2010)Inferable object-oriented typed assembly languageACM SIGPLAN Notices10.1145/1809028.180664445:6(424-435)Online publication date: 5-Jun-2010
https://dl.acm.org/doi/10.1145/1809028.1806644
Tate RChen JHawblitzel CZorn BAiken A(2010)Inferable object-oriented typed assembly languageProceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/1806596.1806644(424-435)Online publication date: 5-Jun-2010
https://dl.acm.org/doi/10.1145/1806596.1806644
Hawblitzel CPetrank E(2009)Automated verification of practical garbage collectorsACM SIGPLAN Notices10.1145/1594834.148093544:1(441-453)Online publication date: 21-Jan-2009
https://dl.acm.org/doi/10.1145/1594834.1480935
Hawblitzel CPetrank EShao ZPierce B(2009)Automated verification of practical garbage collectorsProceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/1480881.1480935(441-453)Online publication date: 21-Jan-2009
https://dl.acm.org/doi/10.1145/1480881.1480935
Leroy X(2009)A Formally Verified Compiler Back-endJournal of Automated Reasoning10.1007/s10817-009-9155-443:4(363-446)Online publication date: 4-Nov-2009
https://doi.org/10.1007/s10817-009-9155-4
Dong YRen KWang SZhang S(2009)Certify Once, Trust AnywhereProceedings of the 7th Asian Symposium on Programming Languages and Systems10.1007/978-3-642-10672-9_20(275-293)Online publication date: 3-Dec-2009
https://dl.acm.org/doi/10.1007/978-3-642-10672-9_20
Barthe GGrégoire BHeraud SKunz CPacalet A(2009)Implementing a Direct Method for Certificate TranslationProceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering10.1007/978-3-642-10373-5_28(541-560)Online publication date: 17-Nov-2009
https://dl.acm.org/doi/10.1007/978-3-642-10373-5_28
Erata FDeng SZaghloul FXiong WDemir OSzefer J(2023)Survey of Approaches and Techniques for Security Verification of Computer SystemsACM Journal on Emerging Technologies in Computing Systems10.1145/356478519:1(1-34)Online publication date: 19-Jan-2023
https://dl.acm.org/doi/10.1145/3564785
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents