1 | @article{Szymanski1978, |
---|
2 | author = {Szymanski, Thomas G.}, |
---|
3 | title = {Assembling code for machines with span-dependent instructions}, |
---|
4 | journal = {Commun. ACM}, |
---|
5 | issue_date = {April 1978}, |
---|
6 | volume = {21}, |
---|
7 | number = {4}, |
---|
8 | month = apr, |
---|
9 | year = {1978}, |
---|
10 | issn = {0001-0782}, |
---|
11 | pages = {300--308}, |
---|
12 | numpages = {9}, |
---|
13 | url = {http://doi.acm.org/10.1145/359460.359474}, |
---|
14 | doi = {10.1145/359460.359474}, |
---|
15 | acmid = {359474}, |
---|
16 | publisher = {ACM}, |
---|
17 | address = {New York, NY, USA}, |
---|
18 | keywords = {NP-complete, assemblers, code generation, compilers, computational complexity, span-dependent instructions, variable-length addressing}, |
---|
19 | } |
---|
20 | |
---|
21 | @article{Robertson1979, |
---|
22 | author = {Robertson, Edward L.}, |
---|
23 | title = {Code Generation and Storage Allocation for Machines with Span-Dependent Instructions}, |
---|
24 | journal = {ACM Trans. Program. Lang. Syst.}, |
---|
25 | issue_date = {July 1979}, |
---|
26 | volume = {1}, |
---|
27 | number = {1}, |
---|
28 | month = jan, |
---|
29 | year = {1979}, |
---|
30 | issn = {0164-0925}, |
---|
31 | pages = {71--83}, |
---|
32 | numpages = {13}, |
---|
33 | url = {http://doi.acm.org/10.1145/357062.357067}, |
---|
34 | doi = {10.1145/357062.357067}, |
---|
35 | acmid = {357067}, |
---|
36 | publisher = {ACM}, |
---|
37 | address = {New York, NY, USA}, |
---|
38 | } |
---|
39 | |
---|
40 | @article{Dickson2008, |
---|
41 | author = {Neil G. Dickson}, |
---|
42 | title = {A Simple, Linear-Time Algorithm for x86 Jump Encoding}, |
---|
43 | journal = {CoRR}, |
---|
44 | volume = {abs/0812.4973}, |
---|
45 | year = {2008}, |
---|
46 | ee = {http://arxiv.org/abs/0812.4973}, |
---|
47 | bibsource = {DBLP, http://dblp.uni-trier.de} |
---|
48 | } |
---|
49 | |
---|
50 | @inproceedings{Sozeau2006, |
---|
51 | author = {Matthieu Sozeau}, |
---|
52 | title = {Subset Coercions in {Coq}}, |
---|
53 | booktitle = {{TYPES}}, |
---|
54 | pages = {237--252}, |
---|
55 | year = {2006} |
---|
56 | } |
---|
57 | |
---|
58 | @misc{SDCC2011, |
---|
59 | title = {Small Device {C} Compiler 3.1.0}, |
---|
60 | howpublished = {\url{http://sdcc.sourceforge.net/}}, |
---|
61 | year = {2011}, |
---|
62 | key = {SDCC2011} |
---|
63 | } |
---|
64 | |
---|
65 | @misc{GCC2012, |
---|
66 | title = {GNU Compiler Collection 4.7.0}, |
---|
67 | howpublished = {\url{http://gcc.gnu.org/}}, |
---|
68 | year = {2012}, |
---|
69 | key = {GCC2012} |
---|
70 | } |
---|
71 | |
---|
72 | @misc{IntelDev, |
---|
73 | author = {Intel}, |
---|
74 | title = {{Intel 64 and IA-32 Architectures Developer's Manual}}, |
---|
75 | howpublished={\url{http://www.intel.com/content/www/us/en/processors/architectures-software-developer-manuals.html}}, |
---|
76 | volume=2, |
---|
77 | key = {IntelDev} |
---|
78 | } |
---|
79 | |
---|
80 | @article {Leroy2009, |
---|
81 | author = {Leroy, Xavier}, |
---|
82 | affiliation = {INRIA Paris-Rocquencourt B.P. 105 78153 Le Chesnay France}, |
---|
83 | title = {A Formally Verified Compiler Back-end}, |
---|
84 | journal = {Journal of Automated Reasoning}, |
---|
85 | publisher = {Springer Netherlands}, |
---|
86 | issn = {0168-7433}, |
---|
87 | keyword = {Computer Science}, |
---|
88 | pages = {363-446}, |
---|
89 | volume = {43}, |
---|
90 | issue = {4}, |
---|
91 | url = {http://dx.doi.org/10.1007/s10817-009-9155-4}, |
---|
92 | note = {10.1007/s10817-009-9155-4}, |
---|
93 | year = {2009} |
---|
94 | } |
---|
95 | |
---|
96 | @book {Moore1996, |
---|
97 | author = {J Strother Moore}, |
---|
98 | title = {Piton: A mechanically verified assembly language}, |
---|
99 | series = {Automated Reasoning Series}, |
---|
100 | volume = {3}, |
---|
101 | isbn = {978-0-7923-3920-5}, |
---|
102 | publisher = {Springer}, |
---|
103 | year = {1996} |
---|
104 | } |
---|
105 | |
---|
106 | @misc {Hyde2006, |
---|
107 | title = {Branch displacement optimisation}, |
---|
108 | author = {Randall Hyde}, |
---|
109 | howpublished = {\url{http://groups.google.com/group/alt.lang.asm/msg/d31192d442accad3}}, |
---|
110 | year = {2006}, |
---|
111 | } |
---|
112 | |
---|
113 | @misc{DC2012, |
---|
114 | title={{On the correctness of an optimising assembler for the Intel MCS-51 microprocessor}}, |
---|
115 | author = {Dominic P. Mulligan and Claudio {Sacerdoti Coen}}, |
---|
116 | year = {2012}, |
---|
117 | booktitle = {Certified Proofs and Programs {(CPP)}}, |
---|
118 | note = {Submitted} |
---|
119 | } |
---|
120 | |
---|
121 | @article{Asperti2007, |
---|
122 | author = {Andrea Asperti and Claudio {Sacerdoti Coen} and Enrico Tassi and Stefano Zacchiroli}, |
---|
123 | title = {User interaction with the {Matita} proof assistant}, |
---|
124 | journal = {Automated Reasoning}, |
---|
125 | pages = {109--139}, |
---|
126 | volume = {39}, |
---|
127 | issue = {2}, |
---|
128 | year = {2007} |
---|
129 | } |
---|
130 | |
---|
131 | @article{TSO2011, |
---|
132 | author = {\v{S}ev\v{c}ik, Jaroslav and Vafeiadis, Viktor and Zappa Nardelli, Francesco and Jagannathan, Suresh and Sewell, Peter}, |
---|
133 | title = {Relaxed-memory concurrency and verified compilation}, |
---|
134 | journal = {SIGPLAN Not.}, |
---|
135 | issue_date = {January 2011}, |
---|
136 | volume = {46}, |
---|
137 | number = {1}, |
---|
138 | month = jan, |
---|
139 | year = {2011}, |
---|
140 | issn = {0362-1340}, |
---|
141 | pages = {43--54}, |
---|
142 | numpages = {12}, |
---|
143 | url = {http://doi.acm.org/10.1145/1925844.1926393}, |
---|
144 | doi = {10.1145/1925844.1926393}, |
---|
145 | acmid = {1926393}, |
---|
146 | publisher = {ACM}, |
---|
147 | address = {New York, NY, USA}, |
---|
148 | keywords = {relaxed memory models, semantics, verifying compilation}, |
---|
149 | } |
---|
150 | |
---|
151 | @inproceedings{Sevcik:2011:RCV:1926385.1926393, |
---|
152 | author = {\v{S}ev\v{c}ik, Jaroslav and Vafeiadis, Viktor and Zappa Nardelli, Francesco and Jagannathan, Suresh and Sewell, Peter}, |
---|
153 | title = {Relaxed-memory concurrency and verified compilation}, |
---|
154 | booktitle = {Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages}, |
---|
155 | series = {POPL '11}, |
---|
156 | year = {2011}, |
---|
157 | isbn = {978-1-4503-0490-0}, |
---|
158 | location = {Austin, Texas, USA}, |
---|
159 | pages = {43--54}, |
---|
160 | numpages = {12}, |
---|
161 | url = {http://doi.acm.org/10.1145/1926385.1926393}, |
---|
162 | doi = {10.1145/1926385.1926393}, |
---|
163 | acmid = {1926393}, |
---|
164 | publisher = {ACM}, |
---|
165 | address = {New York, NY, USA}, |
---|
166 | keywords = {relaxed memory models, semantics, verifying compilation}, |
---|
167 | } |
---|