Article

Proof-transforming compilation of programs with abrupt termination

Authors:

SAVCBS '07: Proceedings of the 2007 conference on Specification and verification of component-based systems: 6th Joint Meeting of the European Conference on Software Engineering and the ACM SIGSOFT Symposium on the Foundations of Software Engineering

Pages 39 - 46

https://doi.org/10.1145/1292316.1292321

Published: 03 September 2007 Publication History

Get Access

Abstract

The execution of untrusted bytecode programs can produce undesired behavior. A proof on the bytecode programs can be generated to ensure safe execution. Automatic techniques to generate proofs, such as certifying compilation, can only be used for a restricted set of properties such as type safety. Interactive verification of bytecode is difficult due to its unstructured control flow. Our approach is verify programs on the source level and then translate the proof to the byte-code level. This translation is non-trivial for programs with abrupt termination. We present proof transforming compilation from Java to Java Bytecode. This paper formalizes the proof transformation and present a soundness result.

References

[1]

F. Y. Bannwart and P. Müller. A Logic for Bytecode. In F. Spoto, editor, Bytecode Semantics, Verification, Analysis and Transformation (BYTECODE), volume 141 of ENTCS, pages 255--273. Elsevier, 2005.

Digital Library

Google Scholar

[2]

G. Barthe, B. Grégoire, C. Kunz, and T. Rezk. Certificate Translation for Optimizing Compilers. In 13th International Static Analysis Symposium (SAS), LNCS, Seoul, Korea, August 2006. Springer-Verlag.

Digital Library

Google Scholar

[3]

G. Barthe, T. Rezk, and A. Saabas. Proof obligations preserving compilation. In Third International Workshop on Formal Aspects in Security and Trust, Newcastle, UK, pages 112--126, 2005.

Digital Library

Google Scholar

[4]

B. Chang, A. Chlipala, G. Necula, and R. Schneck. The Open Verifier Framework for Foundational Verifiers. In ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDIS05), 2005.

Digital Library

Google Scholar

[5]

G. Goos and W. Zimmermann. Verification of Compilers. LNCS, pages 201--230. Springer-Verlag, 2005.

Digital Library

Google Scholar

[6]

P. Müller. Modular Specification and Verification of Object-Oriented Programs, volume 2262 of LNCS. Springer-Verlag, 2002.

Google Scholar

[7]

P. Müller and M. Nordio. Proof-Transforming Compilation of Programs with Abrupt Termination. Technical Report 565, ETH Zurich, 2007.

Digital Library

Google Scholar

[8]

G. Necula. Compiling with Proofs. PhD thesis, School of Computer Science, Carnegie Mellon University, 1998.

Digital Library

Google Scholar

[9]

G. Necula and P. Lee. The Design and Implementation of a Certifying Compiler. In Programming Language Design and Implementation (PLDI), pages 333--344. ACM Press, 1998.

Digital Library

Google Scholar

[10]

M. Pavlova. Java Bytecode verification and its applications. PhD thesis, University of Nice Sophia-Antipolis, 2007.

Google Scholar

[11]

A. Poetzsch-Heffter and M. J. Gawkowski. Towards Proof Generating Compilers. ENTCS, 132(1):37--51, 2005.

Digital Library

Google Scholar

[12]

A. Poetzsch-Heffter and P. Müller. A Programming Logic for Sequential Java. In S. D. Swierstra, editor, European Symposium on Programming Languages and Systems (ESOP'99), volume 1576 of LNCS, pages 162--176. Springer-Verlag, 1999.

Digital Library

Google Scholar

[13]

A. Poetzsch-Heffter and N. Rauch. Soundness and Relative Completeness of a Programming Logic for a Sequential Java Subset. Technical report, Technische Universität Kaiserlautern, 2004.

Google Scholar

Cited By

View all

Paganoni MFuria C(2023)Reasoning About Exceptional Behavior at the Level of Java BytecodeiFM 202310.1007/978-3-031-47705-8_7(113-133)Online publication date: 6-Nov-2023
https://doi.org/10.1007/978-3-031-47705-8_7
Paganoni MFuria C(2023)Verifying Functional Correctness Properties at the Level of Java BytecodeFormal Methods10.1007/978-3-031-27481-7_20(343-363)Online publication date: 3-Mar-2023
https://doi.org/10.1007/978-3-031-27481-7_20
Blech J(2018)A Case for Certifying Compilers in Industrial AutomationPrincipled Software Development10.1007/978-3-319-98047-8_5(73-86)Online publication date: 24-Oct-2018
https://doi.org/10.1007/978-3-319-98047-8_5
Show More Cited By

Index Terms

Proof-transforming compilation of programs with abrupt termination
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
  2. Software organization and properties
    1. Software functional properties
      1. Correctness
2. Theory of computation
  1. Logic
    1. Proof theory
  2. Semantics and reasoning
    1. Program reasoning

Recommendations

Modular development of certified program verifiers with a proof assistant
Proceedings of the 2006 ICFP conference

I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove memory safety of x86 machine code programs compiled from code that uses ...
A Certifying Compiler for Clike Subset of C Language
TASE '10: Proceedings of the 2010 4th IEEE International Symposium on Theoretical Aspects of Software Engineering

Proof-carrying code (PCC) is a technique that allows code consumers to check whether the code is safe to execute or not through a formal safety proof provided by the code producer. And a certifying compiler makes PCC practical by compiling annotated ...
An improved proof-theoretic compilation of logic programs

In prior work, we showed that logic programming compilation can be given a proof-theoretic justification for generic abstract logic programming languages, and demonstrated this technique in the case of hereditary Harrop formulas and their linear ...

Comments

Information & Contributors

Information

Published In

September 2007

99 pages

ISBN:9781595937216

DOI:10.1145/1292316

Program Chair:
Arnd Poetzsch-Heffter
Univ. of Kaiserslautern

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 September 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

ESEC/FSE07

Sponsor:

SIGSOFT

ESEC/FSE07: Joint 11th European Software Engineering Conference 2007

September 3 - 4, 2007

Dubrovnik, Croatia

Acceptance Rates

SAVCBS '07 Paper Acceptance Rate 8 of 17 submissions, 47%;

Overall Acceptance Rate 37 of 46 submissions, 80%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
114
Total Downloads

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

Reflects downloads up to 25 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Paganoni MFuria C(2023)Reasoning About Exceptional Behavior at the Level of Java BytecodeiFM 202310.1007/978-3-031-47705-8_7(113-133)Online publication date: 6-Nov-2023
https://doi.org/10.1007/978-3-031-47705-8_7
Paganoni MFuria C(2023)Verifying Functional Correctness Properties at the Level of Java BytecodeFormal Methods10.1007/978-3-031-27481-7_20(343-363)Online publication date: 3-Mar-2023
https://doi.org/10.1007/978-3-031-27481-7_20
Blech J(2018)A Case for Certifying Compilers in Industrial AutomationPrincipled Software Development10.1007/978-3-319-98047-8_5(73-86)Online publication date: 24-Oct-2018
https://doi.org/10.1007/978-3-319-98047-8_5
Nordio MCalcagno CMeyer B(2013)Certificates and Separation Logic8th International Symposium on Trustworthy Global Computing - Volume 835810.1007/978-3-319-05119-2_16(273-293)Online publication date: 30-Aug-2013
https://dl.acm.org/doi/10.1007/978-3-319-05119-2_16
Tschannen JFuria CNordio MMeyer B(2012)Automatic Verification of Advanced Object-Oriented Features: The AutoProof ApproachTools for Practical Software Verification10.1007/978-3-642-35746-6_5(133-155)Online publication date: 2012
https://doi.org/10.1007/978-3-642-35746-6_5
Trudel MOriol MFuria CNordio M(2011)Automated translation of Java source code to EiffelProceedings of the 49th international conference on Objects, models, components, patterns10.5555/2025896.2025900(20-35)Online publication date: 28-Jun-2011
https://dl.acm.org/doi/10.5555/2025896.2025900
Barthe GKunz C(2011)An Abstract Model of Certificate TranslationACM Transactions on Programming Languages and Systems10.1145/1985342.198534433:4(1-46)Online publication date: 1-Jul-2011
https://dl.acm.org/doi/10.1145/1985342.1985344
Trudel MOriol MFuria CNordio M(2011)Automated Translation of Java Source Code to EiffelObjects, Models, Components, Patterns10.1007/978-3-642-21952-8_4(20-35)Online publication date: 2011
https://doi.org/10.1007/978-3-642-21952-8_4
Kunz C(2010)Certificate Translation for the Verification of Concurrent ProgramsTrustworthly Global Computing10.1007/978-3-642-15640-3_16(237-252)Online publication date: 2010
https://doi.org/10.1007/978-3-642-15640-3_16
Barthe GGrégoire BKunz CRezk T(2009)Certificate translation for optimizing compilersACM Transactions on Programming Languages and Systems10.1145/1538917.153891931:5(1-45)Online publication date: 3-Jul-2009
https://dl.acm.org/doi/10.1145/1538917.1538919
Show More Cited By

View Options

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.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Modular development of certified program verifiers with a proof assistant

A Certifying Compiler for Clike Subset of C Language

An improved proof-theoretic compilation of logic programs

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations