Abstract
The branch displacement problem is a well-known problem in assembler design. It revolves around the feature, present in several processor families, of having different instructions, of different sizes, for jumps of different displacements. The problem, which is provably NP-hard, is then to select the instructions such that one ends up with the smallest possible program. During our research with the CerCo project on formally verifying a C compiler, we have implemented and proven correct an algorithm for this problem. In this paper, we discuss the problem, possible solutions, our specific solutions and the proofs. © 2014 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Boender, J., & Sacerdoti Coen, C. (2014). On the correctness of a branch displacement algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8413 LNCS, pp. 605–619). Springer Verlag. https://doi.org/10.1007/978-3-642-54862-8_53
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
