source: src/ASM/CPP2012-policy/main.tex @ 3338

Last change on this file since 3338 was 3338, checked in by boender, 6 years ago
  • updated statement of main correctness statement (still needs work)
  • Property svn:executable set to *
File size: 1.8 KB
Line 
1\documentclass[a4paper]{llncs}
2\usepackage{algpseudocode}
3\usepackage{alltt}
4\usepackage{amsfonts}
5\usepackage{amsmath}
6\usepackage[british]{babel}
7\usepackage{hyperref}
8\usepackage[utf8]{inputenc}
9\usepackage{listings}
10
11\renewcommand{\verb}{\lstinline}
12\def\lstlanguagefiles{lst-grafite.tex}
13\lstset{language=Grafite}
14
15\begin{document}
16
17\mainmatter
18\title{On the correctness of a branch displacement algorithm\thanks{Research supported by the CerCo project, within the Future and Emerging Technologies (FET) programme of the Seventh Framework Programme for Research of the European Commission, under FET-Open grant number 243881}}
19\author{Jaap Boender\inst{1} \and Claudio Sacerdoti Coen\inst{2}}
20\institute{Foundations of Computing Group\\Department of Computer Science\\School of Science and Technology\\Middlesex University, London, UK\\
21\email{J.Boender@mdx.ac.uk}
22\and
23Dipartimento di Scienze dell'Informazione,\\
24Universit\`a degli Studi di Bologna, Italy\\
25\email{sacerdot@cs.unibo.it}}
26
27\maketitle
28
29\begin{abstract}
30The branch displacement problem is a well-known problem in assembler design.
31It revolves around the feature, present in several processor families, of
32having different instructions, of different sizes, for jumps of different
33displacements. The problem, which is provably NP-hard, is then to select the
34instructions such that one ends up with the smallest possible program.
35
36During our research with the CerCo project on formally verifying a C compiler,
37we have implemented and proven correct an algorithm for this problem. In this
38paper, we discuss the problem, possible solutions, our specific solutions and
39the proofs.
40
41\keywords{formal verification, assembler, branch displacement optimisation}
42\end{abstract}
43
44\input{problem}
45\input{algorithm}
46\input{proof}
47\input{conclusion}
48
49\clearpage
50\bibliography{biblio}
51\bibliographystyle{splncs03}
52
53\end{document}
Note: See TracBrowser for help on using the repository browser.