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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
5941c2d9bb8cf5d98de84d8020945a0fd57eebbc | subsection | 353 | 510 | Single Action Translation | Note that each element in a set returned by the single-action back-translation has the same \mathbf {{\color {RedOrange}{ak^{\prime }}}}, \mathbf {{\color {RedOrange}{H}}} and \mathsf {{\color {RoyalBlue}{f^{\prime }}}}, the only elements that change are in the code \mathsf {{\color {RoyalBlue}{s}}} due to the backtran... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04787884280085564,
-0.004726090468466282,
-0.050381116569042206,
0.01899590902030468,
-0.0037152639124542475,
-0.04974029213190079,
0.024275092408061028,
0.019880859181284904,
-0.025922929868102074,
0.012198577634990215,
-0.03555057570338249,
-0.0028608294669538736,
0.021009933203458786,
... | |
42500e50028268e51fcde67c7d444c93bb8c8e62 | subsection | 354 | 510 | The Back-translation Algorithm | {\color {black}{\left\langle \!\left\langle {\cdot } \right\rangle \!\right\rangle ^{\mathbf {{\color {RedOrange}{L^{P}}}}}_{\mathsf {{\color {RoyalBlue}{L^{U}}}}}}}: \mathbf {{\color {RedOrange}{\overline{I}}}} \times \mathbf {{\color {RedOrange}{\overline{\alpha }}}} \rightarrow \left\lbrace \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.03820809721946716,
0.03790292143821716,
-0.035308919847011566,
0.013038665987551212,
0.0062675620429217815,
-0.01131441816687584,
-0.0021534014958888292,
0.01034548319876194,
0.015960730612277985,
0.03265388309955597,
-0.023574883118271828,
0.015777625143527985,
0.035614095628261566,
0.... | |
c108aebf6cdf2d804f8b29dcf34c1a5b312e1c4b | subsection | 355 | 510 | Correctness of the Back-translation | Theorem 9 ({\color {black}{\left\langle \!\left\langle {\cdot } \right\rangle \!\right\rangle ^{\mathbf {{\color {RedOrange}{L^{P}}}}}_{\mathsf {{\color {RoyalBlue}{L^{U}}}}}}} is correct)&
\forall \\
\text{if }
&
\mathbf {{\color {RedOrange}{\mathbf {{\color {RedOrange}{\Omega _0}}}\left(\mathbf {{\color {RedOrange}{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.02357642352581024,
0.04117099568247795,
-0.036318372935056686,
0.01759457215666771,
-0.006084853317588568,
-0.0010119169019162655,
-0.027421897277235985,
0.0287189818918705,
0.0025808170903474092,
0.019608870148658752,
-0.014489199966192245,
-0.005024295765906572,
0.00242440402507782,
0... | |
7c28f40b544f14124364c2b152ee0d3894ac0998 | subsection | 356 | 510 | Correctness of the Back-translation | Also it needs to ensure the step is incremented correctly. | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.017699958756566048,
0.020538056269288063,
-0.0542595311999321,
0.020614348351955414,
-0.02568019926548004,
0.01805090717971325,
0.0268856268376112,
0.0013637361116707325,
-0.05230643227696419,
0.013931088149547577,
-0.02569545805454254,
-0.008781315758824348,
-0.04931574687361717,
0.016... | |
7620ac84eee982f2a0f8d35d03df72f1fe97767a | subsection | 357 | 510 | Remark on the Backtranslation | Some readers may wonder whether the hassle of setting up a source-level representation of the whole target heap is necessary.
Indeed for those locations that are allocated by the context, this is not.
If we changed the source semantics to have an oracle that predicts what a \mathsf {{\color {RoyalBlue}{{let}~x={new}~e~... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.016354762017726898,
0.00041406575473956764,
-0.031016074120998383,
0.027217254042625427,
0.003081774339079857,
-0.04598251357674599,
0.03652360290288925,
0.002942560473456979,
0.011610050685703754,
0.01035140547901392,
0.0009225298999808729,
-0.005023139528930187,
0.0019013173878192902,
... | |
07e7c923882aca0ef6a361863323834cf6873fca | subsection | 358 | 510 | The Source Language: | This is an imperative, concurrent while language with monitors.\mathit {Whole\ Programs}~\mathsf {{\color {RoyalBlue}{P}}} \mathrel {::=}&\ \mathsf {{\color {RoyalBlue}{\Delta ; H ; \overline{F} ; \overline{I}}}}
\\
\mathit {Components}~\mathsf {{\color {RoyalBlue}{C}}} \mathrel {::=}&\ \mathsf {{\color {RoyalBlue}{\De... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04581214487552643,
0.04135606810450554,
-0.031925052404403687,
-0.0078897001221776,
-0.024615254253149033,
0.002363476436585188,
-0.025424063205718994,
0.03546549752354622,
0.019884485751390457,
0.009751486591994762,
-0.025881879031658173,
-0.014131261967122555,
-0.008896895684301853,
0... | |
5f1bae11ca6250a9e42b72fa77f135525500b5c4 | subsection | 359 | 510 | Static Semantics of | The static semantics follows these typing judgements.&\vdash \mathsf {{\color {RoyalBlue}{C}}}:\mathsf {{\color {RoyalBlue}{UN}}} &&\text{Component $\mathsf {{\color {RoyalBlue}{C}}}$ is well-typed.}
\\
&\mathsf {{\color {RoyalBlue}{C}}}\vdash \mathsf {{\color {RoyalBlue}{F}}} : \mathsf {{\color {RoyalBlue}{\tau }}}
&&... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.035737045109272,
0.027603892609477043,
-0.044373754411935806,
-0.009483592584729195,
-0.009010558016598225,
-0.03427216410636902,
0.008751151151955128,
0.05636748671531677,
0.00490964762866497,
0.027664929628372192,
-0.029022999107837677,
0.01792955957353115,
0.0180821530520916,
0.00859... | |
993c6ef14884cf0aa0a840abd0858816905db4d9 | subsection | 360 | 510 | Auxiliary Functions | We rely on these standard auxiliary functions: {{\color {black}{\mathtt {names}(}}\cdot {{\color {black}{)}}}} extracts the defined names (e.g., function and interface names).
{{\color {black}{\mathtt {fv}(}}\cdot {{\color {black}{)}}}} returns free variables while {{\color {black}{\mathtt {fn}(}}\cdot {{\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.025764968246221542,
-0.002669223351404071,
-0.041700176894664764,
-0.008952105417847633,
-0.010722683742642403,
-0.039319053292274475,
0.05867330729961395,
-0.01353881973773241,
0.021292733028531075,
0.02326173707842827,
-0.01718682236969471,
0.011913245543837547,
-0.006765593774616718,
... | |
fc6ca07e871081da506800873dbe5c3d32392aba | subsection | 361 | 510 | Typing Rules | \vdash \mathsf {{\color {RoyalBlue}{C}}}{\color {RoyalBlue}{L^{\tau }}}-component\endcsname \begin{array}{c}\textsf {\scriptsize ({T\mathsf {{\color {RoyalBlue}{L^{\tau }}}}-component})} \\ {
\mathsf {{\color {RoyalBlue}{C}}}\equiv \mathsf {{\color {RoyalBlue}{\Delta ; \overline{F} ; \overline{I}}}}
&
\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.04953966662287712,
0.04996699467301369,
-0.05076060816645622,
-0.027242237702012062,
-0.008058208040893078,
0.024006744846701622,
0.017108431085944176,
0.049722809344530106,
0.024174625054001808,
0.03403371945023537,
0.007070009596645832,
0.023945698514580727,
-0.0028444102499634027,
0.... | |
876b5dcee55d5189a1521b52ab2972b526e156ae | subsection | 362 | 510 | Typing Rules | \mathsf {{\color {RoyalBlue}{(s,s^{\prime })}}}\in \mathsf {{\color {RoyalBlue}{\rightsquigarrow }}}
}{
\vdash \mathsf {{\color {RoyalBlue}{M}}}
}\end{array} | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.056356918066740036,
-0.0030798735097050667,
-0.021770795807242393,
-0.04384671896696091,
-0.034753940999507904,
0.02141989953815937,
-0.008345217444002628,
0.03133651986718178,
0.05504487082362175,
0.017590560019016266,
0.001111805671826005,
0.02276245877146721,
0.05052899569272995,
-0.... | |
712264a0aac16845cee8ef7619ca73ce2403b8c1 | subsection | 363 | 510 | Notes | Monitor typing just ensures that the monitor is coherent and that it can't get stuck for no good reason. | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.03459801524877548,
-0.0115097900852561,
-0.03407935053110123,
0.01793971285223961,
-0.0015645762905478477,
-0.02141781896352768,
0.001516904914751649,
0.017619360238313675,
0.017634615302085876,
0.014278546907007694,
0.0164447370916605,
-0.029670698568224907,
0.007120204623788595,
0.003... | |
3142c463a0f1d5ff53daaae292e1dbe857c09d9a | subsection | 364 | 510 | Dynamic Semantics of | Function {{\color {black}{\mathtt {mon\text{-}care}(}}\cdot {{\color {black}{)}}}} returns the part of a heap the monitor cares for (tr:h-mon-s).
tr:s-aux-intern,tr:s-aux-in,tr:s-aux-out dictate the kind of a jump between two functions: if internal to the component/attacker, in(from the attacker to the component) or ou... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.049863290041685104,
0.019606588408350945,
-0.045499492436647415,
0.022536132484674454,
0.010230518877506256,
-0.012084371410310268,
-0.03314047306776047,
0.041044142097234726,
-0.005241138394922018,
0.019637104123830795,
-0.019728653132915497,
0.023512648418545723,
0.02189529500901699,
... | |
ea56a2ef1c18b78759d4294cdf5fe099071d5d92 | subsection | 365 | 510 | Monitor Agreement for | Definition 14 (\mathsf {{\color {RoyalBlue}{L^{\tau }}}}: \mathsf {{\color {RoyalBlue}{M\mathop {\raisebox {1mm}{\frown }}C}}})\mathsf {{\color {RoyalBlue}{(\left\lbrace \sigma \right\rbrace ,\rightsquigarrow ,\sigma _0,\Delta ,\sigma _c) \mathop {\raisebox {1mm}{\frown }}(\Delta ; \overline{F} ; \overline{I})}}}A moni... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.02726181037724018,
-0.025476902723312378,
-0.020427288487553596,
-0.01624724641442299,
-0.006174716167151928,
-0.016750682145357132,
0.007013775873929262,
0.024973466992378235,
0.031182508915662766,
0.01813894510269165,
-0.004218181595206261,
-0.0010135459015145898,
0.0018916981061920524,... | |
42e41da432880e9c4077b670e3c3f3b486e0c1ae | subsection | 366 | 510 | Properties of | Definition 16 (\mathsf {{\color {RoyalBlue}{L^{\tau }}}} Semantics Attacker)\mathsf {{\color {RoyalBlue}{C}}}\vdash _{\mathsf {{\color {RoyalBlue}{attacker}}}}\mathsf {{\color {RoyalBlue}{A}}} \mathrel {\overset{\mbox{[}0pt]{\mbox{\normalfont \tiny \sffamily def}}}{=}}&\ {\left\lbrace \begin{array}{ll}
\forall \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.033975522965192795,
0.03522709384560585,
-0.05409220978617668,
-0.01396568026393652,
-0.007501783315092325,
-0.008394671604037285,
-0.008554932661354542,
0.02558085322380066,
0.02843504026532173,
0.013881733641028404,
-0.015484352596104145,
0.010745178908109665,
-0.03078554943203926,
-0... | |
bc82c10e64b542119c3c953369ecdcec20ac882d | subsection | 367 | 510 | Properties of | \mathbf {{\color {RedOrange}{k}}}\notin {{\color {black}{\mathtt {fv}(}}\mathbf {{\color {RedOrange}{A}}}{{\color {black}{)}}}} \\
\mathbf {{\color {RedOrange}{C}}}\vdash _{\mathbf {{\color {RedOrange}{att}}}}\mathbf {{\color {RedOrange}{\pi }}} \mathrel {\overset{\mbox{[}0pt]{\mbox{\normalfont \tiny \sffamily def}}}{=... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.0680442601442337,
0.03594445809721947,
-0.0018431833013892174,
-0.0348459854722023,
-0.022610222920775414,
-0.043054014444351196,
-0.009314130991697311,
0.027782198041677475,
0.008101234212517738,
0.025646278634667397,
0.000926359323784709,
0.018048511818051338,
-0.023510361090302467,
0... | |
0df7c57bf7c65dae17a262e307b278f923812fe4 | subsection | 368 | 510 | Assumed Relation between | We can scale the \operatorname{{\color {black}{\approx _{\beta }}}} relation to monitors, heaps, actions and processes as follows.\colorbox {yellow}{\mathsf {{\color {RoyalBlue}{M}}}\operatorname{{\color {black}{\approx }}}\mathbf {{\color {RedOrange}{M}}} }\begin{array}{c}\textsf {\scriptsize ({Ok Mon})} \\ {
\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.054426874965429306,
0.006727045867592096,
-0.027747632935643196,
-0.004853546619415283,
-0.012149129062891006,
0.009783406741917133,
-0.022222526371479034,
0.04490293562412262,
0.040812525898218155,
0.011271522380411625,
-0.01413328293710947,
0.017964227125048637,
0.0007640901603735983,
... | |
d02e7c021691e3de31121ff7ccf125e42c9e645f | subsection | 369 | 510 | Assumed Relation between | (\mathbf {{\color {RedOrange}{\sigma }}}, {{\color {black}{\mathtt {mon\text{-}care}(}}\mathbf {{\color {RedOrange}{H}}},\mathbf {{\color {RedOrange}{H_0}}}{{\color {black}{)}}}}, \mathbf {{\color {RedOrange}{\sigma ^{\prime }}}}) \in \mathbf {{\color {RedOrange}{\rightsquigarrow }}}
}{
\beta , \mathsf {{\color {RoyalB... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.07618480920791626,
0.01076690386980772,
-0.037878744304180145,
-0.020160282030701637,
-0.00653187045827508,
0.036322083324193954,
-0.05732174217700958,
0.03986272215843201,
0.04004586115479469,
0.01828313246369362,
0.013758134096860886,
0.00698971189558506,
0.049141641706228256,
0.05854... | |
9490e628086a7fdf8196fdd8215f43a01eadf639 | subsection | 370 | 510 | Compiler Definition | Definition 19 (Compiler \mathsf {{\color {RoyalBlue}{L^{\tau }}}} to \mathbf {{\color {RedOrange}{L^{\pi }}}})
{\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{L^{\tau }}}}}_{\mathbf {{\color {RedOrange}{L^{\pi }}}}}}} : \mathsf {{\color {RoyalBlue}{C}}}\rightarrow \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.04628971964120865,
0.03554879501461983,
-0.047876447439193726,
-0.0370744951069355,
-0.017255660146474838,
-0.002488797064870596,
0.002061601262539625,
0.03991229459643364,
0.03194814547896385,
0.034267209470272064,
-0.006491851061582565,
0.027477845549583435,
-0.023221144452691078,
0.0... | |
4a1bc04ae5a142783fb9d5144c8d85a23a47fc31 | subsection | 371 | 510 | Compiler Definition | As expressions are executed atomically, we are sure that albeit inefficient, dereferencing will correctly succeed.We can add reference to superficial types and check this dynamically in the source, as we have the heap there.
But how do we check this in the target? We only assume that reference must be passed as a pair:... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
0.03219839185476303,
0.03213735297322273,
-0.013573681935667992,
0.023042451590299606,
-0.008362426422536373,
-0.03827183321118355,
0.08179306983947754,
0.0012989990646019578,
-0.008850743062794209,
0.026430148631334305,
-0.011444926261901855,
-0.005245591048151255,
-0.006435863208025694,
... | |
d14096a62303af92b921b56ae1258ea973d79667 | subsection | 372 | 510 | NonAtomic Implementation of New-Hide | We can also implement tr:compap-new using non-atomic instructions are defined in tr:compap-new-nonat below.{\color {black}{\left.\mathsf {{\color {RoyalBlue}{
{{\color {RoyalBlue}{L^{\tau }}}}-new\endcsname \begin{array}{c}\textsf {\scriptsize ({T\mathsf {{\color {RoyalBlue}{L^{\tau }}}}-new})} \\ {
\mathsf {{\color {R... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.01597699522972107,
0.007053835783153772,
-0.030870545655488968,
0.017289336770772934,
-0.012360425665974617,
-0.004440597258508205,
0.005737679079174995,
0.050204694271087646,
0.011704254895448685,
0.05798718333244324,
0.00024749463773332536,
-0.03479231148958206,
0.014229749329388142,
... | |
b0588948afb46e8513b18adc3c9ecd0adac02516 | subsection | 373 | 510 | Cross-language Relation | We define a more lenient relation on states \operatorname{{\color {black}{\mathrel {\hbox{$\sim $}\vspace{-1.48752pt}\hbox{$\sim $}\vspace{-1.48752pt}\hbox{$\sim $}}}_{\beta }}} analogous to {\color {black}{\approx _{\beta }}} ({tr:state-rel-whole}) but that ensures that all target locations that are related to secure ... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.053068436682224274,
0.04574444144964218,
-0.034270185977220535,
0.0023631323128938675,
-0.008773533627390862,
-0.014289416372776031,
-0.02189568802714348,
0.038115281611680984,
0.02192620560526848,
0.011184348724782467,
-0.02218559756875038,
0.0048979208804667,
-0.020064691081643105,
0.... | |
67a22f5a9aad85d1605a786b493aa0d74276b425 | subsection | 374 | 510 | Cross-language Relation | An alternative is to define {{\color {black}{\mathtt {secure}(}}\cdot {{\color {black}{)}}}} as all locations protected by a key \mathbf {{\color {RedOrange}{k}}} but the point of {{\color {black}{\mathtt {secure}(}}\cdot {{\color {black}{)}}}} is to setup the invariant to ensure the proof hold, so this alternative wou... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.03587906062602997,
0.03307219594717026,
-0.04240807518362999,
0.01338600181043148,
-0.007901935838162899,
-0.04329284653067589,
0.009351132437586784,
0.0144690852612257,
0.003167257644236088,
0.015864891931414604,
0.0016503682127222419,
-0.015590306371450424,
-0.015536914579570293,
-0.0... | |
2f98aa8b7faca964ba3c63678c33e21e2b079bbc | subsection | 375 | 510 | Cross-language Relation | This can be because the source location is not secure or because the relation does not exist, as in order for it to exist the triple must be added to \beta and we only add the triple for secure locations.The intuition behind tr:state-rel-proof is that two states are related if the set of locations they monitor is relat... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05217850208282471,
0.011259571649134159,
-0.01293019950389862,
-0.01514244545251131,
-0.015401812270283699,
0.024380480870604515,
-0.0034900095779448748,
0.05822022259235382,
-0.000893003772944212,
0.008971041068434715,
-0.03213097155094147,
0.00037164788227528334,
-0.004500777460634708,
... | |
b3f01b86c0288da3249e045c144d42c39cf6831c | subsection | 376 | 510 | Cross-language Relation | \\
&\ \mathsf {{\color {RoyalBlue}{H}}},\mathbf {{\color {RedOrange}{H}}}\vdash {{\color {black}{\mathtt {high\text{-}loc}(}}\mathbf {{\color {RedOrange}{n}}}{{\color {black}{)}}}} = \mathsf {{\color {RoyalBlue}{\ell }}},\mathbf {{\color {RedOrange}{\eta }}}Trivial, as tr:lowloc and tr:highloc are duals.As before, we d... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.06519030034542084,
0.01733524724841118,
-0.02493467926979065,
-0.02397330477833748,
-0.01928851567208767,
0.007656655739992857,
-0.00463519524782896,
0.03479257598519325,
-0.009010971523821354,
0.02928375080227852,
-0.01695375144481659,
-0.005394374951720238,
-0.0021344786509871483,
0.0... | |
329d60d8f9b13f39ea8181cfae6423b4171085e0 | subsection | 377 | 510 | Cross-language Relation | Compared to tr:state-rel-proof, we have less conditions because we don't have to track fine-grained capabilities but just if an address is part of the enclave or not.\spadesuitLemma 7 (A \mathit {{\color {CarnationPink}{L^{I}}}} target location is either high or low)&
\forall \\
\text{if }
&\ \mathsf {{\color {RoyalBlu... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.06635290384292603,
0.009698084555566311,
-0.008446718566119671,
-0.023043440654873848,
-0.00824070069938898,
-0.013467442244291306,
-0.012651002034544945,
0.03741888701915741,
0.0006552501581609249,
0.032718636095523834,
-0.01735125295817852,
-0.015542877838015556,
-0.0075158243998885155,... | |
a7766a5615076aa6f9dc54764c3ab7ee3236ece6 | subsection | 378 | 510 | The Second Target Language: | For clarity, we use a \mathit {{\color {CarnationPink}{pink, italics}}} font for \mathit {{\color {CarnationPink}{L^{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.04606287553906441,
0.006955982651561499,
0.0046322341077029705,
-0.019246283918619156,
-0.02034519985318184,
-0.05171008035540581,
0.002833141479641199,
0.030388066545128822,
0.0018296180060133338,
0.015285609290003777,
-0.0033024700824171305,
0.00014356491737999022,
-0.020223097875714302... | |
6e7aab13ccbe0c3168e11db15151ac1a2227d46b | subsection | 379 | 510 | Second Compiler from | For this compiler we need a different partial bijection, which we indicate with \varphi and its type is \mathsf {{\color {RoyalBlue}{\ell }}}\times \mathit {{\color {CarnationPink}{n}}}. | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.055116306990385056,
0.0067026130855083466,
0.010139752179384232,
-0.004593025427311659,
-0.02655104547739029,
-0.0212560947984457,
0.0213934276252985,
0.027939634397625923,
0.01459544524550438,
0.04174922779202461,
0.0006399335688911378,
-0.012176858261227608,
0.004928728565573692,
-0.0... | |
f5d6d1bb7aaa93855ef175724a544734d9e50c8a | subsection | 380 | 510 | Second Compiler from | It has the same properties of \beta listed in sec:cr-rel.The cross-language relation \operatorname{{\color {black}{\approx }}} is unchanged but for the relation of locations, as they are no longer compiled as pairs:\mathsf {{\color {RoyalBlue}{\ell }}}\operatorname{{\color {black}{\approx _{\varphi }}}}\mathit {{\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.06469475477933884,
0.02751052752137184,
-0.026976490393280983,
-0.011771698482334614,
-0.009521114639937878,
0.025099731981754303,
-0.018813354894518852,
0.04192952439188957,
0.017134953290224075,
0.0055120233446359634,
-0.003591398010030389,
0.01371711865067482,
-0.018996454775333405,
... | |
7cda75b79053ac00961b7c1f20045a75ecf6600c | subsection | 381 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \Rightarrow
HP
\text{if }
&\ \forall \mathbf {{\color {RedOrange}{A}}},\mathbf {{\color {RedOrange}{\overline{\alpha }}}}.~
{\color {black}{\left.\mathsf {{\color {RoyalBlue}{C}}} \right.^{\mathsf {{\color {RoyalBlue}{{S}}}}}_{}}\vdash \mathbf {{\color {RedOrange}{A}}}:\mathbf {{\color {RedOrange}{attacker}}}
\\
&\... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04566827043890953,
0.030755871906876564,
-0.03831128403544426,
-0.016255585476756096,
-0.027413174510002136,
-0.02025461196899414,
-0.019277749583125114,
0.015248196199536324,
0.038189176470041275,
0.0019327355548739433,
0.0022437286097556353,
-0.004643907770514488,
-0.0001218691904796287... | |
87a8565b2d50a660d436189ce4e7fa9dff3a42da | subsection | 382 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \end{align*}}}
By the relatedness of the traces, by tr:rel-cl,tr:rel-cb,tr:rel-rt,tr:rel-rb we have \mathsf {{\color {RoyalBlue}{H}}}\operatorname{{\color {black}{\approx _{\beta }}}}\mathbf {{\color {RedOrange}{H}}} for all heaps in the traces.
But if the heaps are related and the source steps (by unfolding \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.0434015691280365,
-0.008683365769684315,
-0.03522180765867233,
0.014177234843373299,
0.006718544289469719,
-0.0052725886926054955,
-0.03751092031598091,
0.009774508886039257,
0.03549649938941002,
0.00011731700215023011,
-0.0021422274876385927,
0.001767385401763022,
0.009568489156663418,
... | |
57d364772ece6350eac330b9f9e514429eb6e1a7 | subsection | 383 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | Proof of thm:comp-up-cc (thm:comp-up-cc)
The proof proceeds for \beta _0=(\mathsf {{\color {RoyalBlue}{\ell }}},\mathbf {{\color {RedOrange}{0}}},\mathbf {{\color {RedOrange}{k_{root}}}}) and then, given that the languages are deterministic, by thm:gen-cc-up (thm:gen-cc-up) as initial states are related by definition.
... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.045841511338949203,
0.04169074818491936,
-0.008736439980566502,
-0.0038150392938405275,
-0.020692773163318634,
-0.014748942106962204,
-0.041995953768491745,
0.055211249738931656,
0.013963043689727783,
0.030444012954831123,
-0.025713365525007248,
-0.012330207042396069,
-0.00467723794281482... | |
dd02fabeb087ed00c33de94aee7af9283eab6ccc | subsection | 384 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | As \mathsf {{\color {RoyalBlue}{{true}}}} \operatorname{{\color {black}{\approx _{\beta }}}}\mathbf {{\color {RedOrange}{0}}}, this case holds.
\mathsf {{\color {RoyalBlue}{\mathsf {{\color {RoyalBlue}{{false}}}}}}}
Analogous to the first case by tr:compup-false.
\mathsf {{\color {RoyalBlue}{n}}}\in \mathbb {N}
Analogo... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.048881933093070984,
0.01983349397778511,
-0.042199574410915375,
0.023891732096672058,
-0.013723252341151237,
0.01998605951666832,
-0.013296069577336311,
0.020901450887322426,
0.046593453735113144,
0.025173280388116837,
-0.01688898354768753,
-0.023205187171697617,
-0.0011270764516666532,
... | |
0a5c42e927c92a8558d8186dba4a3de4d75c3e22 | subsection | 385 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | By tr:eus-op we have that \mathsf {{\color {RoyalBlue}{H\triangleright n \oplus n^{\prime }}}}\operatorname{\mathsf {{\color {RoyalBlue}{\ \hookrightarrow \!\!\!\!\rightarrow \ }}}}\mathsf {{\color {RoyalBlue}{n^{\prime \prime }}}}.
By IH we have that \mathbf {{\color {RedOrange}{H\triangleright {\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.02360801212489605,
0.027713090181350708,
-0.027987778186798096,
-0.03976889327168465,
-0.02099846489727497,
0.01783953793346882,
-0.032474368810653687,
0.026675375178456306,
0.014421183615922928,
0.041722238063812256,
-0.03287114202976227,
-0.01568780653178692,
0.011544576846063137,
0.0... | |
c2031ee646207b8111c30ced66fa832a193ca76f | subsection | 386 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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... | |
73daf6df44ed941b2b1f990978fdba9557735f09 | subsection | 387 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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,
... | |
7683dae75e6ab9a3d371e8ea4eaab88ca2b4d0a7 | subsection | 388 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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,
... | |
638af47ca6d070a314f74ec71b8ff1fe02138f34 | subsection | 389 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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... | |
76184f956f4184d32c9f93940e2b710aea3f3662 | subsection | 390 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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... | |
83fe53623ea82746e01b45e5e4b53b613f4ff18a | subsection | 391 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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,
... | |
ba01bca2079284f9cb55af3d2687e8ac236e4743 | subsection | 392 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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... | |
6f0e736dca6b607c38d4df002ce15a9c0dd6e0f3 | subsection | 393 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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... | |
091b7a7470dd84c44a9c00bffbdbbfced1503e0b | subsection | 394 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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... | |
b76809ebc868f31d7de3407954a34ae8383ddf4d | subsection | 395 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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... | |
9af2f37472554f4ac29ebade5ab431a14e9cb9dc | subsection | 396 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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.... | |
3832c5e51b57ccb4e4b269276ea4c4b80a337982 | subsection | 397 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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... | |
5e481b739709152a4407fc3d6def76be4980e272 | subsection | 398 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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... | |
0ac75170fd3b9986e4488ec5fd820e47faa4539e | subsection | 399 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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,
... | |
8c52803102e6ddf2f1f4e706222bf595d382c14b | subsection | 400 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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,
... | |
7c6a92201593a3bf7e97a14bc90b7f08b274cf96 | subsection | 401 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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,
... | |
325d929e71f2d1487c9cc3bb3607efdd9b5a6617 | subsection | 402 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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,
... | |
4bae267eebb6da9ffbd26bf42f88afd0c41723b4 | subsection | 403 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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... | |
e6a1d28ac30c6d9aab8f42b9200e1d14ab57c5c5 | subsection | 404 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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... | |
85784f1564ad9a20513c34e4a994e025b224f27c | subsection | 405 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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.... | |
276f945e2da612d444de5103bb3b8eef11dbf491 | subsection | 406 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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,
... | |
2404dbab0d43cfb1cbd653cbb5a1b6d36d3e865f | subsection | 407 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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,
... | |
e9e681fa7bc6dae10acebc5046e4fdb90f788d4a | subsection | 408 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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,
... | |
3dcbe4a145c6adcd277389b6a2d53397bdd0f36f | subsection | 409 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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,... | |
1c56336e03f4dab37cd5b800316061e56eaba0d8 | subsection | 410 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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.... | |
c986454c632dddffea165d4d0740a06bd68d0273 | subsection | 411 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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,
... | |
7e1101cbf07f0e562dc52769f597c512ceac9572 | subsection | 412 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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... | |
e3d8ef2362959bec02fe6689d950f22ed2304e40 | subsection | 413 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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... | |
9e6b90a72d63d94255e1c187fb17f70f86b21667 | subsection | 414 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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,
... | |
2befe58a5410bd33b9a6cbf566a98fcb213ac268 | subsection | 415 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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,
... | |
b23a0c971f01c701e6d5ef946568a171bc997ff4 | subsection | 416 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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... | |
170b417cb160f2e5eef75c760228000514a845b1 | subsection | 417 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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,
... | |
0c2b8cce0b830e9acc84c7d8b8af1ab842b7d877 | subsection | 418 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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,
... | |
f54e5e04971c270ce9addff0d0071ec945221fef | subsection | 419 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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,
... | |
461534756066fdf3b7d65fc6825685f0a41cab79 | subsection | 420 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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... | |
2c2808a2ba60848543bf063288f6dad41471706f | subsection | 421 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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,
... | |
0559c1d68a654e1303234bc86d1adcf467529ccc | subsection | 422 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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,
... | |
122fcaa6659599b847199041d8b6f31186f30302 | subsection | 423 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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... | |
0d38bc1a36cbd5c1d2bd413a40ba565aa0db3506 | subsection | 424 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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... | |
26012ba687cf641c7060d4f45f5e26ea361ac0ec | subsection | 425 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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,
... | |
625aee9ffe73f973c37ab5f5c622c0c123607306 | subsection | 426 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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... | |
9df4d229f61cdcbfcfb161ce5fe78d8fe2648962 | subsection | 427 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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... | |
15df006424e9360ea8e9be2f250e0aad138c34d1 | subsection | 428 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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,
... | |
a8d3462e5312ab42049e85113286b7c0520b8d3c | subsection | 429 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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... | |
57534c3001554fc361a5e858a53bc4490e2cc942 | subsection | 430 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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,
-... | |
e914e72ecc8ee6f5fbcafbc71c38610b11f12935 | subsection | 431 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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,
-... | |
ced7d4ef67994655dae8d273898be201174c71b1 | subsection | 432 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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,
... | |
9819d449ffbbdc98696fdd06cb5bedbdb640c3fa | subsection | 433 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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,... | |
1cab67cd0d4645842a68b7af93aae2dc18bfd3e8 | subsection | 434 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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,
... | |
9776e377852ebfcf729ae0a58d039f0dda090a0a | subsection | 435 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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... | |
8d1443e996b0147ee90beabcbf6734c47e1943fb | subsection | 436 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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,
... | |
d7692af09c84ea1e8a90a769140027dee932064e | subsection | 437 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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,
-... | |
d710ce7e908e6aefaa58a01a209ac0ea9aeb143e | subsection | 438 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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,... | |
4fe892ac1d365df98eae0d0625cab249511ac59c | subsection | 439 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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,
... | |
dd688dd845b53ab23c4e8bf9215843a22aaae119 | subsection | 440 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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... | |
14bdb82ec3e56e7fc66b2aaaedc6de7cc6f98b81 | subsection | 441 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \\
\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... | |
48b2e52ec137c2f8672bb62f607291050b476e72 | subsection | 442 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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... | |
bfe01f47e2e9f40a2cf2d4026c126bcb036efd4f | subsection | 443 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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,
-... | |
fbd10ab58cfe6e436cb0a5b5ae06aa8e873919d2 | subsection | 444 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \\
\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... | |
5362b9c29d3d73e2c894ee6e7215b50a55f6e0c8 | subsection | 445 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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,... | |
89d146283116bd04bbd540b903deeead5159a066 | subsection | 446 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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,
... | |
feea550706292082c5fd515a5e18fc8ecb9a4f26 | subsection | 447 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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,
... | |
9bb61ee902a993946075656bce7c9cbed52f06f0 | subsection | 448 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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,
... | |
077ccb0079b45e7df604f5b6894cb0b2af95d809 | subsection | 449 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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... | |
17e25e42ab75642d5c2494f2745ed7acc8b32cd0 | subsection | 450 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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... | |
f3ff291c5e0ceb229e8d74fabb45ea369432077f | subsection | 451 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | 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... | |
6e3500b266019572240582cc31357728502d0777 | subsection | 452 | 510 | Proof of thm:rsc-prf-eq (thm:rsc-prf-eq) | \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,
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.