chunk_uid stringlengths 40 40 | chunk_type stringclasses 2
values | chunk_index int64 0 6.71k | total_chunks int64 1 6.71k | section_title stringlengths 1 157 | embed_text stringlengths 1 83.3k | spans dict | paper_doi stringlengths 0 63 | paper_id_arxiv stringlengths 9 16 | title stringlengths 7 245 | authors listlengths 1 768 | categories listlengths 1 7 | year int64 2k 2.02k | language stringclasses 2
values | discipline stringclasses 8
values | dense_vector listlengths 1.02k 1.02k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
a018633e8093601fccb7fa4e6be97cd42fb1d566 | subsection | 153 | 510 | Proving | By tr:et-op we have that \mathbf {{\color {RedOrange}{H\triangleright {\color {black}{\left.\mathsf {{\color {RoyalBlue}{n}}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathbf {{\color {RedOrange}{L^{P}}}}}}} \oplus {\color {black}{\left.\mathsf {{\color {RoyalBlue}{n^{\prime }}}} \right.^{\mathsf {{\color {Roya... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.026230905205011368,
0.034821946173906326,
-0.03943028301000595,
-0.01006357278674841,
-0.0007114693871699274,
0.023835178464651108,
-0.014160720631480217,
0.02240079641342163,
0.008713115938007832,
0.0243997760117054,
-0.01002542395144701,
-0.03033568151295185,
0.02189723588526249,
0.01... | |
d285ea506e677cb221006cae4bc37c8bf2520b9a | subsection | 154 | 510 | Proving | By HP \mathsf {{\color {RoyalBlue}{H\triangleright e.1\rho }}}\operatorname{\mathsf {{\color {RoyalBlue}{\ \hookrightarrow \!\!\!\!\rightarrow \ }}}}\mathsf {{\color {RoyalBlue}{\left\langle v_1,v_2\right\rangle }}}\operatorname{\mathsf {{\color {RoyalBlue}{\ \hookrightarrow \!\!\!\!\rightarrow \ }}}}\mathsf {{\color {... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04475810378789902,
0.021402733400464058,
-0.03343890979886055,
-0.015819411724805832,
-0.0010545003460720181,
0.010754759423434734,
-0.01375998929142952,
0.022150227800011635,
0.017131339758634567,
0.0006836137035861611,
-0.030464189127087593,
-0.001657071872614324,
0.024972397834062576,
... | |
95e49c4f3872fac1c478595043f86e5e9fcd425e | subsection | 155 | 510 | Proving | Now \mathbf {{\color {RedOrange}{H\triangleright \left\langle {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\mathsf {{\color {RoyalBlue}{v_1}}}}}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathbf {{\color {RedOrange}{L^{P}}}}}}},{\color {black}{\left.\mathsf {{\color {RoyalBlue}{\mathsf {{\color {RoyalBlue... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05531309172511101,
0.015316415578126907,
-0.025886038318276405,
-0.002081490820273757,
-0.004670476540923119,
0.013141438364982605,
-0.025336571037769318,
0.019094007089734077,
0.008287806063890457,
0.011592244729399681,
-0.014492213726043701,
-0.00388824800029397,
0.03763854503631592,
... | |
bbf510a71dcac601ffbafb23abfee01b04c79299 | subsection | 156 | 510 | Proving | \exists \beta ^{\prime }
\\
\text{ if }&\ \vdash \mathsf {{\color {RoyalBlue}{C}}}:\mathsf {{\color {RoyalBlue}{whole}}}
\\
&\ \mathsf {{\color {RoyalBlue}{C}}}=\mathsf {{\color {RoyalBlue}{\Delta ; \overline{F} ; \overline{I}}}}
\\
&
{\color {black}{\left.\mathsf {{\color {RoyalBlue}{\mathsf {{\color {RoyalBlue}{C}}}}... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.06474632769823074,
0.025309652090072632,
-0.01807832159101963,
-0.0037377122789621353,
-0.019954806193709373,
0.0088408337906003,
-0.006102387327700853,
0.056782715022563934,
0.05843035876750946,
0.018963169306516647,
-0.0445169173181057,
-0.009718052111566067,
0.014264330267906189,
0.0... | |
3057b4d4614d9a715a4aa3a8cc04d376abe9682c | subsection | 157 | 510 | Proving | Base case
\mathsf {{\color {RoyalBlue}{skip}}}
By tr:compup-skip this case follows trivially. | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.030929366126656532,
0.017379648983478546,
-0.02606184408068657,
0.012649455107748508,
-0.01476278342306614,
0.00965875107795,
0.0379025898873806,
0.028884701430797577,
0.012123029679059982,
0.01919543370604515,
0.010391168296337128,
-0.0024490198120474815,
-0.012519755400717258,
0.02181... | |
030af001c82967417cb2c9a8f989ba7dfafcf0ef | subsection | 158 | 510 | Proving | Inductive
\mathsf {{\color {RoyalBlue}{{let}~x={new}~e~{in}~s}}}
By tr:compup-new {\color {black}{\left.\mathsf {{\color {RoyalBlue}{ \mathsf {{\color {RoyalBlue}{{let}~x={new}~e~{in}~s}}} }}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathbf {{\color {RedOrange}{L^{P}}}}}}} =
&
\mathbf {{\color {RedOrange}{... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.07275994122028351,
0.003652875544503331,
-0.004841252230107784,
-0.010025856085121632,
-0.01112457923591137,
-0.021104654297232628,
-0.01631299778819084,
0.038363777101039886,
0.0076567321084439754,
0.040500182658433914,
-0.026109952479600906,
0.0189835075289011,
-0.0003211764560546726,
... | |
155154f95d2bb954b71a3517bb44c41508e3262d | subsection | 159 | 510 | Proving | By tr:eus-al: \mathsf {{\color {RoyalBlue}{C;H \triangleright {let}~x={new}~e~{in}~s}}} \mathsf {{\color {RoyalBlue}{~\mathrel {\xrightarrow{}}~}}} \mathsf {{\color {RoyalBlue}{C;H; \ell \mapsto v \triangleright s{\color {black}{\left[\mathsf {{\color {RoyalBlue}{\ell }}}\mathrel {}/\mathrel {}\mathsf {{\color {RoyalBl... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.047525811940431595,
0.01735287345945835,
-0.03174492344260216,
-0.007722563110291958,
-0.01724603958427906,
0.01297268457710743,
0.006398586090654135,
0.030188200995326042,
0.009355595335364342,
0.020786819979548454,
0.006318460684269667,
0.015765627846121788,
0.043801888823509216,
-0.0... | |
870ee3cd6250affe4ead89f5da697d10bf74ab1e | subsection | 160 | 510 | Proving | So by HPE:
\mathbf {{\color {RedOrange}{C;H\triangleright }}}
&
\mathbf {{\color {RedOrange}{let}}}~\mathbf {{\color {RedOrange}{x_{loc}}}}=\mathbf {{\color {RedOrange}{new}}}~{\color {black}{\left.\mathsf {{\color {RoyalBlue}{\mathsf {{\color {RoyalBlue}{e}}}}}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathb... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.062079742550849915,
0.03143664449453354,
-0.019853919744491577,
-0.02495092898607254,
-0.013757347129285336,
0.01980813778936863,
-0.028247198089957237,
0.017305415123701096,
0.015313918702304363,
0.017931096255779266,
-0.01290275901556015,
0.00721440464258194,
0.014550893567502499,
0.0... | |
da7db93fda2fce2658861c958bd02ae1c816099a | subsection | 161 | 510 | Proving | By definition of \operatorname{{\color {black}{\approx }}}_{\beta ^{\prime }} and by \beta ^{\prime } we get HPL \mathsf {{\color {RoyalBlue}{\ell }}}\operatorname{{\color {black}{\approx }}}_{\beta ^{\prime }}\mathbf {{\color {RedOrange}{\left\langle n,k\right\rangle }}}.
By a simple weakening lemma for \beta for subs... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.06928194314241409,
0.009446150623261929,
-0.043491967022418976,
-0.011071376502513885,
-0.02191384881734848,
-0.002153615467250347,
-0.005825634580105543,
0.023516183719038963,
0.033237021416425705,
0.02452336624264717,
-0.04144708439707756,
0.03400003910064697,
-0.010789060033857822,
0... | |
716862a6ef576e4f530b22d7a8ec09fc336e4928 | subsection | 162 | 510 | Proving | \mathsf {{\color {RoyalBlue}{s;s^{\prime }}}}
Analogous to the case above by IH, tr:compup-seq and a case analysis on what \mathsf {{\color {RoyalBlue}{s}}} reduces to, either with tr:eus-seq and tr:et-seq or with tr:eus-step and tr:et-step.
\mathsf {{\color {RoyalBlue}{{let}~x=e~{in}~s}}}
Analogous to the case above b... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.03777908906340599,
-0.00903280358761549,
-0.017684154212474823,
0.028776803985238075,
-0.001793782110325992,
-0.0011882256949320436,
-0.0021399506367743015,
0.05203016847372055,
0.026427054777741432,
0.06927184015512466,
-0.004234126769006252,
-0.0017251205863431096,
-0.001897727954201400... | |
e2a87c0d8efd3031be447e13a9a579645d89904d | subsection | 163 | 510 | Proving | \mathsf {{\color {RoyalBlue}{{call}~f~e}}}
By tr:compup-call {\color {black}{\left.\mathsf {{\color {RoyalBlue}{ \mathsf {{\color {RoyalBlue}{{call}~f~e}}} }}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathbf {{\color {RedOrange}{L^{P}}}}}}} = \mathbf {{\color {RedOrange}{{call}~f~{\color {black}{\left.\mathsf ... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.06315537542104721,
0.0015941392630338669,
0.006212566513568163,
0.005590928718447685,
-0.015171019360423088,
0.002215777290984988,
-0.010754719376564026,
0.02636050432920456,
0.008374951779842377,
0.032889608293771744,
-0.02187555655837059,
0.008024088107049465,
0.013248899020254612,
0.... | |
32c709000443a6e35ad0de6ce48576a5069028a5 | subsection | 164 | 510 | Proving | So as \mathsf {{\color {RoyalBlue}{C}}} is whole, we apply tr:eus-call-i
&
\mathsf {{\color {RoyalBlue}{C, H \triangleright ({call}~f~e\rho )_{\overline{f^{\prime }}} }}} \mathsf {{\color {RoyalBlue}{~\mathrel {\xrightarrow{}}~}}}
\\
&
\mathsf {{\color {RoyalBlue}{C, H \triangleright (s;{return;}\rho {\color {black}{\... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.019620634615421295,
0.04137726500630379,
-0.029766608029603958,
-0.00009184060763800517,
-0.01336522214114666,
-0.03710527345538139,
-0.01316688023507595,
0.02784421294927597,
0.0329248271882534,
0.04082800820469856,
-0.04366583004593849,
-0.005496371537446976,
0.018888292834162712,
0.0... | |
e6a647255f4cb076c29f8bc0ebbbdbc15c5819e6 | subsection | 165 | 510 | Proving | So by HP and HPR we have that \mathsf {{\color {RoyalBlue}{\rho }}}{\color {black}{\left[\mathsf {{\color {RoyalBlue}{v}}}\mathrel {}/\mathrel {}\mathsf {{\color {RoyalBlue}{x}}}\right]}}\operatorname{{\color {black}{\approx _{\beta }}}}{\color {black}{\left.\mathsf {{\color {RoyalBlue}{\mathsf {{\color {RoyalBlue}{\rh... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05311648175120354,
0.0259633120149374,
-0.025917548686265945,
-0.01856483705341816,
-0.016063082963228226,
0.007909504696726799,
-0.0057204714976251125,
0.021615754812955856,
0.044116273522377014,
0.000429750420153141,
-0.025383638218045235,
0.014194396324455738,
0.005880644544959068,
0... | |
95fb7b371e1e050e7f1cfbc3c563fd528ba0c220 | subsection | 166 | 510 | Proving | \spadesuit
Proof of thm:comp-up-rsc (thm:comp-up-rsc)
HPM: \mathsf {{\color {RoyalBlue}{M}}}\operatorname{{\color {black}{\approx _{\beta }}}}\mathbf {{\color {RedOrange}{M}}}
HP1: \mathsf {{\color {RoyalBlue}{M}}}\vdash \mathsf {{\color {RoyalBlue}{C}}} : \mathsf {{\color {RoyalBlue}{rs}}}
TH1: \mathbf {{\color {Re... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.07784441113471985,
0.010653999634087086,
-0.007792072836309671,
0.019598474726080894,
-0.0012706955894827843,
-0.030008256435394287,
-0.029657194390892982,
0.0375790074467659,
0.023368587717413902,
0.050644658505916595,
-0.024650730192661285,
0.002302897162735462,
-0.008944475091993809,
... | |
63f313c6ea0bd7278a9d9c03da816c963b4588a5 | subsection | 167 | 510 | Proving | \mathbf {{\color {RedOrange}{M}}}\vdash \mathbf {{\color {RedOrange}{A}}}:\mathbf {{\color {RedOrange}{attacker}}} \text{ and either } \nvdash \mathbf {{\color {RedOrange}{A\left[{\color {black}{\left.\mathsf {{\color {RoyalBlue}{C}}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathbf {{\color {RedOrange}{L^{P}}}... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.052649568766355515,
0.02872072160243988,
-0.02832394279539585,
-0.025409139692783356,
0.0010930508142337203,
-0.031238744035363197,
-0.021578693762421608,
0.0226774662733078,
0.037327781319618225,
0.00040130989509634674,
-0.03766351938247681,
-0.0056045083329081535,
0.005532019771635532,
... | |
1c8b17e92dd474f7fff228094269314f736a0335 | subsection | 168 | 510 | Proving | We can apply thm:backtr-corr (thm:backtr-corr) with HPRT1 and instantiate \mathsf {{\color {RoyalBlue}{A}}} with a \mathbf {{\color {RedOrange}{A}}} from {\color {black}{\left\langle \!\left\langle {\mathbf {{\color {RedOrange}{A}}}} \right\rangle \!\right\rangle ^{}_{}}} and we get the following unfolded HPs
HPRS \mat... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04317862540483475,
0.028516201302409172,
-0.007247295696288347,
-0.003986012656241655,
-0.005614747293293476,
-0.02180291712284088,
-0.021680857986211777,
0.015112519264221191,
0.024991728365421295,
0.026044493541121483,
-0.04891543090343475,
-0.02569357119500637,
0.015501584857702255,
... | |
430d04b03f9e8363a3e791bb6c8a7e6aa7a660a6 | subsection | 169 | 510 | Proving | By the first clause of tr:mon-rel-sing (tr:mon-rel-sing) we know that
HPMRBI: (\mathsf {{\color {RoyalBlue}{\sigma _c}}}, \mathsf {{\color {RoyalBlue}{H}}}, \_) \in \mathsf {{\color {RoyalBlue}{\rightsquigarrow }}} \iff (\mathbf {{\color {RedOrange}{\sigma _c}}}, \mathbf {{\color {RedOrange}{H}}}, \_) \in \mathbf {{\co... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.03722633793950081,
0.011320468038320541,
-0.003078038338571787,
0.0021378444507718086,
0.0028606303967535496,
0.004893585108220577,
-0.010923794470727444,
-0.003194370772689581,
0.04076589271426201,
0.035059887915849686,
-0.010565261356532574,
-0.04744832217693329,
0.0004193207423668355,
... | |
8ed0cb0216c65d1adbd6a12be12630b9b301966f | subsection | 170 | 510 | Proving | \mathbf {{\color {RedOrange}{\epsilon }}}
The proof proceeds by analysis of the target reductions.
tr:et-seq
In this case we do not need to pick and the thesis holds by tr:eus-seq.
tr:et-step
In this case we do not need to pick and the thesis holds by tr:eus-step.
tr:et-ift
We have: \mathbf {{\color {RedOrange}{H \tri... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.0453290119767189,
0.016910620033740997,
-0.0337296687066555,
0.028754159808158875,
-0.009790761396288872,
0.0005317955510690808,
0.003456909442320466,
0.007810478564351797,
0.036873701959848404,
0.03608006238937378,
-0.02173350565135479,
-0.03047879971563816,
-0.006925265770405531,
0.02... | |
37cb534c622f41c0acf943808cf33b285c0237d5 | subsection | 171 | 510 | Proving | \mathbf {{\color {RedOrange}{\alpha !}}}
The proof proceeds by case analysis on \mathbf {{\color {RedOrange}{\alpha !}}}
\mathbf {{\color {RedOrange}{\mathtt {call}~ f~ v~H{!}}}}
This follows by thm:action-det-expr (thm:action-det-expr) and by tr:eus-callback.
\mathbf {{\color {RedOrange}{\mathtt {ret}~ H{!}}}}
In thi... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.034920256584882736,
-0.01157649327069521,
-0.01744486577808857,
0.023473495617508888,
-0.007661699783056974,
-0.0003763123240787536,
-0.015628647059202194,
0.03351612016558647,
0.02886110544204712,
0.02449607290327549,
-0.0197342187166214,
-0.007222907617688179,
-0.001084580784663558,
0... | |
eeba602b75cf7fbaba09f819d14fddbb4b5b6c04 | subsection | 172 | 510 | Proving | \mathsf {{\color {RoyalBlue}{x}}}
This follows from the relation of the substitutions and the totality of \operatorname{{\color {black}{\approx _{\beta }}}} and tr:compup-var.
\mathsf {{\color {RoyalBlue}{\left\langle v,v^{\prime }\right\rangle }}}
This follows from induction on \mathsf {{\color {RoyalBlue}{v}}} and \m... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04639173671603203,
-0.013368145562708378,
-0.03735755756497383,
-0.0031818016432225704,
-0.021089928224682808,
0.005310633219778538,
0.015947159379720688,
0.01545882597565651,
0.067145936191082,
0.018648257479071617,
-0.038151100277900696,
0.014955230988562107,
-0.006264410447329283,
0.... | |
2d00e483d9f9953d04d9631d6a1a4c73155cd525 | subsection | 173 | 510 | Proving | We apply the IH with:
IHV1 \mathsf {{\color {RoyalBlue}{n}}}\operatorname{{\color {black}{\approx _{\beta }}}}\mathbf {{\color {RedOrange}{n}}}
IHV2 \mathsf {{\color {RoyalBlue}{n^{\prime }}}}\operatorname{{\color {black}{\approx _{\beta }}}}\mathbf {{\color {RedOrange}{n^{\prime }}}}
By IH we get
IHTE1 \mathbf {{\colo... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.03616751730442047,
0.029193442314863205,
-0.02469157800078392,
-0.008721407502889633,
-0.013696348294615746,
0.004696435760706663,
-0.0019953176379203796,
0.03238289803266525,
0.015451312065124512,
0.028170986101031303,
-0.052191101014614105,
-0.017091821879148483,
-0.007080897688865662,
... | |
d77876be641ad8b679754bb6b20ad7643536f84c | subsection | 174 | 510 | Proving | By tr:et-op with IHTE1 and IHTE2 we have that \mathbf {{\color {RedOrange}{H\triangleright {\color {black}{\left.\mathsf {{\color {RoyalBlue}{e}}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathbf {{\color {RedOrange}{L^{P}}}}}}}\oplus {\color {black}{\left.\mathsf {{\color {RoyalBlue}{e^{\prime }}}} \right.^{\m... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.033296629786491394,
0.03424273058772087,
-0.010964082553982735,
-0.00015068937500473112,
0.0006332768243737519,
0.01075044646859169,
-0.024125559255480766,
0.0269333403557539,
0.014954489655792713,
0.039492059499025345,
-0.02348465286195278,
-0.02642977051436901,
0.0026666296180337667,
... | |
f6af2409fefac425d931e49951c8da28efd50fdf | subsection | 175 | 510 | Proving | \spadesuit
Proof of thm:backtr-corr (thm:backtr-corr)
HP1 \mathbf {{\color {RedOrange}{\Omega _0}}}\left(\mathbf {{\color {RedOrange}{A\left[{\color {black}{\left.\mathsf {{\color {RoyalBlue}{C}}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathbf {{\color {RedOrange}{L^{P}}}}}}}\right]}}}\right) \mathbf {{\co... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.06962541490793228,
0.02428651787340641,
-0.004221918061375618,
0.00015660570352338254,
0.006544545292854309,
-0.018870867788791656,
-0.03380585461854935,
0.023783091455698013,
0.023279665037989616,
0.03255491703748703,
-0.03404994308948517,
-0.019359039142727852,
-0.011067756451666355,
... | |
33edf1ba924ca992476868ab6b9fafd8e73413c9 | subsection | 176 | 510 | Proving | Base case:
We perform a case analysis on \mathbf {{\color {RedOrange}{\alpha ?}}}
\mathbf {{\color {RedOrange}{\mathtt {call}~ f~ v~ H{?}}}}
Given
HP1 \mathbf {{\color {RedOrange}{\Omega _0}}}\left(\mathbf {{\color {RedOrange}{A\left[{\color {black}{\left.\mathsf {{\color {RoyalBlue}{C}}} \right.^{\mathsf {{\color {Ro... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05403881147503853,
0.00034303468419238925,
-0.036585282534360886,
0.037256572395563126,
0.018124818801879883,
-0.0057669878005981445,
-0.010931340046226978,
0.041101228445768356,
0.03637168928980827,
0.008810675702989101,
-0.048119258135557175,
-0.019528424367308617,
0.003142855828627944,... | |
234c07233cd0c6b27ecc2c916b9d88e07253034e | subsection | 177 | 510 | Proving | Given that \mathsf {{\color {RoyalBlue}{\ell _i}}} is initialised to 1 in tr:backtr-skel, this code is executed and it generates action \mathsf {{\color {RoyalBlue}{\mathtt {call}~ f~ v~ H{?}}}} where \mathsf {{\color {RoyalBlue}{H}}}=\mathsf {{\color {RoyalBlue}{\ell _1\mapsto v_1;\cdots ;\ell _n\mapsto v_n}}} for all... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.021530428901314735,
0.0184633731842041,
-0.004119926132261753,
-0.010948321782052517,
0.007015318609774113,
-0.0010757584823295474,
0.011871490627527237,
0.05075138434767723,
0.001148238661698997,
0.025925016030669212,
-0.05120915547013283,
-0.03381391242146492,
-0.02050807699561119,
0.... | |
68a1e9b666adcd797585c20e2d091ab38dc93cb0 | subsection | 178 | 510 | Proving | Inductive case:
We know that (eliding conditions HP that are trivially satisfied):
IHP1 \mathbf {{\color {RedOrange}{\Omega _0}}}\left(\mathbf {{\color {RedOrange}{A\left[{\color {black}{\left.\mathsf {{\color {RoyalBlue}{C}}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathbf {{\color {RedOrange}{L^{P}}}}}}}\ri... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.03131518140435219,
0.03171196207404137,
-0.011331151239573956,
-0.005932639818638563,
-0.016054371371865273,
-0.054267436265945435,
-0.00998056959360838,
0.010308676399290562,
0.030781053006649017,
0.010728348977863789,
-0.06372913718223572,
-0.01994587853550911,
-0.013925488106906414,
... | |
4a75de4eb3840e81c0be6d3a997f0087fcc744bc | subsection | 179 | 510 | Proving | We perform a case analysis on \mathbf {{\color {RedOrange}{\alpha !}}}, and show that the back-translated code performs \mathsf {{\color {RoyalBlue}{\alpha !}}}.
By IH we have that the existing code is generated by tr:backtr-listact: {\color {black}{\left\langle \!\left\langle {\mathbf {{\color {RedOrange}{\overline{\a... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.0491960272192955,
0.01623591035604477,
-0.012138783931732178,
0.0022164152469486,
0.004841017536818981,
0.02592557482421398,
0.021683484315872192,
0.031190037727355957,
0.020859481766819954,
0.0423903726041317,
-0.02612394466996193,
-0.017410876229405403,
-0.00875121634453535,
0.0160985... | |
0c8711c15118da6841afa66217d923ef3a939d16 | subsection | 180 | 510 | Proving | \mathbf {{\color {RedOrange}{\mathtt {call}~ f~ v~ H{!}}}}
By tr:backtr-callback-loc this code is placed at function \mathsf {{\color {RoyalBlue}{f}}} so it is executed when compiled code jumps there
\mathsf {{\color {RoyalBlue}{
\begin{aligned}&
\mathsf {{\color {RoyalBlue}{if}}}~!\ell _i == n
~\mathsf {{\color {Royal... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05541506037116051,
0.019453249871730804,
-0.014387776143848896,
0.00853654369711876,
-0.003308959538117051,
0.008795919828116894,
0.029324820265173912,
-0.006553074810653925,
0.005408766213804483,
0.010352180339396,
-0.04287343472242355,
0.00938333198428154,
-0.028668750077486038,
0.054... | |
afff18afc12ca653009a4c9df59b4cc077db06e5 | subsection | 181 | 510 | Proving | \mathbf {{\color {RedOrange}{\mathtt {ret}~ H{!}}}}
In this case from IHF we know that \mathsf {{\color {RoyalBlue}{\overline{f}}}} = \mathsf {{\color {RoyalBlue}{f^{\prime }\overline{f^{\prime }}}}}.
This code is placed at \mathsf {{\color {RoyalBlue}{f^{\prime }}}}, so we identify the last called function and the cod... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.029918279498815536,
-0.01600421965122223,
-0.028209535405039787,
-0.009108216501772404,
0.0022961250506341457,
0.009298925288021564,
0.03710415959358215,
0.018582593649625778,
0.01896400935947895,
0.002143558580428362,
-0.03255768120288849,
-0.0050232503563165665,
-0.02361728623509407,
... | |
4b40f5c042c146d15f8bb0f490a4714475f496c3 | subsection | 182 | 510 | Proving | \mathsf {{\color {RoyalBlue}{\alpha !}}}\operatorname{{\color {black}{\approx }}}_{\beta ^{\prime \prime }}\mathbf {{\color {RedOrange}{\alpha !}}}
By IH-THS and tr:state-rel-whole and HP-AC! we get HP-OM2:
HP-OM2: \mathsf {{\color {RoyalBlue}{\Omega ^{\prime \prime }}}}\operatorname{{\color {black}{\approx }}}_{\beta ... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04928744211792946,
0.011047711595892906,
-0.03152565285563469,
-0.021820755675435066,
-0.010460229590535164,
0.004585410468280315,
-0.013786750845611095,
0.026627426967024803,
0.029572466388344765,
0.00914793275296688,
-0.041077956557273865,
-0.003181557869538665,
-0.0008235237328335643,
... | |
53139464f4718c684dc742c16c713482bd9dc6ec | subsection | 183 | 510 | Proving | We perform a case analysis on \mathbf {{\color {RedOrange}{\alpha ?}}} and show that the back-translated code performs \mathsf {{\color {RoyalBlue}{\alpha ?}}}:
\mathbf {{\color {RedOrange}{\mathtt {ret}~ H{?}}}}
By tr:backtr-retback, after \mathsf {{\color {RoyalBlue}{n}}} actions, we have from IHF1 that \mathsf {{\co... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04086591303348541,
0.011917953379452229,
-0.01651117205619812,
0.003086307318881154,
0.008530263788998127,
0.01499281544238329,
0.01516830362379551,
0.0342736542224884,
0.0013543128734454513,
0.022126801311969757,
-0.03988928347826004,
-0.016633251681923866,
-0.006710524670779705,
0.043... | |
085bd444c773c651e74ac5779d3e601041aa43cf | subsection | 184 | 510 | Proving | By thm:atk-has-all-caps (thm:atk-has-all-caps) we know all capabilities to access any \mathbf {{\color {RedOrange}{n}}} are in \mathbf {{\color {RedOrange}{ak}}}.
We induce on the size of \mathbf {{\color {RedOrange}{H}}}; the base case is trivial and the inductive case follows from IH and the following:
\mathbf {{\col... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.019261715933680534,
0.006784337107092142,
0.007883261889219284,
-0.002337123965844512,
-0.01565968431532383,
-0.020406430587172508,
0.009310338646173477,
-0.014369972981512547,
0.03147199749946594,
0.01666703261435032,
-0.025168439373373985,
-0.023169007152318954,
-0.004678063560277224,
... | |
189e3e9b4ec74945fb721b09a9570597ee402cf5 | subsection | 185 | 510 | Proving | By thm:reg-no-dup (thm:reg-no-dup) we have that:
\mathsf {{\color {RoyalBlue}{C; H^{\prime }; \ell ^{\prime \prime }\mapsto {\color {black}{\left\langle \!\left\langle {\mathbf {{\color {RedOrange}{v_1}}}} \right\rangle \!\right\rangle ^{\mathbf {{\color {RedOrange}{L^{P}}}}}_{\mathsf {{\color {RoyalBlue}{L^{U}}}}}}} \... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.06915825605392456,
0.009781650267541409,
-0.006569423712790012,
-0.03332780674099922,
-0.037875283509492874,
0.009743500500917435,
0.01635870337486267,
0.03613564372062683,
0.028627732768654823,
0.023561416193842888,
-0.026979653164744377,
-0.018128862604498863,
-0.0016223271377384663,
... | |
d9b03a573b503ab7a75337b098346a65047ff75f | subsection | 186 | 510 | Proving | By thm:backtr-vals (thm:backtr-vals) on the values stored on the heap, let the heap after these reduction steps be \mathsf {{\color {RoyalBlue}{H}}}, we can conclude
HPRH \mathsf {{\color {RoyalBlue}{H}}}\operatorname{{\color {black}{\approx }}}_{\beta ^{\prime \prime }}\mathbf {{\color {RedOrange}{H}}}.
As no other \m... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.026611778885126114,
0.0026989439502358437,
0.007473118603229523,
0.02432292141020298,
-0.01696806028485298,
-0.023468414321541786,
0.008102553896605968,
0.03451596572995186,
0.007251862436532974,
0.035065289586782455,
-0.053742364048957825,
-0.023315824568271637,
-0.018875442445278168,
... | |
764821ae1fc20dcae36e216a13ebb3f9cd1a8189 | subsection | 187 | 510 | Proving | \spadesuit
Lemma 11 (\mathsf {{\color {RoyalBlue}{L^{\tau }}}} attacker always has access to all capabilities)
&
\forall \\
\text{if }
&
{\color {black}{\left\langle \!\left\langle {\mathbf {{\color {RedOrange}{\alpha }}}, n, \mathbf {{\color {RedOrange}{H}}}, \mathbf {{\color {RedOrange}{ak}}}, \mathsf {{\color {Ro... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.060327887535095215,
0.05013592168688774,
-0.01957528479397297,
-0.009268890134990215,
-0.009184974245727062,
-0.002162741031497717,
0.015623610466718674,
0.0005259046447463334,
0.06212826445698738,
0.0354582741856575,
-0.010825147852301598,
0.006141116376966238,
-0.005835967604070902,
0... | |
a1868c55f3f46eaab0721096231b9cb9646e1eaf | subsection | 188 | 510 | Proving | \spadesuit
Proof of thm:src-ty-impl-safe (thm:src-ty-impl-safe)
HP1 \vdash \mathsf {{\color {RoyalBlue}{C}}}:\mathsf {{\color {RoyalBlue}{UN}}}
HP2 \mathsf {{\color {RoyalBlue}{C\mathop {\raisebox {1mm}{\frown }}M}}}
TH \mathsf {{\color {RoyalBlue}{M}}}\vdash \mathsf {{\color {RoyalBlue}{C}}}:\mathsf {{\color {Roya... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.0764273926615715,
0.02571488916873932,
-0.020724521949887276,
0.025409666821360588,
-0.0019839380402117968,
-0.038793619722127914,
-0.028706056997179985,
-0.0037580362986773252,
0.033269114792346954,
0.01822170801460743,
-0.020144600421190262,
0.03470365330576897,
0.008248603902757168,
... | |
e14c21c5ff9d57884d0625a720fcaea8a0bceded | subsection | 189 | 510 | Proving | By tr:plug-s we need to show that the heaps consituting the initial heap – both \mathsf {{\color {RoyalBlue}{H}}} and \mathsf {{\color {RoyalBlue}{H_0}}} – are well typed.
The latter, \vdash \mathsf {{\color {RoyalBlue}{H_0}}}:\mathsf {{\color {RoyalBlue}{\Delta }}}, holds by tr:plug-s.
The former holds by definition o... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.045329317450523376,
0.019703755155205727,
-0.014438227750360966,
0.01833013817667961,
0.0010798146249726415,
-0.025549253448843956,
0.01434665359556675,
-0.005734845530241728,
0.018360663205385208,
0.039285410195589066,
-0.011080499738454819,
-0.012103080749511719,
0.0054257819429039955,
... | |
9eaccd2ce34f50579f2c7daa4f376f43eea47e44 | subsection | 190 | 510 | Proving | \mathsf {{\color {RoyalBlue}{\mathtt {call}~ f~ v{!}}}}
This holds by thm:src-!-rel (thm:src-!-rel)
\mathsf {{\color {RoyalBlue}{\mathtt {ret}~ {!}}}}
This holds by thm:src-!-rel (thm:src-!-rel)
\mathsf {{\color {RoyalBlue}{\mathtt {ret}~ {?}}}}
This holds by thm:src-?-rel (thm:src-?-rel)
\spadesuit
Lemma 14 (\ma... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.03771485760807991,
0.03283267468214035,
-0.03341243416070938,
0.006491776555776596,
-0.0038409042172133923,
0.010588232427835464,
0.00398584408685565,
0.013075093738734722,
0.02796575054526329,
0.052056267857551575,
-0.018109844997525215,
0.024624506011605263,
-0.02666892111301422,
-0.0... | |
3b7d30c38cf0e4698ccb2c23abe2401b7d5cf46a | subsection | 191 | 510 | Proving | \spadesuit
Lemma 15 (\mathsf {{\color {RoyalBlue}{L^{\tau }}}} attacker reduction respects heap typing)
\text{if }
&
\mathsf {{\color {RoyalBlue}{C}}}\equiv \mathsf {{\color {RoyalBlue}{\Delta ; \cdots }}}
\\
&
\mathsf {{\color {RoyalBlue}{C}}}\vdash _{\mathsf {{\color {RoyalBlue}{att}}}}\mathsf {{\color {RoyalBlue}... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.06841620802879333,
0.0040013715624809265,
-0.028165996074676514,
0.014266092330217361,
-0.010207503102719784,
-0.0024088334757834673,
0.01400670874863863,
0.03875494375824928,
0.04272198677062988,
0.03472687304019928,
-0.03075983002781868,
0.004337044432759285,
-0.004218796268105507,
-0... | |
8c806f60d1558faa23b356dc6db6d4abd3f785a5 | subsection | 192 | 510 | Proving | \spadesuit
Lemma 16 (\mathsf {{\color {RoyalBlue}{L^{\tau }}}} typed reduction respects heap typing)
\text{if }
&
\mathsf {{\color {RoyalBlue}{C}}}\equiv \mathsf {{\color {RoyalBlue}{\Delta ; \cdots }}}
\\
&
\mathsf {{\color {RoyalBlue}{C,\Gamma }}}\vdash \mathsf {{\color {RoyalBlue}{s}}}
\\
&
\mathsf {{\color {Roya... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.08211503177881241,
0.007272827904671431,
-0.021215595304965973,
-0.0011523577850311995,
-0.009760700166225433,
-0.009898066520690918,
0.018162989988923073,
0.05577106773853302,
0.037730179727077484,
0.017109842970967293,
-0.037638600915670395,
0.017292998731136322,
0.0024478065315634012,
... | |
3a59f887087f72a2d74538a0799812e39ef5fb86 | subsection | 193 | 510 | Proving | There, the only non-trivial cases are:
tr:ts-new
By IH we have that
\mathsf {{\color {RoyalBlue}{H\triangleright e\rho \operatorname{\mathsf {{\color {RoyalBlue}{\ \hookrightarrow \!\!\!\!\rightarrow \ }}}}v}}}
So
\mathsf {{\color {RoyalBlue}{C;H \triangleright \mathsf {{\color {RoyalBlue}{let}}}~x=\mathsf {{\color {Ro... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04714834317564964,
0.024581223726272583,
-0.016936782747507095,
0.0032881773076951504,
-0.0130840465426445,
0.025756116956472397,
0.008521796204149723,
0.04797229543328285,
0.04775867611169815,
0.01035279966890812,
-0.015090521425008774,
-0.024092955514788628,
0.028227971866726875,
0.00... | |
e70c254eb096671f6e6c7c8a61ea46d61db780de | subsection | 194 | 510 | Proving | So
\mathsf {{\color {RoyalBlue}{C;H \triangleright x:=e\rho }}} \mathsf {{\color {RoyalBlue}{~\mathrel {\xrightarrow{}}~}}} \mathsf {{\color {RoyalBlue}{C;H^{\prime } \triangleright \mathsf {{\color {RoyalBlue}{skip}}}}}}
where {\color {black}{\left[\mathsf {{\color {RoyalBlue}{x}}}\mathrel {}/\mathrel {}\mathsf {{\col... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.046047769486904144,
0.007865349762141705,
-0.042324889451265335,
-0.01059648022055626,
-0.01269441470503807,
0.03738139197230339,
0.030912121757864952,
0.04479663819074631,
0.01817193254828453,
0.019636673852801323,
-0.004630715120583773,
-0.002967624692246318,
0.02360367774963379,
0.00... | |
2f41268087dbcdec71fa9da0e02371c6732eb8ec | subsection | 195 | 510 | Proving | By HPT we get that {{\color {black}{\mathtt {mon\text{-}care}(}}\mathsf {{\color {RoyalBlue}{H}}}{{\color {black}{)}}}} ={{\color {black}{\mathtt {mon\text{-}care}(}}\mathsf {{\color {RoyalBlue}{H^{\prime }}}}{{\color {black}{)}}}} as by tr:h-sec-s function {{\color {black}{\mathtt {mon\text{-}care}(}}\cdot {{\color {b... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.054572705179452896,
0.01018659956753254,
-0.011941595003008842,
-0.029010826721787453,
-0.013215873390436172,
0.00019612543110270053,
0.00945408083498478,
0.029544955119490623,
0.031009994447231293,
0.004982659127563238,
-0.007859324105083942,
0.007420575711876154,
0.0074854339472949505,
... | |
df9935f69523a5dc49b9587484cfb8ee60f8abca | subsection | 196 | 510 | Proving | \spadesuit
Lemma 17 (\mathsf {{\color {RoyalBlue}{L^{\tau }}}} any non-cross reduction respects heap typing)
\text{if }
&
\mathsf {{\color {RoyalBlue}{C}}}\equiv \mathsf {{\color {RoyalBlue}{\Delta ; \cdots }}}
\\
&
\vdash {{\color {black}{\mathtt {mon\text{-}care}(}}\mathsf {{\color {RoyalBlue}{H}}},\mathsf {{\colo... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.08129674196243286,
0.01409875974059105,
-0.01797439344227314,
0.008765949867665768,
-0.011192034929990768,
-0.012389819137752056,
0.012252493761479855,
0.05749364197254181,
0.041197676211595535,
0.034636564552783966,
-0.04547002539038658,
0.0048140245489776134,
0.02160589210689068,
-0.0... | |
f5d27ede404bbcb50e74d1ef2b3d4a5f03cd14ab | subsection | 197 | 510 | Proving | \mathsf {{\color {RoyalBlue}{C}}}\lnot \vdash _{\mathsf {{\color {RoyalBlue}{att}}}}\mathsf {{\color {RoyalBlue}{\Pi ^{\prime \prime }\mathsf {{\color {RoyalBlue}{~\mathrel {\xrightarrow{}}~}}}\Pi }}}:
In this case we induce on \mathsf {{\color {RoyalBlue}{\Pi ^{\prime \prime }}}}.
The base case is trivial.
The inducti... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05417957156896591,
0.01176688726991415,
0.0017789595294743776,
-0.0011494081700220704,
-0.01593337208032608,
-0.022297564893960953,
0.020191429182887077,
0.055339470505714417,
0.03775781765580177,
0.03128679469227791,
-0.045449793338775635,
0.0035216722171753645,
0.025304149836301804,
-... | |
c358dafba99dd300906317d9fd958a65ed07f14f | subsection | 198 | 510 | Proving | \spadesuit
Lemma 19 (\mathsf {{\color {RoyalBlue}{L^{\tau }}}}-! actions respect heap typing)
\text{if }
&
\mathsf {{\color {RoyalBlue}{C}}}\equiv \mathsf {{\color {RoyalBlue}{\Delta ; \cdots }}}
\\
&
\mathsf {{\color {RoyalBlue}{C, H\triangleright \Pi \rho }}} \mathsf {{\color {RoyalBlue}{~\mathrel {{~\alpha !~}}~}... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.056258317083120346,
0.0387367382645607,
-0.020726749673485756,
-0.0041056666523218155,
-0.012919876724481583,
0.00314220879226923,
-0.014423253014683723,
0.021215155720710754,
0.03296743705868721,
0.02834283746778965,
-0.02145935781300068,
-0.004239215515553951,
-0.009165252558887005,
-... | |
b37962c461b6c7b9d90c6e9c522764ba3a2c5499 | subsection | 199 | 510 | Proving | \spadesuit
Lemma 20 (Expressions compiled with {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{L^{\tau }}}}}_{\mathbf {{\color {RedOrange}{L^{\pi }}}}}}} are related)
&
\forall \\
\text{if }
&\ \mathsf {{\color {RoyalBlue}{H}}}\operatorname{{\color {black}{\approx _... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05620087683200836,
0.02549176663160324,
-0.011853442527353764,
-0.0006025881157256663,
-0.0017295804573222995,
-0.03069385513663292,
-0.019542161375284195,
0.035545073449611664,
0.08439284563064575,
0.03572813794016838,
-0.031090496107935905,
0.034660257399082184,
-0.005007583647966385,
... | |
51cf0df93e6656dc8bcf9e8284665ed0e6e73d1c | subsection | 200 | 510 | Proving | \exists \beta ^{\prime }
\\
\text{ if }&\ \mathsf {{\color {RoyalBlue}{C;\Gamma }}}\vdash \mathsf {{\color {RoyalBlue}{\Pi }}},
\\
&\ \vdash \mathsf {{\color {RoyalBlue}{C}}}:\mathsf {{\color {RoyalBlue}{whole}}}
\\
&\ \mathsf {{\color {RoyalBlue}{C}}}=\mathsf {{\color {RoyalBlue}{\Delta ; \overline{F} ; \overline{I}}}... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.061468616127967834,
0.01727469637989998,
-0.005241923965513706,
-0.009163829497992992,
-0.029574522748589516,
-0.0015699065988883376,
0.0019552300218492746,
0.049718160182237625,
0.05487615242600441,
0.024324968457221985,
-0.036075424402952194,
-0.008217688649892807,
0.009278281591832638,... | |
94e24dc66b58cc65229897db8e8eb50b20d67b1d | subsection | 201 | 510 | Proving | Base Case
\mathsf {{\color {RoyalBlue}{skip}}}
Trivial by tr:compap-skip.
Inductive Case
In this case we proceed by induction on the typing of \mathsf {{\color {RoyalBlue}{s}}}
Inductive Cases
tr:ts-new
There are 2 cases, they are analogous. | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.036224205046892166,
0.01148981787264347,
-0.00868221279233694,
0.02268971875309944,
-0.001090998644940555,
-0.000017642896636971273,
0.03189072757959366,
0.014373715966939926,
0.025039562955498695,
0.02714526653289795,
-0.01725761406123638,
-0.000013291777577251196,
0.024673353880643845,
... | |
ea984c9e6f006dbfdbe7258eeb543ef18e99ceb0 | subsection | 202 | 510 | Proving | \mathsf {{\color {RoyalBlue}{\tau }}}=\mathsf {{\color {RoyalBlue}{UN}}}
By HP
\mathsf {{\color {RoyalBlue}{\Gamma }}}\vdash \mathsf {{\color {RoyalBlue}{e}}} : \mathsf {{\color {RoyalBlue}{\tau }}}
\mathsf {{\color {RoyalBlue}{H \triangleright e\operatorname{\mathsf {{\color {RoyalBlue}{\ \hookrightarrow \!\!\!\!\rig... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04986519366502762,
0.044127948582172394,
-0.04385329410433769,
0.006229334510862827,
-0.019470008090138435,
0.028014838695526123,
0.014396514743566513,
0.04150346666574478,
0.03387415409088135,
0.023727165535092354,
-0.006774830631911755,
0.010887030512094498,
-0.005283299833536148,
0.0... | |
d181f8685564de17f5778d8278e771f6225a3372 | subsection | 203 | 510 | Proving | \spadesuit
Proof of thm:comp-ap-rsc (thm:comp-ap-rsc)
Given:
HP1: \mathsf {{\color {RoyalBlue}{M}}}\vdash \mathsf {{\color {RoyalBlue}{C}}} : \mathsf {{\color {RoyalBlue}{rs}}}
HPM: \mathsf {{\color {RoyalBlue}{M}}}\operatorname{{\color {black}{\approx _{\beta }}}}\mathbf {{\color {RedOrange}{M}}}
We need to prove:
... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.08201427757740021,
0.017528720200061798,
-0.01803215779364109,
-0.012692686170339584,
0.004283018875867128,
-0.027094002813100815,
-0.040427424013614655,
0.005194542463868856,
0.028863655403256416,
0.03298267722129822,
-0.02105277217924595,
-0.015324282459914684,
-0.007597304880619049,
... | |
5b9d3530396ff2c53c8c961a7cc5ccc94fe65478 | subsection | 204 | 510 | Proving | \mathbf {{\color {RedOrange}{M}}}\vdash \mathbf {{\color {RedOrange}{A}}}:\mathbf {{\color {RedOrange}{attacker}}}, \vdash \mathbf {{\color {RedOrange}{A\left[{\color {black}{\left.\mathsf {{\color {RoyalBlue}{C}}} \right.^{\mathsf {{\color {RoyalBlue}{L^{\tau }}}}}_{\mathbf {{\color {RedOrange}{L^{\pi }}}}}}}\right]}}... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05009279400110245,
0.01607181876897812,
-0.004346107132732868,
0.008593005128204823,
-0.007123952265828848,
-0.021673299372196198,
-0.02028437703847885,
0.0058876583352684975,
0.042003463953733444,
0.03177732974290848,
-0.05885368958115578,
-0.004342291038483381,
0.009485883638262749,
-... | |
d971e92dcf57b911b9522d72a44e6b1859d54515 | subsection | 205 | 510 | Proving | Base case:
this holds by tr:mtt-t-s-b.
Inductive case:
By tr:mtt-t-s, \mathbf {{\color {RedOrange}{M;\overline{H}\rightsquigarrow M^{\prime \prime }}}} holds by IH, we need to prove \mathbf {{\color {RedOrange}{M^{\prime \prime };H\rightsquigarrow M^{\prime }}}}.
By tr:ms-t-2 e need to prove that THMR: \exists \mathbf ... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04180927574634552,
0.016693193465471268,
0.010620166547596455,
-0.005146050360053778,
-0.006443053483963013,
-0.033661045134067535,
-0.02182016894221306,
0.013183655217289925,
-0.0007944143726490438,
0.014762947335839272,
-0.04791282117366791,
-0.038879577070474625,
-0.001786240260116756,... | |
6b654140bca45d18fc46e42df3ea7faa2afe504b | subsection | 206 | 510 | Proving | \text{ if } \vdash \mathsf {{\color {RoyalBlue}{H}}}: \mathsf {{\color {RoyalBlue}{\Delta }}}
\text{ then } \exists \mathbf {{\color {RedOrange}{\sigma ^{\prime }}}}. (\mathbf {{\color {RedOrange}{\sigma }}}, {{\color {black}{\mathtt {mon\text{-}care}(}}\mathbf {{\color {RedOrange}{H}}},\mathbf {{\color {RedOrange}{H_... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05995473638176918,
0.018529798835515976,
0.0025604397524148226,
-0.006757881958037615,
-0.015446587465703487,
-0.016560817137360573,
-0.008921472355723381,
0.028344182297587395,
0.04359234496951103,
0.022376183420419693,
-0.014515518210828304,
-0.023643046617507935,
0.020681941881775856,
... | |
559581cf9fdd727d751932756efa08e392f98fa8 | subsection | 207 | 510 | Proving | \spadesuit
Lemma 22 (\operatorname{{\color {black}{\mathrel {\hbox{$\sim $}\vspace{-1.48752pt}\hbox{$\sim $}\vspace{-1.48752pt}\hbox{$\sim $}}}_{\beta }}} implies relatedness of the high heaps)
\text{if }
&\ \mathsf {{\color {RoyalBlue}{\Omega }}}=\mathsf {{\color {RoyalBlue}{\Delta ; \overline{F},\overline{F^{\pr... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.08074682950973511,
0.0023307024966925383,
-0.022002441808581352,
0.01456402987241745,
-0.008277617394924164,
-0.012488903477787971,
-0.012877989560365677,
0.05218332260847092,
0.00019823845650535077,
-0.0009126359946094453,
-0.033140987157821655,
0.045469678938388824,
-0.00984922051429748... | |
e326fea5e370d1e018a6e5bf31008055fbfdb4cf | subsection | 208 | 510 | Proving | \\
\text{ if }
&\ \mathsf {{\color {RoyalBlue}{C, H\triangleright \Pi \rho }}} \mathsf {{\color {RoyalBlue}{~\mathrel {\xrightarrow{}}~}}} \mathsf {{\color {RoyalBlue}{C, H^{\prime }\triangleright \Pi ^{\prime }\rho ^{\prime }}}}
\\
&\ \mathbf {{\color {RedOrange}{C,H\triangleright {\color {black}{\left.\mathsf {{\colo... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.09486192464828491,
0.03818283975124359,
-0.03751135990023613,
-0.03592422232031822,
-0.02835480310022831,
-0.02661505714058876,
-0.030308201909065247,
0.04270007461309433,
0.03772501274943352,
0.03094916045665741,
-0.030491333454847336,
-0.02058699168264866,
0.01159067451953888,
0.01713... | |
ab5ebc09de91042ca7f29f9435f6001c3165e620 | subsection | 209 | 510 | Proving | \mathsf {{\color {RoyalBlue}{\tau }}}=\mathsf {{\color {RoyalBlue}{UN}}}
By HP
\mathsf {{\color {RoyalBlue}{\Gamma }}}\vdash \mathsf {{\color {RoyalBlue}{e}}} : \mathsf {{\color {RoyalBlue}{\tau }}}
\mathsf {{\color {RoyalBlue}{H \triangleright e\operatorname{\mathsf {{\color {RoyalBlue}{\ \hookrightarrow \!\!\!\!\rig... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05384565889835358,
0.04618394747376442,
-0.05753915384411812,
-0.02380930446088314,
-0.027350176125764847,
0.008325625211000443,
-0.009004801511764526,
0.02815908193588257,
0.021306276321411133,
0.0154684167355299,
-0.012148850597441196,
0.01076760608702898,
0.0020604205783456564,
0.003... | |
cb93f269a71bc8eb293c764d7932a23bcc9b5175 | subsection | 210 | 510 | Proving | We need to show that this preserves tr:state-rel-proof, specifically it preserves point (2a):
\mathsf {{\color {RoyalBlue}{\ell }}}\operatorname{{\color {black}{\approx _{\beta }}}}\mathbf {{\color {RedOrange}{\left\langle n,k\right\rangle }}} \text{ and } \mathsf {{\color {RoyalBlue}{\ell \mapsto v:\tau }}}\in \mathsf... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.059827834367752075,
0.05024316906929016,
-0.01614741049706936,
-0.008401842787861824,
-0.015124842524528503,
0.010736959055066109,
0.013842817395925522,
0.03907123953104019,
0.010660648345947266,
0.01478144247084856,
-0.012431063689291477,
0.0019573774188756943,
-0.015124842524528503,
-... | |
32aff22e9136c1c84f0bd559a9945f58c5bbbbc5 | subsection | 211 | 510 | Proving | \\
\text{ if }
&\ \mathsf {{\color {RoyalBlue}{C, H\triangleright \Pi \rho }}} \mathsf {{\color {RoyalBlue}{~\mathrel {\xrightarrow{}}~}}} \mathsf {{\color {RoyalBlue}{C, H^{\prime }\triangleright \Pi ^{\prime }\rho ^{\prime }}}}
\\
&\ \mathbf {{\color {RedOrange}{C,H\triangleright \Pi \rho }}} \mathbf {{\color {RedOra... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.0974317416548729,
0.027562927454710007,
-0.025899384170770645,
-0.014987151138484478,
-0.027379784733057022,
-0.04279426857829094,
0.0006099976599216461,
0.03818518668413162,
0.045144595205783844,
0.0384599007666111,
-0.03559066727757454,
-0.01646755263209343,
0.016604909673333168,
0.00... | |
1315ca77bb6d3ce860c6b1d1aef8524f42edd16b | subsection | 212 | 510 | Proving | Suppose this does not hold by contradiction, there can be three clauses that do not hold based on tr:state-rel-proof:
violation of (1): \exists \mathbf {{\color {RedOrange}{\pi }}}\in \mathbf {{\color {RedOrange}{\Pi }}}\mathsf {{\color {RoyalBlue}{C}}}\vdash \mathbf {{\color {RedOrange}{\pi }}}:\mathbf {{\color {RedO... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.02982259914278984,
0.006780636962503195,
-0.00752048147842288,
0.0017027865396812558,
-0.013034992851316929,
-0.005537393037229776,
0.0010354010155424476,
0.031164998188614845,
-0.009145088493824005,
-0.010533250868320465,
-0.05009586364030838,
-0.04542798176407814,
-0.022576699033379555,... | |
267c258107b5c24b376ff5df2a9e01ed6887e4ca | subsection | 213 | 510 | Proving | \spadesuit
Proofs for the Non-Atomic Variant of \mathsf {{\color {RoyalBlue}{L^{\tau }}}} (sec:nonatom-new-hide)
The only proof that needs changing is that for thm:comp-act-pres-relatet: there is this new case. | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.027575258165597916,
0.03992079570889473,
-0.008942502550780773,
-0.01954837143421173,
-0.00019957535550929606,
-0.04889381676912308,
-0.006630575284361839,
0.044163141399621964,
0.0534413680434227,
0.029681172221899033,
-0.010644019581377506,
-0.049931515008211136,
-0.01934998668730259,
... | |
e33deb59c7cf8ce8504d476d50b2d84c8cf01c19 | subsection | 214 | 510 | Proving | For this we weaken \operatorname{{\color {black}{\mathrel {\hbox{$\sim $}\vspace{-1.48752pt}\hbox{$\sim $}\vspace{-1.48752pt}\hbox{$\sim $}}}_{\beta }}} and define {\color {black}{\sim _{\beta }}} as follows:
\mathsf {{\color {RoyalBlue}{\Omega }}}\operatorname{{\color {black}{\sim _{\beta }}}}\mathbf {{\color {RedO... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04400859773159027,
0.023469217121601105,
-0.024506868794560432,
-0.0023824002128094435,
-0.004341347608715296,
-0.0032598255202174187,
-0.008873439393937588,
0.06500576436519623,
0.04486313462257385,
0.03256392106413841,
-0.028565913438796997,
0.005005138926208019,
0.0009861496509984136,
... | |
c6d0ce18360e4418b8b3c941f68801024ea2aaae | subsection | 215 | 510 | Proving | And the \mathbf {{\color {RedOrange}{hide }}} on which the process is stuck is not in attacker code.
Having this in proofs would not cause problems because now all proofs have an initial case analysis whether the state is stuck or not, but because it steps it's not stuck.
This relation only changes the second case of ... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.010911807417869568,
-0.021869398653507233,
-0.031651873141527176,
0.018069341778755188,
-0.00931700412184,
0.007306332234293222,
-0.000019672728740260936,
0.061472389847040176,
0.014559250324964523,
0.023334480822086334,
-0.005356705281883478,
-0.050606366246938705,
0.012544763274490833,
... | |
ea6399a0babf149cf6ec464819da240b92eee3a4 | subsection | 216 | 510 | Proving | \mathsf {{\color {RoyalBlue}{\tau }}}\ne \mathsf {{\color {RoyalBlue}{UN}}}
By HP
\mathsf {{\color {RoyalBlue}{\Gamma }}}\vdash \mathsf {{\color {RoyalBlue}{e}}} : \mathsf {{\color {RoyalBlue}{\tau }}}
\mathsf {{\color {RoyalBlue}{H \triangleright e\operatorname{\mathsf {{\color {RoyalBlue}{\ \hookrightarrow \!\!\!\!\... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05324114114046097,
0.04829841107130051,
-0.052142754197120667,
-0.027261294424533844,
-0.02970214933156967,
0.020548945292830467,
0.003752813907340169,
0.013478093780577183,
0.0219829473644495,
0.01833692006766796,
-0.007086106110364199,
0.005244023632258177,
0.005537688732147217,
0.010... | |
04b6e63201936417602af4e0aecd46ceae696140 | subsection | 217 | 510 | Proving | Now there are two cases:
A concurrent attacker reduction performs \mathbf {{\color {RedOrange}{\mathbf {{\color {RedOrange}{\mathbf {{\color {RedOrange}{hide}}}~n}}}}}}, so the state changes.
&
\mathbf {{\color {RedOrange}{C,H, n\mapsto 0:k;k\triangleright \begin{aligned}
&
\mathbf {{\color {RedOrange}{let}}}~\mathbf... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.055265285074710846,
0.03335447609424591,
-0.01759273186326027,
0.0012263796525076032,
0.002197184134274721,
0.010581578128039837,
-0.024657288566231728,
0.065244160592556,
0.03726058080792427,
0.03994602710008621,
-0.025603298097848892,
-0.04241786152124405,
-0.029036398977041245,
0.007... | |
1b59aa9edbd3c8e38c84d0aa0e968cd0fa525427 | subsection | 218 | 510 | Proving | Proof of thm:comp-ai-rsc (thm:comp-ai-rsc)
Given:
HP1: \mathsf {{\color {RoyalBlue}{M}}}\vdash \mathsf {{\color {RoyalBlue}{C}}} : \mathsf {{\color {RoyalBlue}{rs}}}
HPM: \mathsf {{\color {RoyalBlue}{M}}}\operatorname{{\color {black}{\approx _{\varphi }}}}\mathit {{\color {CarnationPink}{M}}}
We need to prove:
TP1: \ma... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.06568297743797302,
0.002619154518470168,
-0.0005722843343392015,
-0.033299315720796585,
-0.010598705150187016,
-0.037663936614990234,
-0.052100762724876404,
0.009843289852142334,
0.0073290541768074036,
0.049475885927677155,
-0.02588251233100891,
-0.03717558830976486,
-0.012468167580664158... | |
7d90d8e78d7b5e9303f5e31cf3cd24768f4106c8 | subsection | 219 | 510 | Proving | \mathit {{\color {CarnationPink}{M}}}\vdash \mathit {{\color {CarnationPink}{A}}}:\mathit {{\color {CarnationPink}{attacker}}}, \vdash \mathit {{\color {CarnationPink}{A\left[{\color {black}{\left.\mathsf {{\color {RoyalBlue}{C}}} \right.^{\mathsf {{\color {RoyalBlue}{L^{\tau }}}}}_{\mathbf {{\color {RedOrange}{L^{\pi ... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04022294655442238,
-0.0012035602703690529,
0.003414219943806529,
0.004856203217059374,
-0.019211186096072197,
-0.026886506006121635,
-0.0094072250649333,
0.011543496511876583,
0.02626088261604309,
0.049561504274606705,
-0.043152689933776855,
0.006096004042774439,
-0.010963651351630688,
... | |
dcd346f8dfe6f3f4e8c5edfbeb7f525142012958 | subsection | 220 | 510 | Proving | Base case:
this holds by tr:mo-t-s-b.
Inductive case:
By tr:mo-t-s, \mathit {{\color {CarnationPink}{M;\overline{H}\rightsquigarrow M^{\prime \prime }}}} holds by IH, we need to prove \mathit {{\color {CarnationPink}{M^{\prime \prime };H\rightsquigarrow M^{\prime }}}}.
By tr:mo-t-2 e need to prove that THMR: \exists \m... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.03183336183428764,
-0.005940141621977091,
0.012818803079426289,
-0.0027754998300224543,
-0.02054060623049736,
-0.04636133834719658,
-0.02559182420372963,
0.015123135410249233,
-0.014054901897907257,
0.03519066795706749,
-0.04135590046644211,
-0.030246270820498466,
-0.015870898962020874,
... | |
9b6db987eb56dbe9eafa07c7caaf5e563e57a3da | subsection | 221 | 510 | Proving | By this and tr:ok-mon (adjusted for \mathit {{\color {CarnationPink}{L^{I}}}}) we have that
HPHR \forall {{\color {black}{\mathtt {mon\text{-}care}(}}\mathsf {{\color {RoyalBlue}{H}}},\mathsf {{\color {RoyalBlue}{\Delta }}}{{\color {black}{)}}}} \operatorname{{\color {black}{\approx _{\varphi }}}}{{\color {black}{\math... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05848787724971771,
0.009092012420296669,
-0.002517083892598748,
-0.0028946464881300926,
-0.02779470756649971,
-0.05555890500545502,
-0.01760433241724968,
0.021219780668616295,
0.028420165181159973,
0.04018181189894676,
-0.010716674849390984,
-0.006159227807074785,
-0.022379163652658463,
... | |
42e652358443e383875cd9fd64d4a89e168b5d04 | subsection | 222 | 510 | Proving | (\mathit {{\color {CarnationPink}{\sigma }}}, {{\color {black}{\mathtt {mon\text{-}care}(}}\mathit {{\color {CarnationPink}{H}}},\mathit {{\color {CarnationPink}{H_0}}}{{\color {black}{)}}}}, \mathit {{\color {CarnationPink}{\sigma ^{\prime }}}}) \in \mathit {{\color {CarnationPink}{\rightsquigarrow }}}, so this case h... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.06852513551712036,
0.00022965818061493337,
-0.015926145017147064,
-0.010136899538338184,
-0.013492983765900135,
-0.033255744725465775,
-0.02669612504541874,
0.0736507922410965,
-0.0008480786927975714,
0.031333621591329575,
-0.0031291672494262457,
0.042835839092731476,
-0.00583882397040724... | |
982915da279f1ba4b2b10696bc34e87bf88665be | subsection | 223 | 510 | Proving | \\
\text{ if }
&\ \mathsf {{\color {RoyalBlue}{C, H\triangleright \Pi \rho }}} \mathsf {{\color {RoyalBlue}{~\mathrel {\xrightarrow{}}~}}} \mathsf {{\color {RoyalBlue}{C, H^{\prime }\triangleright \Pi ^{\prime }\rho ^{\prime }}}}
\\
&\ \mathit {{\color {CarnationPink}{C,H\triangleright {\color {black}{\left.\mathsf {{\... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.07539796829223633,
0.020513132214546204,
-0.03144126012921333,
-0.03650849312543869,
-0.04004944860935211,
-0.044048286974430084,
-0.04059890657663345,
0.03583693131804466,
0.02277201972901821,
0.05021443963050842,
-0.01279018260538578,
-0.007509271614253521,
-0.003741280874237418,
0.01... | |
436fa6c791d2851c8215f83f145c21049eb8b83d | subsection | 224 | 510 | Proving | \spadesuit
Lemma 27 (\mathbf {{\color {RedOrange}{L^{P}}}} Attacker actions preserve \operatorname{{\color {black}{\mathrel {\hbox{$\sim $}\vspace{-1.48752pt}\hbox{$\sim $}\vspace{-1.48752pt}\hbox{$\sim $}}}}})
&
\forall ... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05818032845854759,
0.0160323865711689,
-0.022942636162042618,
0.01722223125398159,
0.0007293515955097973,
-0.031103746965527534,
0.016245948150753975,
0.0211121067404747,
0.02794608287513256,
0.015635771676898003,
-0.006292445119470358,
0.024544348940253258,
-0.03984452411532402,
-0.043... | |
c248d3811be2d669289c41e81625fcda1dcad79f | subsection | 225 | 510 | Proving | \\
\text{ if }
&\ \mathsf {{\color {RoyalBlue}{C, H\triangleright \Pi \rho }}} \mathsf {{\color {RoyalBlue}{~\mathrel {\xrightarrow{}}~}}} \mathsf {{\color {RoyalBlue}{C, H^{\prime }\triangleright \Pi ^{\prime }\rho ^{\prime }}}}
\\
&\ \mathit {{\color {CarnationPink}{C,H\triangleright \Pi \rho }}} \mathit {{\color {Ca... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.07653460651636124,
0.02566411718726158,
-0.02079678513109684,
-0.013404237106442451,
-0.031279098242521286,
-0.06860040128231049,
0.0025137714110314846,
0.043485574424266815,
0.02130030281841755,
0.05114513635635376,
-0.0213918499648571,
-0.019332008436322212,
0.011489346623420715,
0.00... | |
0e1c04bdc628b3c069be9266168ad13ef7185e75 | subsection | 226 | 510 | Proving | Suppose this does not hold by contradiction, there can be one clause that does not hold based on tr:state-rel-proof:
two related high-locations \mathsf {{\color {RoyalBlue}{\ell }}} and \mathit {{\color {CarnationPink}{n}}} point to unrelated values.
Two cases arise: creation and update of a location to an unrelated v... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04615085572004318,
0.009675807319581509,
0.0005703995702788234,
0.011850574985146523,
-0.016955556347966194,
-0.030889328569173813,
-0.006684548687189817,
0.0378180630505085,
-0.022999120876193047,
0.009370577521622181,
-0.017581278458237648,
-0.015292049385607243,
-0.005662026349455118,
... | |
119c6a893e9909d728e81f1ce5e2bb9c079397f9 | subsection | 227 | 510 | Proving | \mathit {Components}~\mathsf {{\color {RoyalBlue}{C}}} \mathrel {::=}&\ \mathsf {{\color {RoyalBlue}{\overline{F} ; \overline{I} ; \overline{E}}}}
\\
\mathit {Exports}~\mathsf {{\color {RoyalBlue}{E}}} \mathrel {::=}&\ \mathsf {{\color {RoyalBlue}{f}}}
\\
\mathit {Expressions}~\mathsf {{\color {RoyalBlue}{e}}} \mathrel... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05077202618122101,
0.02053459919989109,
-0.046347782015800476,
-0.009611290879547596,
0.0037300961557775736,
0.015408577397465706,
-0.031091762706637383,
0.01420335192233324,
0.002797572175040841,
0.020061662420630455,
-0.035393960773944855,
0.008726442232728004,
0.01705622673034668,
0.... | |
4ebd18822864644a4fae0d603413856953203a26 | subsection | 228 | 510 | Proving | The Target Language \mathbf {{\color {RedOrange}{L^{P}}}}
Syntax Changes
\mathit {Components}~\mathbf {{\color {RedOrange}{C}}} \mathrel {::=}&\ \mathbf {{\color {RedOrange}{\overline{F} ; \overline{I}; \overline{E} ; k_{root}, k_{com}}}}
\\
\mathit {Exports}~\mathbf {{\color {RedOrange}{E}}} \mathrel {::=}&\ \mathbf ... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.031007489189505577,
0.009727989323437214,
-0.02349977008998394,
0.026521170511841774,
-0.01017051748931408,
-0.0023347174283117056,
0.020829342305660248,
0.01266546081751585,
0.0007419976172968745,
0.00787394866347313,
-0.038911957293748856,
0.0021554173436015844,
-0.019562795758247375,
... | |
8e7da953aa5b975357d7f78bcbf7a1d6b36ffe91 | subsection | 229 | 510 | Proving | The former is used to create a part of the heap for component-managed datastructures.
The latter does not even hide a location, we need it as a placeholder.
Traces in this case have the same syntactic structure as before, but they do not carry the whole heap.
So we use a different symbol (\mathbf {{\color {RedOrange}{\... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.052233241498470306,
-0.009892890229821205,
-0.02677258662879467,
0.03551372140645981,
0.010434444062411785,
-0.03493403270840645,
0.0030452865175902843,
0.05946413055062294,
0.01309644803404808,
0.025933559983968735,
-0.015727940946817398,
-0.027809929102659225,
0.011487041600048542,
0.... | |
2262e762518ad21155db181373cf726aff853a04 | subsection | 230 | 510 | Proving | Semantics Changes
In \mathbf {{\color {RedOrange}{L^{P}}}} we need functionality to tell if a pair is a location or not and to traverse values in order to extract such locations.
{\color {RedOrange}{L^{P}}}-isloc\endcsname \begin{array}{c}\textsf {\scriptsize ({\mathbf {{\color {RedOrange}{L^{P}}}}-isloc})} \\ {
(\math... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.03351590037345886,
0.0045557813718914986,
-0.03214229643344879,
0.02658683806657791,
0.0002692356356419623,
0.0020432337187230587,
0.028662504628300667,
-0.0075586289167404175,
0.013652082532644272,
-0.02551848068833351,
-0.03446216136217117,
-0.016712162643671036,
0.008966571651399136,
... | |
f508b7ea8e15ccc7e3d080ee6c98cd869648e797 | subsection | 231 | 510 | Proving | However, the compiler will ensure that the context only receives \mathbf {{\color {RedOrange}{k_{com}}}} as a capability and never a newly-allocated capability. | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05203850194811821,
-0.004108905326575041,
-0.04050152003765106,
0.0033477849792689085,
-0.041691843420267105,
0.009759127162396908,
-0.019884508103132248,
0.05918044596910477,
-0.009003729559481144,
0.00920974649488926,
0.008904535323381424,
-0.014390706084668636,
0.06156109273433685,
0... | |
9ddf1c90a0025fe3b357190c93b4b3b43def2a01 | subsection | 232 | 510 | Proving | So the context will not be able to test equality of capabilities generated by the compiled component as it will effectively see only one.
{\color {RedOrange}{L^{P}}}-eqcap-true\endcsname \begin{array}{c}\textsf {\scriptsize ({\mathbf {{\color {RedOrange}{L^{P}}}}-eqcap-true})} \\ {
\mathbf {{\color {RedOrange}{H\triang... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.029821323230862617,
0.05072982609272003,
-0.009034914895892143,
-0.005929162725806236,
0.008195522241294384,
0.009607227519154549,
-0.017611978575587273,
0.07050896435976028,
0.012201713398098946,
0.02341141737997532,
-0.0063221510499715805,
0.005688791163265705,
0.019092362374067307,
0... | |
2c5667f170ecb2798827c735328644f335c8bd99 | subsection | 233 | 510 | Proving | Property 1 (Heap locations)
AS mentioned, the trace semantics carries the whole shared heap: locations created by the compiled component and then passed to the context and locations created by the context and passed to the compiled component.
We can really partition the heap as follows then:
[Table: NO_CAPTION]
Now, f... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1007/978-3-540-31987-0_29",
"end": 2050,
"openalex_id": "https://openalex.org/W2134056477",
"raw": "Alan Jeffrey and Julian Rathke. Java Jr.: Fully abstract trace semantics for a core Java language. In ESOP'05, volume 3444 of LNCS, pages... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.014340907335281372,
0.007887499406933784,
-0.012967841699719429,
0.058065418154001236,
0.02021457813680172,
-0.048331908881664276,
0.0031199101358652115,
0.05065086483955383,
0.0025039378087967634,
0.0047790310345590115,
-0.015294425189495087,
0.014417189173400402,
0.0037149053532630205,
... | |
08153fa5d3b31a7ce178b9a2c979e19cfc48a40e | subsection | 234 | 510 | Proving | \Box
Lemma 29 (Completeness)
\text{if }
&
\mathbf {{\color {RedOrange}{\mathbf {{\color {RedOrange}{\mathsf {TR}^{}_{}\left(C_1\right)}}}=\mathbf {{\color {RedOrange}{\mathsf {TR}^{}_{}\left(C_2\right)}}}}}}
\\
\text{then }
&
\mathbf {{\color {RedOrange}{C_1 \operatorname{\mathbf {{\color {RedOrange}{\operatorname{\m... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.043574851006269455,
0.0161117110401392,
-0.03994361311197281,
0.014906383119523525,
-0.011427718214690685,
-0.04128625616431236,
-0.05083732679486275,
0.0160964522510767,
0.010291049256920815,
-0.008536459878087044,
-0.018293503671884537,
-0.0020158709958195686,
0.016249025240540504,
0.... | |
d68a87a59ef7ffe3d5e4f1c0767fce3a10346b54 | subsection | 235 | 510 | Proving | \Box
Lemma 30 (Full abstraction of the trace semantics for compiled components)
\mathbf {{\color {RedOrange}{\mathbf {{\color {RedOrange}{\mathsf {TR}^{}_{}\left({\color {black}{\left.\mathsf {{\color {RoyalBlue}{\fbox{$\mathsf {{\color {RoyalBlue}{C_1}}}$}}}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathbf ... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.06709106266498566,
0.006078029051423073,
-0.005391246173530817,
0.0074363332241773605,
0.008134562522172928,
-0.02165655605494976,
0.0002439510280964896,
0.043252065777778625,
0.01167531032115221,
0.033087678253650665,
-0.009676008485257626,
0.025594111531972885,
0.03620109334588051,
0.... | |
75fa22f3434758ebb6aa227d794feffca7836c26 | subsection | 236 | 510 | Proving | The Compiler {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\fbox{$\mathsf {{\color {RoyalBlue}{\cdot }}}$}}}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathbf {{\color {RedOrange}{L^{P}}}}}}}
{\color {black}{\left.\mathsf {{\color {RoyalBlue}{\fbox{
$\mathsf {{\color {RoyalBlue}{\overline{F} ; \overline{... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.08587812632322311,
0.02375839278101921,
-0.03607247397303581,
0.008514569140970707,
0.0027580794412642717,
-0.02763420157134533,
-0.02775627374649048,
0.04043657332658768,
0.036774393171072006,
0.03237977623939514,
0.004547207150608301,
0.0024986749049276114,
-0.0035458295606076717,
-0.... | |
a48a722e8a4f706c221c4414c7aac8cddd117580 | subsection | 237 | 510 | Proving | The compiled code will maintain the following invariant:
no locations (even though protected by capabilities) are ever made accessible “in clear” to the context;
“made accessible” means either passed as a parameter or through a shared location;
instead, before passing control to the context, all component-created lo... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.004542535170912743,
0.03344159945845604,
-0.026972969993948936,
0.0257524736225605,
0.008886739611625671,
-0.04561605304479599,
0.04018484428524971,
0.02058061957359314,
0.010953955352306366,
0.02886473946273327,
-0.0013625697465613484,
0.013570394366979599,
0.012494831345975399,
0.0403... | |
0a1de7741a018a2135e843c0a0c57ecb0c40adbe | subsection | 238 | 510 | Proving | This is where we need to use \mathbf {{\color {RedOrange}{k_{com}}}} as leaking different capabilities would lead to differentiation between components.
Fortunately, the context starts execution and, in order to call the compiled component, it must allocate at least one location, so this problem cannot arise.
Syntacti... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.042849309742450714,
0.03111458197236061,
0.005070043727755547,
0.00740859704092145,
0.008034246042370796,
-0.0314350351691246,
-0.010529210790991783,
0.006103890482336283,
-0.028581466525793076,
0.03830191120505333,
0.008575965650379658,
0.021211018785834312,
0.01397027913480997,
0.0372... | |
fea0a2cd72f14bc68cb2b56dd9460c44aade6f98 | subsection | 239 | 510 | Proving | Support Functions
Read
\mathbf {{\color {RedOrange}{s_{read}}}} =&\ \begin{aligned}
&
\mathbf {{\color {RedOrange}{let}}}~\mathbf {{\color {RedOrange}{x_{n}}}}\mathbf {{\color {RedOrange}{=}}}\mathbf {{\color {RedOrange}{x.1.1}}}~\mathbf {{\color {RedOrange}{in}}}~
\\
&\ \mathbf {{\color {RedOrange}{let}}}~\mathbf {{\... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.018260056152939796,
0.02384333126246929,
-0.018900759518146515,
-0.03478105738759041,
-0.010861453600227833,
0.016185395419597626,
0.0018458368722349405,
-0.021234750747680664,
0.038869358599185944,
0.012966622598469257,
-0.006403223145753145,
-0.026329871267080307,
0.0027554072439670563,... | |
5121379d18d79a1797b2bda1f04373b5d0f86d31 | subsection | 240 | 510 | Proving | Write
\mathbf {{\color {RedOrange}{s_{write}}}} =&\ \begin{aligned}
&
\mathbf {{\color {RedOrange}{let}}}~\mathbf {{\color {RedOrange}{x_{n}}}}\mathbf {{\color {RedOrange}{=}}}\mathbf {{\color {RedOrange}{x.1.1}}}~\mathbf {{\color {RedOrange}{in}}}~
\\
&\ \mathbf {{\color {RedOrange}{let}}}~\mathbf {{\color {RedOrange... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.010862505994737148,
0.032526493072509766,
-0.02718677744269371,
0.007307781372219324,
0.012151665985584259,
-0.0180177241563797,
0.019451819360256195,
0.010084433481097221,
0.02581370808184147,
-0.008688478730618954,
0.0061406721360981464,
0.0021644916851073503,
0.01028276514261961,
0.0... | |
0ae9c8a6e3e2a8f2b8d65ce6fded6dba54823ee6 | subsection | 241 | 510 | Proving | We want to keep the value passed as parameter \mathbf {{\color {RedOrange}{x}}} unchanged but replace its subvalues that are pairs and, more specifically, component-created locations, with a pair with its location masked to be the index in the list of component-allocated locations.
This can be implemented by checking t... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.02925225719809532,
0.031007086858153343,
-0.02508644200861454,
0.016068140044808388,
0.004120036028325558,
-0.007507621310651302,
0.04046791046857834,
-0.009018301032483578,
-0.001804423169232905,
0.009643936529755592,
-0.012169365771114826,
-0.0030175449792295694,
0.01043742522597313,
... | |
09685b0a1dd35d3f58d09a4a6f9a4c308d1fc7b9 | subsection | 242 | 510 | Proving | Registration
\mathbf {{\color {RedOrange}{s_{register}(x_{loc},x_{cap})}}} =&\ \begin{aligned}
&
\mathbf {{\color {RedOrange}{\overline{K}::x_{cap};}}}
\end{aligned}
This statement registers capability \mathbf {{\color {RedOrange}{x_{cap}}}} in the list of component-created capabilities.
Preamble
The preamble is res... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.007269496563822031,
0.016766373068094254,
-0.018246207386255264,
0.01250231359153986,
-0.010007953271269798,
-0.007971273735165596,
0.032037656754255295,
0.0007594640483148396,
0.010412238538265228,
0.010389354079961777,
-0.004149639047682285,
-0.007170332595705986,
0.0024238012265414,
... | |
fc6c049d7f8680080cf05524082d46ca8c3c31da | subsection | 243 | 510 | Proving | \mathbf {{\color {RedOrange}{s_{post}(x)}}} =&\ \begin{aligned}
&
\forall \mathbf {{\color {RedOrange}{\left\langle n,k\right\rangle }}}\in {{\color {black}{\mathtt {reach}(}}\mathbf {{\color {RedOrange}{\overline{S}}}}{{\color {black}{)}}}}.~ \mathbf {{\color {RedOrange}{isloc(\left\langle n,k\right\rangle )}}}
\\
& \... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.028295917436480522,
0.021794266998767853,
-0.024495655670762062,
0.02676970884203911,
0.01208757609128952,
0.0015519638545811176,
0.025594526901841164,
0.010202707722783089,
-0.002682312624529004,
0.03659849613904953,
0.016299912706017494,
0.017765074968338013,
0.028356965631246567,
0.0... | |
7c776cabfd642291f6e9364ff0151a0ae12279e0 | subsection | 244 | 510 | Proving | The only additions are two functions \mathsf {{\color {RoyalBlue}{terminate}}} and \mathsf {{\color {RoyalBlue}{diverge}}}, which do what their name suggests:
&\mathsf {{\color {RoyalBlue}{terminate(x)\mapsto fail}}}
\\
&\mathsf {{\color {RoyalBlue}{diverge(x)\mapsto {call}~diverge~0}}}
The Common Prefix
\mathbf {{\... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04590819403529167,
0.025609690696001053,
-0.03351542353630066,
-0.013003251515328884,
-0.0017408254789188504,
-0.008829085156321526,
0.011988325975835323,
0.033576469868421555,
0.018085507676005363,
0.038460321724414825,
-0.05540117621421814,
-0.03388171270489693,
0.0020718208979815245,
... | |
f326cabfef33e5ae15e8d92e28c29825db9c05b1 | subsection | 245 | 510 | Proving | For all of its content \mathbf {{\color {RedOrange}{n\mapsto v:\eta }}}, we do a structural analysis of \mathbf {{\color {RedOrange}{v}}}.
This happens at the meta-level, in the backtranslation algorithm.
\mathbf {{\color {RedOrange}{v}}} may contain subvalues of the form \mathbf {{\color {RedOrange}{\left\langle i,k_{... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04440885782241821,
0.018190843984484673,
-0.02458510920405388,
0.03149824216961861,
0.009583767503499985,
0.020571526139974594,
-0.006192059721797705,
0.027286266908049583,
0.022555425763130188,
0.010369696654379368,
-0.04602649807929993,
-0.004845296498388052,
0.016817374154925346,
0.0... | |
ee8ca58499d5646025f46d89268b250ae56fc777 | subsection | 246 | 510 | Proving | \mathsf {{\color {RoyalBlue}{\ell }}} is looked up as \mathsf {{\color {RoyalBlue}{B({\color {black}{\left\langle \!\left\langle {\mathbf {{\color {RedOrange}{\fbox{$\mathbf {{\color {RedOrange}{i}}}$}}}}} \right\rangle \!\right\rangle ^{\mathbf {{\color {RedOrange}{L^{P}}}}}_{\mathsf {{\color {RoyalBlue}{L^{U}}}}}}})}... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.059308551251888275,
-0.01857968606054783,
-0.023842403665184975,
0.005842380691319704,
-0.006986449938267469,
0.018564430996775627,
-0.030294954776763916,
0.02404071018099785,
0.015162731520831585,
0.02919664792716503,
-0.033223774284124374,
-0.012409338727593422,
0.0128440847620368,
0.... | |
acda9aaa75a53d63d40d93a5e276adf62b6eaeac | subsection | 247 | 510 | Proving | We consider \mathbf {{\color {RedOrange}{\alpha _1}}} to be the last action in the trace of {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\mathsf {{\color {RoyalBlue}{C_1}}}}}} \right.^{\mathsf {{\color {RoyalBlue}{{S}}}}}_{}} while \mathbf {{\color {RedOrange}{\alpha _2}}} is the last one of {\color {black}{\left... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.039546992629766464,
0.021131398156285286,
-0.031018145382404327,
-0.01403674017637968,
-0.008391529321670532,
0.025876427069306374,
0.014242714270949364,
0.02682238072156906,
0.029477154836058617,
0.0031697095837444067,
-0.0002519842819310725,
-0.005031103268265724,
0.018766511231660843,
... | |
d9b6b70d6988e60a102e5590d10fcc51ea17c175 | subsection | 248 | 510 | Proving | \mathbf {{\color {RedOrange}{\alpha _1}}}= \mathbf {{\color {RedOrange}{\mathtt {call}~ f~ v~ H{!}}}} and \mathbf {{\color {RedOrange}{\alpha _2}}}= \mathbf {{\color {RedOrange}{\mathtt {call}~ f~ v~ H^{\prime }{!}}}}
Here few cases can arise, consider \mathbf {{\color {RedOrange}{H}}}=\mathbf {{\color {RedOrange}{H_1,... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05221957713365555,
0.001760617597028613,
-0.013352463021874428,
-0.007465934380888939,
-0.01059041079133749,
0.013955231755971909,
0.007538419216871262,
0.018525589257478714,
0.018479809165000916,
0.01577879674732685,
-0.021058741956949234,
0.008339567109942436,
0.018891828134655952,
0.... | |
afd761215af8c2a23d76395cf954ca076a95cda1 | subsection | 249 | 510 | Proving | Code
\mathsf {{\color {RoyalBlue}{
\begin{aligned}&
\mathsf {{\color {RoyalBlue}{if}}}~\mathsf {{\color {RoyalBlue}{!\ell _i==i}}}~\mathsf {{\color {RoyalBlue}{then}}}~
\\
&\ \mathsf {{\color {RoyalBlue}{let}}}~\mathsf {{\color {RoyalBlue}{x}}}\mathsf {{\color {RoyalBlue}{=}}}\mathsf {{\color {RoyalBlue}{L_{glob}({\co... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04372208192944527,
0.03340940922498703,
-0.006895457860082388,
-0.04665112867951393,
-0.01080084964632988,
0.030587151646614075,
0.008695599623024464,
0.003586934646591544,
0.026315629482269287,
0.01279168389737606,
-0.0068077389150857925,
-0.022517025470733643,
-0.009893151000142097,
0... | |
38ad1b511aa0c4be63d8a1ca82ff5223c18d5960 | subsection | 250 | 510 | Proving | The code in this case must access the location related to \mathbf {{\color {RedOrange}{n}}}, it will get stuck in one case and succeed in the other:
\mathsf {{\color {RoyalBlue}{{if}~!\ell _i==i~{then}~ {let}~x=update({\color {black}{\left\langle \!\left\langle {\mathbf {{\color {RedOrange}{\fbox{$\mathbf {{\color {Red... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.0402568057179451,
0.012620310299098492,
-0.009133320301771164,
-0.02316521294414997,
-0.0009537719306536019,
0.006230038125067949,
-0.013230724260210991,
0.021379752084612846,
0.007458496373146772,
0.009377485141158104,
-0.01724419556558132,
-0.013200203888118267,
-0.011918334290385246,
... | |
cbab8692c0f6867cbee22ccb7582627b19fdf452 | subsection | 251 | 510 | Proving | \mathbf {{\color {RedOrange}{\alpha _1}}}= \mathbf {{\color {RedOrange}{\mathtt {call}~ f~ v~ H{!}}}} and \mathbf {{\color {RedOrange}{\alpha _2}}}= \mathbf {{\color {RedOrange}{\mathbf {{\color {RedOrange}{\uparrow }}}}}}
Code \mathsf {{\color {RoyalBlue}{{if}~!\ell _i==i~{then}~{call}~terminate~0~{else}~\mathsf {{\co... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04322296753525734,
0.000479094625916332,
-0.02345822937786579,
-0.010485232807695866,
0.017170140519738197,
0.01796378381550312,
0.011790163815021515,
0.0321730300784111,
0.019444230943918228,
0.02689225599169731,
-0.02875426411628723,
-0.007459472399204969,
-0.009943420067429543,
0.044... | |
de8dcff4cd03b18ad8e5c7de1a7f4fdb30cfe885 | subsection | 252 | 510 | The Source Language | \mathsf {{\color {RoyalBlue}{L^{U}}}} is an untyped imperative while language .
Its syntax is presented in fig:lu-syn.
Components \mathsf {{\color {RoyalBlue}{C}}} are triples of function definitions, interfaces and a special location written \mathsf {{\color {RoyalBlue}{\ell _{root}}}}, which defines the locations tha... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1007/978-3-662-03811-6",
"end": 79,
"openalex_id": "https://openalex.org/W1553894716",
"raw": "Flemming Nielson, Hanne R. Nielson, and Chris Hankin. Principles of Program Analysis. Springer-Verlag New York, USA, 1999.",
"source_ref... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.03737792745232582,
0.02889542654156685,
-0.03338078036904335,
-0.008329938165843487,
-0.004214552231132984,
0.00022383849136531353,
0.016675133258104324,
0.0055532921105623245,
0.0038350517861545086,
0.017910894006490707,
0.0002815263578668237,
0.0031771238427609205,
0.02373879961669445,
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.