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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
de857b73f746cb6d133eb99c005fef4c717537d6 | subsection | 53 | 510 | Proving | The only requirement is to find a type system (e.g., based on refinements or Hoare logics) that can enforce robust safety in the source (for example, as in the work of Swasey et al. ).
Our compilation and proof strategy should work with little modification.
Another easy generalization is allowing the set of locations ... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/3133913",
"end": 185,
"openalex_id": "https://openalex.org/W2761120147",
"raw": "David Swasey, Deepak Garg, and Derek Dreyer. Robust and compositional verification of object capability patterns. In Proceedings of the 2017 ACM SIGPLA... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.025012826547026634,
0.01088874414563179,
-0.020083513110876083,
0.023898771032691002,
-0.004547786433249712,
-0.03577185049653053,
-0.020663432776927948,
0.01669556461274624,
0.027820855379104614,
0.039373453706502914,
-0.012323280796408653,
-0.04175417497754097,
-0.005226902198046446,
... | |
5a45b7b173422c1417f69c98767b00fbd341869f | subsection | 54 | 510 | Proving | We show only a few instructional cases in fig:compap.
When compiling a component we ensure that monitor-sensitive locations from \mathsf {{\color {RoyalBlue}{\Delta }}} are allocated to related locations and initialised to valid values, i.e., values that respect the cross-language relation.
Such a set up of heaps is de... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.48550/arxiv.1804.00489",
"end": 765,
"openalex_id": "https://openalex.org/W2796361499",
"raw": "Marco Patrignani and Deepak Garg. Robustly safe compilation or, efficient, provably secure compilation. CoRR, abs/1804.00489, 2018.",
"... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05452704802155495,
-0.014432732947170734,
-0.026775313541293144,
0.05056033283472061,
-0.01595839112997055,
-0.033869627863168716,
0.0071286410093307495,
-0.005930998828262091,
0.05913453549146652,
0.014058946631848812,
-0.00239147013053298,
0.011205963790416718,
0.03481553494930267,
0.... | |
62ff2b46ef1657a4bbffb3cd6765ce3164776c70 | subsection | 55 | 510 | Proving | Given a partial bijection \beta from
source to target locations, we say that a target monitor \mathbf {{\color {RedOrange}{M}}} =
\mathbf {{\color {RedOrange}{({{\color {RedOrange}{\left\lbrace \sigma \right\rbrace }}},\rightsquigarrow ,{{\color {RedOrange}{\sigma }}}_0,H_0,{{\color {RedOrange}{\sigma }}}_c)}}} is good... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.057048071175813675,
0.013140286318957806,
-0.037452105432748795,
-0.013933892361819744,
0.0037028593942523003,
-0.023655567318201065,
-0.030187556520104408,
0.00409775460138917,
0.06611349433660507,
0.030095987021923065,
-0.007169162854552269,
-0.0040863086469471455,
0.0005527581088244915... | |
a5e05e98771713880458bf670ba8c9c8099f82b4 | subsection | 56 | 510 | Proving | Theorem 5 (Compiler {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{L^{\tau }}}}}_{\mathbf {{\color {RedOrange}{L^{\pi }}}}}}} attains \mathbf {\mathit {RSC}})
\vdash {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{L^... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.026699405163526535,
0.034175239503383636,
0.0041765496134757996,
0.028331883251667023,
0.0036501900758594275,
-0.009916922077536583,
-0.008345471695065498,
0.01839970424771309,
0.02380061335861683,
0.004065937828272581,
-0.01974230259656906,
-0.005278853699564934,
0.022946231067180634,
... | |
7c5e60481980e2a3139d84dcc3aa992140cc051d | subsection | 57 | 510 | Proving | The latter is simple since all trusted locations are protected with capabilities, attackers have no access to trusted locations, and capabilities are unforgeable and unguessable (by the semantics of \mathbf {{\color {RedOrange}{L^{\pi }}}}).
At this point, knowing that monitors are related, and that source traces are a... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.48550/arxiv.1804.00489",
"end": 3174,
"openalex_id": "https://openalex.org/W2796361499",
"raw": "Marco Patrignani and Deepak Garg. Robustly safe compilation or, efficient, provably secure compilation. CoRR, abs/1804.00489, 2018.",
... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.022094575688242912,
0.0047835977748036385,
-0.01447286270558834,
0.04550139978528023,
0.013519194908440113,
-0.027267271652817726,
0.01425924152135849,
0.00004374951095087454,
0.0348203182220459,
0.022415008395910263,
-0.009765558876097202,
-0.03817722946405411,
0.006896925624459982,
0.... | |
afe37e6fb7ca48197666cae55e7124de397e2ec7 | subsection | 58 | 510 | Proving | To avoid giving the false impression that \mathbf {\mathit {RSC}} is only
useful for this kind of a target, we show here how to attain \mathbf {\mathit {RSC}} when the protection mechanism in the target is completely
different. We consider a new target language, \mathit {{\color {CarnationPink}{L^{I}}}}, which does not... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/2487726.2488368",
"end": 552,
"openalex_id": "https://openalex.org/W2036329595",
"raw": "Frank McKeen, Ilya Alexandrovich, Alex Berenzon, Carlos V. Rozas, Hisham Shafi, Vedvyas Shanbhogue, and Uday R. Savagaonkar. Innovative instruc... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.02537071518599987,
0.02206016518175602,
-0.014752544462680817,
-0.010129978880286217,
-0.013623600825667381,
-0.051443204283714294,
-0.0115640414878726,
-0.002616402693092823,
-0.002805195515975356,
0.028360888361930847,
0.0006259724032133818,
-0.01759015955030918,
-0.024211259558796883,
... | |
9a2435c26a35c057285099802e5d7e3e04314954 | subsection | 59 | 510 | Proving | Elided and omitted elements are the same as in \mathbf {{\color {RedOrange}{L^{P}}}} (fig:lp-syn) or \mathbf {{\color {RedOrange}{L^{\pi }}}} (fig:lc).]The semantics (fig:li-sem) are almost those of \mathbf {{\color {RedOrange}{L^{\pi }}}}, but
the expression semantics change to \mathit {{\color {CarnationPink}{C;H;f\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.07041934877634048,
0.006575116887688637,
-0.02823791466653347,
-0.007246358785778284,
-0.01847440004348755,
-0.04726151376962662,
-0.010366106405854225,
0.048451442271471024,
-0.005564440507441759,
0.046651292592287064,
-0.030190618708729744,
-0.024500319734215736,
-0.013462971895933151,
... | |
60ab0e01cb9df378a3f34c7851800bfe6199ed27 | subsection | 60 | 510 | Proving | Compiler {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{L^{\tau }}}}}_{\mathit {{\color {CarnationPink}{L^{I}}}}}}} ensures
that all the (and only the) functions of the (trusted) component we
write are part of the enclave, i.e., constitute \mathit {{\color {CarnationP... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.06073998659849167,
-0.00890497025102377,
-0.019381854683160782,
0.021655788645148277,
-0.012865278869867325,
-0.044898755848407745,
-0.006917185615748167,
0.0242502111941576,
0.018420392647385597,
0.038275349885225296,
-0.0010148766450583935,
-0.0010864139767363667,
-0.0020259381271898746... | |
feb7cc20734d7df31f6f0d2ca1056ef7879af580 | subsection | 61 | 510 | Proving | Theorem 6 (Compiler {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{L^{\tau }}}}}_{\mathit {{\color {CarnationPink}{L^{I}}}}}}} attains \mathbf {\mathit {RSC}})
\vdash {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{L... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/2034574.2034830",
"end": 2311,
"openalex_id": "https://openalex.org/W2168743513",
"raw": "Amal Ahmed and Matthias Blume. An equivalence-preserving CPS translation via multi-language semantics. In Proceedings of the 16th ACM SIGPLAN ... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
0.0006174223963171244,
0.015806013718247414,
-0.007716111373156309,
-0.009321887046098709,
-0.009123548865318298,
-0.03173408284783363,
0.002441083313897252,
-0.006880803499370813,
0.022412195801734924,
0.03795884549617767,
-0.01035171840339899,
-0.024456603452563286,
-0.0201541930437088,
... | |
052a7bc89a76c04de426dae90410bf7d7cbf7964 | subsection | 62 | 510 | Proving | Formalising Fully Abstract Compilation
As stated in sec:intro, \mathbf {\mathit {FAC}} requires the preservation and reflection of observational equivalence, and most existing work instantiates observational equivalence with contextual equivalence (\operatorname{\mathrel {\simeq _{\mathit {ctx}}}}).
Contextual equivale... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/2699503",
"end": 765,
"openalex_id": "https://openalex.org/W2046697462",
"raw": "Marco Patrignani, Pieter Agten, Raoul Strackx, Bart Jacobs, Dave Clarke, and Frank Piessens. Secure Compilation to Protected Module Architectures. ACM ... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.030905546620488167,
-0.017352892085909843,
-0.01192725170403719,
0.03467525914311409,
0.008813804015517235,
-0.05451585724949837,
0.01762760803103447,
0.025823300704360008,
0.0552484355866909,
0.046701714396476746,
-0.024129219353199005,
-0.05170765146613121,
-0.004937256686389446,
0.04... | |
c3f66898a68cab5aceae0edbfce1accbb18052a9 | subsection | 63 | 510 | Proving | \begin{}[Contextual equivalence and fully abstract compilation]
\begin{align*}
\mathit {{\color {black}{C_1}}} \operatorname{\mathrel {\simeq _{\mathit {ctx}}}}\mathit {{\color {black}{C_2}}} \mathrel {\overset{\mbox{[}0pt]{\mbox{\normalfont \tiny \sffamily def}}}{=}}&\ \forall \mathit {{\color {black}{\mathbb {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.0363103412091732,
0.007555755320936441,
-0.029856866225600243,
0.00978701002895832,
-0.008375789038836956,
0.00859700795263052,
0.027034422382712364,
0.031138407066464424,
0.024868007749319077,
0.03231315314769745,
-0.026149548590183258,
-0.025356214493513107,
0.0027003909926861525,
0.0... | |
c14c60bdc67d639a2d9136bc991213076057623f | subsection | 64 | 510 | Proving | In fact, there may be target contexts \mathbf {{\color {RedOrange}{\mathbb {C}}}} that can interact with compiled code in ways that are impossible in the source language.
Compilers that attain \mathbf {\mathit {FAC}} with untyped target languages often insert checks in compiled code that detect such interactions and re... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1109/csf.2012.12",
"end": 1948,
"openalex_id": "https://openalex.org/W1968412195",
"raw": "Pieter Agten, Raoul Strackx, Bart Jacobs, and Frank Piessens. Secure compilation to modern processors. In 2012 IEEE 25th Computer Security Foundat... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.008775896392762661,
0.010500551201403141,
-0.043009523302316666,
0.02742658369243145,
-0.00011238155275350437,
-0.005486843176186085,
0.030448544770479202,
-0.012667816132307053,
-0.01684972085058689,
0.027777619659900665,
-0.008203555829823017,
-0.02498459629714489,
-0.01376671064645052,... | |
a09486405aeb5b2f37dafa7dc5cbbac3679dd692 | subsection | 65 | 510 | Proving | Indeed, none of our earlier compilers ({\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathbf {{\color {RedOrange}{L^{P}}}}}}}, {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{L^{\tau }}}}}_{\mathbf {{\colo... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1109/csf.2012.12",
"end": 2034,
"openalex_id": "https://openalex.org/W1968412195",
"raw": "Pieter Agten, Raoul Strackx, Bart Jacobs, and Frank Piessens. Secure compilation to modern processors. In 2012 IEEE 25th Computer Security Foundat... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.02540387213230133,
0.036526650190353394,
-0.057368505746126175,
0.005942828021943569,
-0.007502915803343058,
-0.02111649326980114,
0.022260811179876328,
-0.014578619040548801,
0.033841315656900406,
0.009535988792777061,
-0.01379285380244255,
-0.009848768822848797,
0.013129148632287979,
... | |
0d48e6474993400419ecf9c77da393f63c39af9a | subsection | 66 | 510 | Proving | Example 8 (Wrappers for heap resources)
Assume that the \text{\texttt {Database}} class is implemented as a \text{\texttt {List}}.
Shown below are two implementations of the \text{\texttt {newList}} method inside \text{\texttt {List}} which we call \mathsf {{\color {RoyalBlue}{C_{one}}}} and \mathsf {{\color {RoyalBlu... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/2699503",
"end": 1304,
"openalex_id": "https://openalex.org/W2046697462",
"raw": "Marco Patrignani, Pieter Agten, Raoul Strackx, Bart Jacobs, Dave Clarke, and Frank Piessens. Secure Compilation to Protected Module Architectures. ACM... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05639634281396866,
-0.005336747970432043,
-0.03921499103307724,
0.02819817140698433,
0.00043082129559479654,
-0.012474028393626213,
0.021713202819228172,
0.03720083460211754,
0.02084345370531082,
0.02818291261792183,
-0.03536978363990784,
-0.022811831906437874,
0.01377102266997099,
-0.0... | |
4ff3ba1e83efff9d6a0bbaac5a6af00334e26505 | subsection | 67 | 510 | Proving | Our target languages \mathbf {{\color {RedOrange}{L^{P}}}}, \mathbf {{\color {RedOrange}{L^{\pi }}}} and \mathit {{\color {CarnationPink}{L^{I}}}} support address comparison (addresses are natural numbers or integers in their heaps) but {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\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.01444474421441555,
0.014719446189701557,
-0.022601867094635963,
-0.000002563408088462893,
-0.027042880654335022,
-0.017458835616707802,
0.006260915193706751,
-0.012178453616797924,
0.010072404518723488,
0.04276193678379059,
-0.020297423005104065,
-0.024219555780291557,
-0.0161005873233079... | |
67fba69d2f8ce917822d7ccfff7444a6a80863f8 | subsection | 68 | 510 | Proving | (See the work of Devriese et al. for more details of this particular problem.)
On the other hand, \mathbf {\mathit {RSC}} can be easily attained even in such settings since it is completely independent of termination in the languages (unless the safety properties of interest are termination-sensitive, which is usuall... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/3158126",
"end": 80,
"openalex_id": "https://openalex.org/W2779893805",
"raw": "Dominique Devriese, Marco Patrignani, and Frank Piessens. Parametricity versus the universal type. In Proceedings of the 45th Annual ACM SIGPLAN-SIGACT ... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.03714713454246521,
0.011804974637925625,
-0.033606406301259995,
0.010767174884676933,
-0.008806037716567516,
-0.008035318925976753,
0.022953694686293602,
0.013949252665042877,
0.023030003532767296,
0.032873839139938354,
-0.021717490628361702,
-0.04450330510735512,
-0.008592373691499233,
... | |
067a20e102641a83968bd13f86d0930784268bc3 | subsection | 69 | 510 | Proving | Accordingly, we add the operations \mathbf {{\color {RedOrange}{isloc(e)}}}, \mathbf {{\color {RedOrange}{ispair(e)}}} and \mathbf {{\color {RedOrange}{eqcap(e,e)}}}, respectively.
Finally, compiled code needs private functions for its runtime checks that must not be visible to the context.
\mathbf {{\color {RedOrange}... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1016/j.tcs.2006.12.032",
"end": 2345,
"openalex_id": "https://openalex.org/W2096216741",
"raw": "Eijiro Sumii and Benjamin C. Pierce. A bisimulation for dynamic sealing. In Principles of Programming Languages, pages 161–172, 2004.",
... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.06676863878965378,
0.0211016982793808,
-0.034421857446432114,
0.03500165790319443,
0.02419905550777912,
-0.011863029561936855,
-0.0044858274050056934,
0.002406936138868332,
0.011351889930665493,
0.026335163041949272,
-0.020537154749035835,
-0.009292070753872395,
0.008895364589989185,
0.... | |
97368ba7365617ebc83042c6fa83748eda5ecf88 | subsection | 70 | 510 | Proving | To ensure that masking is done properly, {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\fbox{$\mathsf {{\color {RoyalBlue}{\cdot }}}$}}}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathbf {{\color {RedOrange}{L^{P}}}}}}} inserts code at entry points and at exit points to compiled code (i.e., at function cal... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/2429069.2429114",
"end": 513,
"openalex_id": "https://openalex.org/W2108416936",
"raw": "Cedric Fournet, Nikhil Swamy, Juan Chen, Pierre-Evariste Dagand, Pierre-Yves Strub, and Benjamin Livshits. Fully abstract compilation to JavaSc... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.0013573890319094062,
0.019627293571829796,
-0.024694370105862617,
0.021245094016194344,
0.013942093588411808,
-0.02699897438287735,
0.010836219415068626,
0.0062995064072310925,
0.01391919981688261,
0.01926099881529808,
-0.011912209913134575,
-0.016864819452166557,
0.03038720041513443,
0... | |
b40031af33667074126f258da444c6ee09f525c4 | subsection | 71 | 510 | Proving | On subsequent ? (incoming) actions, the compiled code will register all new locations available as parameters or reachable from \mathbf {{\color {RedOrange}{\overline{S}}}}.
Then, on any ! (outgoing) action, the compiled code must scan whatever locations (that the compiled code has created) are now reachable from \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.01696793921291828,
0.028747839853167534,
-0.028198517858982086,
0.021209923550486565,
0.008323750458657742,
-0.00887307245284319,
0.007751540746539831,
-0.013229499571025372,
0.009140104055404663,
-0.012321592308580875,
-0.016159215942025185,
0.000827797397505492,
0.021759245544672012,
... | |
a1f5344584f9e0c39620ae65ed70adf2613dcd71 | subsection | 72 | 510 | Proving | Additionally, it also has code memory overhead: the functions \mathbf {{\color {RedOrange}{read}}}, \mathbf {{\color {RedOrange}{write}}}, \mathbf {{\color {RedOrange}{mask}}}, \mathbf {{\color {RedOrange}{unmask}}} and list manipulation code must be included.
Finally, there is data overhead in maintaining \mathbf {{\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.04894538223743439,
0.006579705514013767,
-0.04735862463712692,
0.007025981321930885,
0.0006508186925202608,
-0.045954953879117966,
0.015623463317751884,
0.038539912551641464,
0.018156172707676888,
0.03277265653014183,
-0.04784685745835304,
-0.0393332913517952,
0.004443685058504343,
0.04... | |
c57a0d87394d51bd48e497350cd7d2e3d49c9d2e | subsection | 73 | 510 | Proving | The contrapositive of this statement is
{\color {black}{\left.\mathsf {{\color {RoyalBlue}{\mathsf {{\color {RoyalBlue}{C_1}}}}}} \right.^{\mathsf {{\color {RoyalBlue}{{S}}}}}_{}}\operatorname{\mathbf {{\color {RedOrange}{\operatorname{\mathrel {\operatorname{\mathrel {\lnot \simeq }}_{\mathit {ctx}}}}}}}}{\color {blac... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.03191829100251198,
0.04946419596672058,
-0.040859073400497437,
-0.0028016231954097748,
-0.007750712800770998,
-0.02819550596177578,
-0.033321961760520935,
0.028546424582600594,
0.04339178651571274,
0.031582627445459366,
-0.002263803267851472,
-0.02848539501428604,
-0.009169642813503742,
... | |
fa08a504abbdfab915809b77c9dfd47d60f97280 | subsection | 74 | 510 | Proving | Hence, we resort to another well-known technique~\cite {KULeuven-358154,mfac}.
First, we define a \emph {fully abstract (labeled) trace semantics} for the target language.
A trace semantics is fully abstract when two components are contextually inequivalent iff their trace semantics differ in at least one trace.
So if ... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.053251199424266815,
0.010543432086706161,
0.001033744658343494,
0.02288733422756195,
0.019728882238268852,
-0.0521526075899601,
0.00978814996778965,
0.02804461494088173,
0.029677243903279305,
0.030333347618579865,
-0.024672547355294228,
-0.009635567665100098,
0.01376291736960411,
0.0389... | |
4f48383957b83dbfc478a5dcfd2889406ea01e9e | subsection | 75 | 510 | Proving | Given this trace semantics, the statement of the forward implication of full abstraction reduces to:
\begin{align*}
\mathbf {{\color {RedOrange}{\mathsf {TR}^{}_{}\left({\color {black}{\left.\mathsf {{\color {RoyalBlue}{\fbox{$\mathsf {{\color {RoyalBlue}{C_1}}}$}}}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\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.04272204637527466,
0.018416253849864006,
-0.031309157609939575,
0.035703424364328384,
0.009650605730712414,
-0.05529453605413437,
-0.017592329531908035,
0.027738815173506737,
0.06130613759160042,
0.018797701224684715,
-0.01372445747256279,
-0.024351567029953003,
-0.005294482223689556,
0... | |
19aee3e80036acdc558b2e5085bfd663f2ac64d3 | subsection | 76 | 510 | Proving | In a fully abstract trace semantics, the trace actions must record \emph {only} those heap locations that are shared between the component and the context. Consequently, the definition of the trace semantics must inductively track what has been shared in the past. In particular, the definition must account for location... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.005982706788927317,
0.010439212433993816,
-0.038551829755306244,
0.030142463743686676,
0.011965413577854633,
-0.019565893337130547,
0.011461767368018627,
0.034064799547195435,
-0.020832639187574387,
0.02506021410226822,
-0.03620148077607155,
0.0008518107351846993,
0.008447520434856415,
... | |
9fb21eb52706cd470994f3f8c78e62cfefb23569 | subsection | 77 | 510 | Proving | \\
{\scriptstyle (3)}\left[
\begin{aligned}&\mathbf {{\color {RedOrange}{\mathtt {call}~ write~ \left\langle \left\langle 1,k_{com}\right\rangle ,5\right\rangle ~ 1\mapsto \left\langle 1,k_{com}\right\rangle {?}}}}
\\
&\mathbf {{\color {RedOrange}{\mathtt {ret}~ 1\mapsto \left\langle 1,k_{com}\right\rangle {!}{} }}}
\e... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.48550/arxiv.1710.07309",
"end": 2141,
"openalex_id": "https://openalex.org/W2766363683",
"raw": "D. Garg, C. Hritcu, M. Patrignani, M. Stronati, and D. Swasey. Robust Hyperproperty Preservation for Secure Compilation (Extended Abstract).... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.028512263670563698,
0.018992919474840164,
-0.037833284586668015,
0.01830642856657505,
0.014790069311857224,
0.004523213487118483,
0.013943396508693695,
0.021479543298482895,
-0.012417861260473728,
0.03926729038357735,
-0.019740432500839233,
0.00947357714176178,
0.026773152872920036,
0.0... | |
435236f421f92367dce40c4a42d58946cb8916a7 | subsection | 78 | 510 | Proving | Hyperproperties capture many security-relevant properties including not just conventional safety and liveness, which are predicates on traces, but also properties like non-interference, which is a predicate on pairs of traces.
Modulo technical differences, our definition of \mathbf {\mathit {RSC}} coincides with the cr... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.48550/arxiv.1710.07309",
"end": 375,
"openalex_id": "https://openalex.org/W2766363683",
"raw": "D. Garg, C. Hritcu, M. Patrignani, M. Stronati, and D. Swasey. Robust Hyperproperty Preservation for Secure Compilation (Extended Abstract). ... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.01710629276931286,
-0.012284180149435997,
-0.02922261506319046,
0.048892565071582794,
-0.0028898343443870544,
-0.05459974706172943,
0.0190748143941164,
0.002351924544200301,
0.016267001628875732,
0.041903551667928696,
-0.03399894759058952,
0.009491628035902977,
-0.00452454574406147,
0.0... | |
efa07880206cc5d64df53f88e61a104cc29b488e | subsection | 79 | 510 | Proving | There are three other criteria for secure compilation that we would like to mention: securely compartmentalised compilation (SCC) , trace-preserving compilation (TPC) and non-interference-preserving compilation (NIPC) , , , .
SCC is a re-statement of the “hard” part of full abstraction (the forward implication), but a... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1109/csf.2016.11",
"end": 226,
"openalex_id": "https://openalex.org/W2963888572",
"raw": "Yannis Juglaret, Cătălin Hriţcu, Arthur Azevedo de Amorim, and Benjamin C. Pierce. Beyond good and evil: Formalizing the security guarantees of com... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.00643073720857501,
0.026699382811784744,
-0.04937097430229187,
0.04754015803337097,
0.004401584155857563,
-0.03087974339723587,
0.04647218436002731,
-0.021390020847320557,
0.018826879560947418,
0.08037277311086655,
-0.010336475446820259,
-0.007243161089718342,
-0.0007213600911200047,
-0... | |
fe44522b94a69ad7bda01f3fccae59b150c52b3b | subsection | 80 | 510 | Proving | This work was partially supported by the German Federal Ministry of Education and Research (BMBF) through funding for the CISPA-Stanford Center for Cybersecurity (FKZ: 13N1S0762).
The Untyped Source Language: \mathsf {{\color {RoyalBlue}{L^{U}}}}
This is a sequential while language with monitors. | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05934674292802811,
0.02630174346268177,
-0.01907029002904892,
-0.026393281295895576,
-0.0158969946205616,
0.010297956876456738,
0.021267186850309372,
0.04598228260874748,
0.00859688688069582,
0.004485332407057285,
0.0013873636489734054,
0.0029539880342781544,
0.006853862199932337,
-0.01... | |
0952ae13799eec43a48868a4781d1b4fdcc5d974 | subsection | 81 | 510 | Proving | Syntax
\mathit {Whole\ Programs}~\mathsf {{\color {RoyalBlue}{P}}} \mathrel {::=}&\ \mathsf {{\color {RoyalBlue}{\mathsf {{\color {RoyalBlue}{\ell _{root}}}} ; H ; \overline{F} ; \overline{I}}}}
\\
\mathit {Components}~\mathsf {{\color {RoyalBlue}{C}}} \mathrel {::=}&\ \mathsf {{\color {RoyalBlue}{\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.010172558948397636,
0.027381200343370438,
-0.04322383552789688,
0.012721422128379345,
-0.0017275415593758225,
-0.01701785810291767,
-0.003874806221574545,
0.033242058008909225,
0.01080595888197422,
0.04218597337603569,
-0.042613327503204346,
-0.003384493524208665,
0.01846781000494957,
0... | |
349926f646dd0dbf5df7c70ce9ff233960843af1 | subsection | 82 | 510 | Proving | \text{Helpers}
{\color {RoyalBlue}{L^{U}}}-Jump-Internal\endcsname \begin{array}{c}\textsf {\scriptsize ({\mathsf {{\color {RoyalBlue}{L^{U}}}}-Jump-Internal})} \\ {
((\mathsf {{\color {RoyalBlue}{f^{\prime }}}}\in \mathsf {{\color {RoyalBlue}{\overline{I}}}} \wedge \mathsf {{\color {RoyalBlue}{f}}}\in \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.06871557235717773,
0.0348765105009079,
-0.04790562018752098,
-0.026546426117420197,
0.011503451503813267,
0.019055452197790146,
0.025676801800727844,
0.035303693264722824,
-0.00014517577074002475,
0.016873762011528015,
-0.025890393182635307,
0.02891119383275509,
0.003936194349080324,
-0... | |
3d9ce9ea792054f54e37667da72c00466c0d5b50 | subsection | 83 | 510 | Proving | \mathsf {{\color {RoyalBlue}{M;H\rightsquigarrow M^{\prime }}}}
{\color {RoyalBlue}{L^{U}}}-Monitor Step\endcsname \begin{array}{c}\textsf {\scriptsize ({\mathsf {{\color {RoyalBlue}{L^{U}}}}-Monitor Step})} \\ {
\mathsf {{\color {RoyalBlue}{M}}}= \mathsf {{\color {RoyalBlue}{(\left\lbrace \sigma \right\rbrace ,\righ... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04369456321001053,
-0.01129742432385683,
-0.04613560065627098,
-0.018811240792274475,
0.01714828424155712,
-0.010328637436032295,
-0.029231417924165726,
0.01224332582205534,
0.00881824642419815,
0.024135753512382507,
0.004077294375747442,
0.0035776449367403984,
0.031016426160931587,
0.0... | |
04a8f369d9bb39e07080cc5d52f2a27331f0d029 | subsection | 84 | 510 | Proving | This function is used by both languages so we typeset it in black.
{{\color {black}{\mathtt {relevant}(}}\mathit {{\color {black}{\varnothing }}} {{\color {black}{)}}}} =&\ \mathit {{\color {black}{\varnothing }}} \\
{{\color {black}{\mathtt {relevant}(}}\mathtt {call}~ f~ v~ H{?}\cdot \overline{\alpha }{{\color {blac... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.031273819506168365,
0.03197557106614113,
-0.018688013777136803,
-0.02657511830329895,
-0.015163987874984741,
0.026361539959907532,
0.01543858740478754,
0.04216625913977623,
0.029687244445085526,
0.023935912176966667,
-0.036338649690151215,
0.01283752080053091,
-0.016460707411170006,
0.0... | |
c1daf174494a32afad27d514599e1d57179ce920 | subsection | 85 | 510 | Proving | Formally:
{{\color {black}{\mathtt {reach}(}}\mathbf {{\color {RedOrange}{n_r}}},\mathbf {{\color {RedOrange}{k_r}}},\mathbf {{\color {RedOrange}{H}}}{{\color {black}{)}}}} =&\ \left\lbrace \mathbf {{\color {RedOrange}{n}}} ~\mathrel {}|\mathrel {}~
\begin{aligned}&
\mathbf {{\color {RedOrange}{H \triangleright e \op... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.040441226214170456,
0.03980027139186859,
-0.0022910337429493666,
-0.01145326066762209,
-0.012651236727833748,
-0.023639041930437088,
-0.013131952844560146,
-0.0025123157538473606,
0.014825906604528427,
0.013337974436581135,
-0.00770290894433856,
0.005421413574367762,
0.030903201550245285,... | |
e5fc772cd6e2a35e95a88a224be371acd4d541bf | subsection | 86 | 510 | Proving | Definition 3 (Safety)
M\vdash C : \mathit {{\color {black}{safe}}} \mathrel {\overset{\mbox{[}0pt]{\mbox{\normalfont \tiny \sffamily def}}}{=}}&\ \\
\text{if }
&
\vdash \mathit {{\color {black}{C}}}:\mathit {{\color {black}{whole}}}
\\
\text{then }
&
\begin{aligned}
\text{if }
&
{\Omega _0}\left({\mathit {{\color {bla... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
0.01908494159579277,
0.00416100537404418,
-0.04167870432138443,
0.004340260289609432,
0.015118446201086044,
-0.05751417204737663,
0.016964392736554146,
0.005999322980642319,
0.028284156695008278,
0.0022025485523045063,
-0.029107967391610146,
-0.003369613317772746,
-0.015202352777123451,
-0... | |
eb6cc4e4679b675419d2ddb4c16f189be177282a | subsection | 87 | 510 | Proving | Monitor Agreement and Attacker for \mathbf {{\color {RedOrange}{L^{P}}}} and \mathsf {{\color {RoyalBlue}{L^{U}}}}
Definition 6 (\mathsf {{\color {RoyalBlue}{L^{U}}}}: \mathsf {{\color {RoyalBlue}{M\mathop {\raisebox {1mm}{\frown }}C}}})
\mathsf {{\color {RoyalBlue}{(\left\lbrace \sigma \right\rbrace ,\rightsquigarrow... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.008725613355636597,
0.00204601907171309,
-0.015262195840477943,
-0.0038403375074267387,
0.0030814227648079395,
-0.02994471788406372,
0.011852799914777279,
0.021234359592199326,
0.03124135546386242,
-0.005377235356718302,
0.018763119354844093,
-0.012989264912903309,
0.0028888338711112738,
... | |
a4ecefa009a8351c53e12e7ebe4eea0c65c8d6dc | subsection | 88 | 510 | Proving | Definition 8 (\mathsf {{\color {RoyalBlue}{L^{U}}}} attacker)
\mathsf {{\color {RoyalBlue}{C}}}\vdash \mathsf {{\color {RoyalBlue}{A}}}:\mathsf {{\color {RoyalBlue}{attacker}}} \mathrel {\overset{\mbox{[}0pt]{\mbox{\normalfont \tiny \sffamily def}}}{=}}&\ \mathsf {{\color {RoyalBlue}{C}}}=\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.04129771515727043,
0.017474457621574402,
-0.0430680513381958,
0.0021404302679002285,
-0.005467445123940706,
-0.012140551581978798,
0.019809473305940628,
0.002602091757580638,
0.03455211594700813,
-0.00015619226905982941,
-0.02786756306886673,
0.0034071377012878656,
-0.029302148148417473,
... | |
f9d18050b5eb4e2fb1484fa0207e209879d10f97 | subsection | 89 | 510 | Proving | For compiler correctness we rely on a \beta _0 which relates initial locations of monitors.
Assume a relation \operatorname{{\color {black}{\approx _{\beta }}}}: \mathsf {{\color {RoyalBlue}{v}}}\times \beta \times \mathbf {{\color {RedOrange}{v}}} that is total so it maps any source value to a target value \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.06592060625553131,
-0.009163269773125648,
-0.043947070837020874,
0.051790401339530945,
-0.00572608970105648,
-0.011719218455255032,
-0.005970240104943514,
0.01820446364581585,
0.06268560886383057,
0.013092564418911934,
-0.011330104433000088,
-0.016754820942878723,
0.023911477997899055,
... | |
49d9f8da42881305925f11fd954673e17867d721 | subsection | 90 | 510 | Proving | By inspecting the semantics of \mathsf {{\color {RoyalBlue}{L^{U}}}}, tr:et-seq,tr:et-ift let us derive that
\mathsf {{\color {RoyalBlue}{{true}}}} \operatorname{{\color {black}{\approx _{\beta }}}}\mathbf {{\color {RedOrange}{0}}};
\mathsf {{\color {RoyalBlue}{{false}}}} \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.06232508644461632,
0.017214177176356316,
-0.03278018534183502,
-0.016634266823530197,
0.0033230381086468697,
0.0045439014211297035,
-0.01436803862452507,
0.01808404177427292,
0.03961702436208725,
0.022967496886849403,
-0.004242500755935907,
-0.001483158441260457,
0.019228601828217506,
0... | |
a4e3e38d1427b4591b54874d6f9672e61fdcb53a | subsection | 91 | 510 | Proving | Function names are related when they are the same: \mathsf {{\color {RoyalBlue}{f}}}\operatorname{{\color {black}{\approx _{\beta }}}}\mathbf {{\color {RedOrange}{f}}}.
Variables names are related when they are the same: \mathsf {{\color {RoyalBlue}{x}}}\operatorname{{\color {black}{\approx _{\beta }}}}\mathbf {{\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.06640837341547012,
0.014755720272660255,
-0.04010137915611267,
-0.003545874496921897,
-0.040406566113233566,
0.005256820935755968,
0.02580343745648861,
0.04873812943696976,
0.0303201824426651,
-0.0017538630636408925,
-0.021012023091316223,
-0.02497943490743637,
-0.005672635976225138,
0.... | |
172c40de9badd841e4bf117120714a6381f44e25 | subsection | 92 | 510 | Proving | \mathsf {{\color {RoyalBlue}{\alpha }}}\operatorname{{\color {black}{\approx _{\beta }}}}\mathbf {{\color {RedOrange}{\alpha }}}
\begin{array}{c}\textsf {\scriptsize ({Call relation})} \\ {
\mathsf {{\color {RoyalBlue}{f}}}\operatorname{{\color {black}{\approx }}}\mathbf {{\color {RedOrange}{f}}}
&
\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.05131998285651207,
0.00021870393538847566,
-0.04747556149959564,
-0.011945168487727642,
-0.003178894519805908,
0.004065628629177809,
-0.018993275240063667,
0.023905592039227486,
0.05891729146242142,
0.002705969614908099,
0.0002526715979911387,
0.008482137694954872,
0.013020691461861134,
... | |
624e8942694b029518bc8541cfc8936e2168de6c | subsection | 93 | 510 | Proving | Definition 11 (\mathsf {{\color {RoyalBlue}{M}}}\operatorname{{\color {black}{\approx }}}\mathbf {{\color {RedOrange}{M}}})
\mathsf {{\color {RoyalBlue}{M}}}\operatorname{{\color {black}{\approx }}}\mathbf {{\color {RedOrange}{M}}} is the union of all bisimulations \mathsf {{\color {RoyalBlue}{M}}}\mathcal {R}\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.05936165526509285,
-0.00425755837932229,
-0.026888234540820122,
-0.02144039236009121,
-0.014275791123509407,
0.00322178122587502,
0.019868604838848114,
0.038058601319789886,
0.03784496337175369,
-0.006062061060220003,
-0.048496488481760025,
-0.01762537471950054,
0.005073971580713987,
0.... | |
9fdf94180d0bc63b27996ece257e5114df8b7ab6 | subsection | 94 | 510 | Proving | As additional notation for states, we define when a state is stuck as follows
\begin{array}{c}\textsf {\scriptsize ({Stuck state})} \\ {
\mathit {{\color {black}{\Omega }}}=\mathit {{\color {black}{M ; \overline{F} ; \overline{I} ; H \triangleright s}}}
&
\mathit {{\color {black}{s}}}\lnot \equiv \mathit {{\color {blac... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.029311152175068855,
-0.018950780853629112,
-0.010741828009486198,
0.01869139075279236,
-0.0006799470284022391,
0.006561059504747391,
0.02247544378042221,
0.0654274970293045,
0.013770596124231815,
0.029967257753014565,
-0.010657907463610172,
-0.01744021102786064,
-0.0036791523452848196,
... | |
4f56d3f388156365cb812f9d5d9f01def5c4e030 | subsection | 95 | 510 | Proving | \mathsf {{\color {RoyalBlue}{\Omega }}}\operatorname{{\color {black}{\approx _{\beta }}}}\mathbf {{\color {RedOrange}{\Omega }}}
\begin{array}{c}\textsf {\scriptsize ({Related states -- Whole})} \\ {
\mathsf {{\color {RoyalBlue}{\Omega }}}=\mathsf {{\color {RoyalBlue}{M ; \overline{F},\overline{F^{\prime }} ; \overli... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05326396971940994,
0.03861256316304207,
-0.057689912617206573,
-0.0035560184624046087,
-0.009584462270140648,
-0.012644468806684017,
-0.016818594187498093,
0.0280818622559309,
0.046182453632354736,
0.022312872111797333,
-0.011217483319342136,
0.012507112696766853,
0.03681166097521782,
0... | |
d77a34657f86f594456cc30439ece85561473345 | subsection | 96 | 510 | Proving | \\
\text{ if }&\ \mathbf {{\color {RedOrange}{\Omega _0}}}\left(\mathbf {{\color {RedOrange}{{\color {black}{\left.\mathsf {{\color {RoyalBlue}{\mathsf {{\color {RoyalBlue}{C}}}}}} \right.^{\mathsf {{\color {RoyalBlue}{{S}}}}}_{}}}}} \mathbf {{\color {RedOrange}{~\mathrel {{~\overline{\alpha }~}}~}}} \mathbf {{\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.05879811942577362,
0.04570813849568367,
-0.0585235059261322,
-0.03984968736767769,
-0.00900126900523901,
-0.03493712842464447,
0.0019099090714007616,
0.06529734283685684,
0.0176974106580019,
-0.02322022244334221,
-0.008452039211988449,
-0.012502610683441162,
0.011358381249010563,
0.0058... | |
c7062e34809abce2440f9dee8f34f5f258fceef3 | subsection | 97 | 510 | Proving | \end{}\begin{}[Robust Safety Preserving Compilation]
\begin{align*}
\vdash {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{{S}}}}}_{}}: \mathbf {\mathit {RSC}} \mathrel {\overset{\mbox{[}0pt]{\mbox{\normalfont \tiny \sffamily def}}}{=}}&\ \forall \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.08116554468870163,
0.039179157465696335,
-0.015386362560093403,
-0.0010002661729231477,
-0.009237920865416527,
-0.01394460629671812,
0.013555561192333698,
0.033747777342796326,
0.052177850157022476,
0.03628038614988327,
-0.009520169347524643,
0.014692183583974838,
0.009253176860511303,
... | |
40f86fb7ac7b4989c749c173230350715e685f4b | subsection | 98 | 510 | Proving | \begin{}[\mathbf {\mathit {PF\text{-}RSC}} and \mathbf {\mathit {RSC}} are equivalent]
\begin{align*}
\forall {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{{S}}}}}_{}}, \vdash {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {Roy... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.07634729892015457,
0.0013273811200633645,
-0.0384482815861702,
-0.0004939535865560174,
-0.008734777569770813,
-0.014021416194736958,
0.006312688812613487,
0.021573757752776146,
0.06908484548330307,
0.03649535030126572,
0.000986000057309866,
-0.006137230433523655,
0.014639334753155708,
0... | |
a4d8405f973db3938145379b4116d2fc6042ba17 | subsection | 99 | 510 | Proving | Consider this compiler to have this type and this notation: {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\fbox{\fbox{$\mathsf {{\color {RoyalBlue}{\cdot }}}$}}}}} \right.^{\mathsf {{\color {RoyalBlue}{{S}}}}}_{}} : \mathsf {{\color {RoyalBlue}{C}}}\rightarrow \mathbf {{\color {RedOrange}{C}}}.
}\begin{}[Robustly-... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.06843212246894836,
0.0020373971201479435,
-0.027363693341612816,
0.03363613039255142,
0.0025219465605914593,
-0.013842090964317322,
-0.01336898747831583,
0.054391633719205856,
0.033025674521923065,
0.02772996574640274,
0.030446495860815048,
-0.02193063497543335,
0.006417419295758009,
0.... | |
6c25f23a62821a7cf6d8e5636b306a834c79d465 | subsection | 100 | 510 | Proving | In a concurrent setting an adversary could access \mathbf {{\color {RedOrange}{x_{loc}}}} before it is hidden, so the definition would change.
See tr:compap-new for a concurrent correct implementation.
{\color {black}{\left.\mathsf {{\color {RoyalBlue}{{\color {black}{\left[\mathsf {{\color {RoyalBlue}{v}}}\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.04174177348613739,
0.028956828638911247,
-0.03191658854484558,
0.01597355119884014,
-0.012357761152088642,
0.03402198478579521,
0.0021721436642110348,
0.014470785856246948,
0.055045437067747116,
0.025417322292923927,
-0.04335895925760269,
-0.03502891585230827,
-0.011572051793336868,
0.0... | |
cc77fd1cd516a0c2e879d8201ef5754ae3f47a31 | subsection | 101 | 510 | Proving | Properties of the {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathbf {{\color {RedOrange}{L^{P}}}}}}} Compiler
Theorem 7 (Compiler {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathbf {{\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.03756578639149666,
0.030180798843503,
-0.05245782807469368,
-0.000053821055189473554,
0.005492966156452894,
-0.006561043206602335,
-0.015914343297481537,
0.04455405846238136,
0.028654973953962326,
0.02297890931367874,
-0.021742992103099823,
0.010238278657197952,
0.018599795177578926,
0.... | |
2cff9f4637f5e4352ff272da9eaf46a0c91e7f80 | subsection | 102 | 510 | Proving | In this case we cannot make it injective (in the next compiler we can index it by types and make it so but here we do not have them).
This is the reason why the backtranslation algorithm returns a set of contexts, as backtranslating an action that performs \mathbf {{\color {RedOrange}{\mathtt {call}~ f~ v~H{?}}}} could... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.039680127054452896,
0.006585374940186739,
0.004208382684737444,
0.024067522957921028,
0.004402968101203442,
-0.01663512922823429,
-0.005520879290997982,
0.04798243194818497,
0.03195776417851448,
0.031148899346590042,
-0.024784818291664124,
0.005921495612710714,
0.022297179326415062,
0.0... | |
3d1c0e4f561c0508d28ec30f6c3983c65b1ecf55 | subsection | 103 | 510 | Proving | Lemma 2 (Compiled code steps imply existence of source steps)
&\ \forall \\
\text{if }
&\ \mathsf {{\color {RoyalBlue}{\Omega ^{\prime \prime }}}}\operatorname{{\color {black}{\approx _{\beta }}}}\mathbf {{\color {RedOrange}{\Omega ^{\prime \prime }}}}
\\
&\ \mathbf {{\color {RedOrange}{\Omega ^{\prime \prime }}}}\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.03829469904303551,
0.003379392670467496,
-0.036524903029203415,
0.0009135040454566479,
-0.014448238536715508,
0.000503476127050817,
-0.02901853248476982,
0.059593264013528824,
0.019391458481550217,
0.01365488301962614,
0.02155793271958828,
0.014188872650265694,
-0.0023590908385813236,
0... | |
ee9150e91b5336a7a6aadc3f06158da52863e61e | subsection | 104 | 510 | Proving | \\
\text{if }
&\ \mathsf {{\color {RoyalBlue}{\Omega ^{\prime \prime }}}}\mathsf {{\color {RoyalBlue}{~\mathrel {{~\alpha _j?~}}~}}}\mathsf {{\color {RoyalBlue}{C_j, H_j \triangleright s_j;s_j^{\prime }\rho ^{\prime }}}}
\\
\text{then }
&\ \mathsf {{\color {RoyalBlue}{C_j, H_j \triangleright s_j;s_j^{\prime }\rho _y}}}... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.051052749156951904,
0.026762260124087334,
-0.035062529146671295,
-0.0039479671977460384,
-0.03332313522696495,
0.011229773983359337,
-0.008788518607616425,
0.04900819808244705,
0.00046607948024757206,
0.02387852780520916,
-0.0022429032251238823,
0.0065150996670126915,
0.004802406765520573... | |
f1d171a5867aff2f72feb4bb93501729347bc0d7 | subsection | 105 | 510 | Proving | Its implementation is described below.
{\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}}}}\rightarrow \mathsf {{\color {RoyalBlue}{A}}}
{\color {black}{\l... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.02088872902095318,
0.03201209381222725,
-0.03585720434784889,
0.01834057830274105,
-0.018111703917384148,
0.003595256945118308,
0.03225622698664665,
-0.0010852526174858212,
0.01922556571662426,
0.020812436938285828,
-0.005321362055838108,
0.048979416489601135,
-0.022612927481532097,
0.0... | |
d6b80173bdbd882d8d3c2649546b8ef983655362 | subsection | 106 | 510 | Proving | Single Action Translation
We use the shortcut \mathbf {{\color {RedOrange}{ak}}} to indicate a list of pairs of locations and tag to access them \mathbf {{\color {RedOrange}{\overline{\left\langle n,\eta \right\rangle }}}} that is what the context has access to.
We use functions .\mathtt {loc} to access obtain all loca... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.051456697285175323,
0.01814413256943226,
-0.01811361126601696,
0.012467414140701294,
0.00372725329361856,
0.0031054087448865175,
0.010063965804874897,
-0.009918995201587677,
-0.004925162997096777,
0.008392996154725552,
-0.028063127771019936,
-0.0016042067436501384,
0.0009308595908805728,
... | |
a53d62ae3588b48b667249bcbf44524bb75556cc | subsection | 107 | 510 | Proving | This function can be defined as follows:
\mathsf {{\color {RoyalBlue}{
\begin{aligned}&
\mathsf {{\color {RoyalBlue}{register(x)}}} \mapsto \\
&\ \mathsf {{\color {RoyalBlue}{let}}}~\mathsf {{\color {RoyalBlue}{xl}}}~\mathsf {{\color {RoyalBlue}{=}}}~x.1
\\
&\ ~\mathsf {{\color {RoyalBlue}{in}}}~
\mathsf {{\color {Roy... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.06323247402906418,
0.010208138264715672,
-0.03442385792732239,
0.006492620334029198,
0.00027012848295271397,
0.02493288181722164,
0.03610232472419739,
0.01495362538844347,
0.015319837257266045,
0.02461244724690914,
-0.016464246436953545,
-0.000682354555465281,
0.022644061595201492,
0.02... | |
0f232b024b8033da7b334e15423176b8ba0f974b | subsection | 108 | 510 | Proving | We use function \mathsf {{\color {RoyalBlue}{update(n, v)}}} which accesses the elements in the \mathsf {{\color {RoyalBlue}{L_{glob}}}} list, then takes the second projection of the element: if it is \mathsf {{\color {RoyalBlue}{n}}} it updates the first projection to \mathsf {{\color {RoyalBlue}{v}}}, otherwise it 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.0535389669239521,
0.014063898473978043,
-0.008424603380262852,
0.00042852730257436633,
-0.011248067021369934,
0.013896017335355282,
0.029608208686113358,
0.010568909347057343,
0.02051207795739174,
0.033240556716918945,
-0.011530413292348385,
-0.004544249270111322,
-0.011171757243573666,
... | |
87335cc6f394aeecb8aa23ce8d43a023ac7f5402 | subsection | 109 | 510 | Proving | We use the meta-level function {{\color {black}{\mathtt {reachable}(}}\mathbf {{\color {RedOrange}{H}}}, \mathbf {{\color {RedOrange}{v}}}, \mathbf {{\color {RedOrange}{ak}}}{{\color {black}{)}}}} that returns a set of pairs \left\langle \mathbf {{\color {RedOrange}{n\mapsto v:\eta }}},\mathsf {{\color {RoyalBlue}{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.05565139651298523,
-0.01532396674156189,
-0.026147613301873207,
-0.006742850411683321,
-0.00207472313195467,
0.013340774923563004,
0.014965466223657131,
-0.0024122470058500767,
0.024210188537836075,
0.009664244018495083,
-0.026956146582961082,
0.046345654875040054,
0.03395833820104599,
... | |
e990f9de66b66eab00aad52485119b3696bb620a | subsection | 110 | 510 | Proving | Definition 13 (Reachable)
{{\color {black}{\mathtt {reachable}(}}\mathbf {{\color {RedOrange}{H}}}, \mathbf {{\color {RedOrange}{v}}}, \mathbf {{\color {RedOrange}{ak}}}{{\color {black}{)}}}} =&\ \left\lbrace \left\langle \mathbf {{\color {RedOrange}{n\mapsto v:k}}},\mathsf {{\color {RoyalBlue}{e}}}\right\rangle ~\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.004863498266786337,
0.019926993176341057,
-0.02097979746758938,
0.013137167319655418,
-0.012549732811748981,
0.0006103213527239859,
0.01322108693420887,
0.022703954949975014,
0.04022017866373062,
0.02841045893728733,
-0.022764986380934715,
0.02601494826376438,
0.00026820763014256954,
0.0... | |
e2ad9d46ded9022f735116e992e6dfe0ef214a7f | subsection | 111 | 510 | Proving | Additionally, it tells how to reach those locations in the source so that we can \mathsf {{\color {RoyalBlue}{register(\cdot )}}} them for the source attacker (the backtranslated context) to access.
In this case we know by definition that \mathbf {{\color {RedOrange}{e}}} can only contain one \mathbf {{\color {RedOrang... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.027179373428225517,
-0.005459528882056475,
-0.03335997089743614,
0.008828336372971535,
-0.01596273109316826,
-0.01706150360405445,
0.012643520720303059,
0.016023773699998856,
0.0022223449777811766,
0.016924157738685608,
-0.031406596302986145,
0.0008317101746797562,
-0.0026629986241459846,... | |
479c66afe7c868b71f7022c96a042eb13f5ef65c | subsection | 112 | 510 | Proving | The base case for values is as before.
{\color {black}{\left\langle \!\left\langle {\cdot } \right\rangle \!\right\rangle ^{\mathbf {{\color {RedOrange}{L^{P}}}}}_{\mathsf {{\color {RoyalBlue}{L^{U}}}}}}}:\mathbf {{\color {RedOrange}{e}}}\rightarrow \mathsf {{\color {RoyalBlue}{e}}}
{\color {black}{\left\langle \!... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.027237867936491966,
0.022522740066051483,
-0.05902300775051117,
0.013306117616593838,
0.015518717467784882,
-0.0057565742172300816,
0.0056192404590547085,
0.03421137109398842,
-0.009437883272767067,
-0.0030633064452558756,
-0.008644398301839828,
0.014008046127855778,
0.009620994329452515,... | |
d0c38b77f600ee6756afbd8686b71eb061bbeb4f | subsection | 113 | 510 | Proving | In the returned parameters, the attacker knowledge, the heap and the stack of called functions serve as input to the next call.
{\color {black}{\left\langle \!\left\langle {\cdot } \right\rangle \!\right\rangle ^{\mathbf {{\color {RedOrange}{L^{P}}}}}_{\mathsf {{\color {RoyalBlue}{L^{U}}}}}}}:\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.02810758166015148,
0.027192024514079094,
-0.04654078185558319,
0.017136164009571075,
0.010895120911300182,
-0.02990817464888096,
0.016632607206702232,
0.035523585975170135,
0.009895638562738895,
0.02050846256315708,
-0.026139134541153908,
0.023850243538618088,
-0.007381673436611891,
0.0... | |
2fa34a8170eb275304b1946f6747a30cf5623397 | subsection | 114 | 510 | Proving | Each action is wrapped in an if statement checking that the action to be mimicked is that one (the same function may behave differently if called twice and we need to ensure this).
After the if, the counter checking for the action index \mathsf {{\color {RoyalBlue}{\ell _i}}} is incremented.
This is not done in 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.054993730038404465,
-0.010696616023778915,
-0.00695051159709692,
0.036194540560245514,
0.003120482200756669,
-0.015716854482889175,
0.03408879041671753,
-0.003669809317216277,
-0.02128641866147518,
0.020828647539019585,
-0.02517748437821865,
0.005272012669593096,
-0.018677115440368652,
... | |
ea428fd05581ad5d69db2575f7fcd39c41d36c31 | subsection | 115 | 510 | Proving | That stack carries the information to instantiate the \mathsf {{\color {RoyalBlue}{f}}} in the return parameters, which is the location where the code needs to be allocated.
{\color {black}{\left\langle \!\left\langle { \cdot } \right\rangle \!\right\rangle ^{\mathbf {{\color {RedOrange}{L^{P}}}}}_{\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.023529181256890297,
0.018966777250170708,
-0.05374174565076828,
-0.004100821912288666,
-0.003963491879403591,
-0.013885573484003544,
0.00923161767423153,
-0.011673036962747574,
0.024032723158597946,
0.033233821392059326,
-0.024475229904055595,
0.03140275925397873,
0.013137889094650745,
... | |
0a13c0d6852a8f6c7be1fa469dbd8978ebdd8f8b | subsection | 116 | 510 | Proving | 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,
... | |
8f45fa7dc8eb96b472a365ab6a295f153464f4e4 | subsection | 117 | 510 | Proving | 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}}}}}}}
{\color {black}{\left\langle \!\left\langle {\cdot } \right\rangle \!\right\rangle ^{\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.016551025211811066,
0.006216168403625488,
-0.04890561103820801,
0.044756412506103516,
0.0010210914770141244,
0.018656132742762566,
-0.006197100505232811,
0.012096740305423737,
0.017969684675335884,
0.027595210820436478,
-0.01835104450583458,
0.0378919318318367,
0.010411128401756287,
0.0... | |
29d591e44b992897e771f5baa044d81b59167bb6 | subsection | 118 | 510 | Proving | \bowtie : \mathsf {{\color {RoyalBlue}{A}}} \times \mathsf {{\color {RoyalBlue}{\overline{s,f}}}} \rightarrow \mathsf {{\color {RoyalBlue}{A}}}
\mathsf {{\color {RoyalBlue}{A}}} \bowtie \mathsf {{\color {RoyalBlue}{\varnothing }}} =&\ \mathsf {{\color {RoyalBlue}{A}}}
\\
\mathsf {{\color {RoyalBlue}{H ; F_1;\cdots... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.014818619936704636,
0.026981791481375694,
-0.019183320924639702,
0.0003369385376572609,
-0.012781250290572643,
-0.01799294725060463,
0.017321456223726273,
0.02905731275677681,
0.007516138255596161,
0.05057559907436371,
-0.01391820888966322,
-0.0071002705954015255,
0.01628369465470314,
-... | |
4332ec88704e0daa0ff608c3fe76967d45acec64 | subsection | 119 | 510 | Proving | 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}... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.0400167778134346,
0.03610972315073013,
-0.04850240796804428,
0.035865530371665955,
0.001325880060903728,
-0.020878318697214127,
-0.009103740565478802,
0.02283184416592121,
0.004189399536699057,
0.021504057571291924,
-0.021244604140520096,
-0.0030085076577961445,
-0.0033347313292324543,
... | |
1e91ab88b0cd87698c6dbd283855f5bd43786183 | subsection | 120 | 510 | Proving | Also it needs to ensure the step is incremented correctly.
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 sema... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.016469251364469528,
0.009707546792924404,
-0.026756808161735535,
0.02773366868495941,
0.001204857719130814,
-0.028557894751429558,
0.03138162940740585,
-0.0014109141193330288,
0.0029267643112689257,
0.010485982522368431,
-0.011149941943585873,
-0.011348366737365723,
-0.004540873225778341,... | |
079730d7d82e469fb045000f0978b22638555af5 | subsection | 121 | 510 | Proving | \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}{\Delta ; \overline{F} ; \overline{I}}}}
\\
\mathit {Contexts}~\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.04310343414545059,
0.01970486342906952,
-0.03962341323494911,
-0.02507752925157547,
-0.0115848109126091,
0.007715575862675905,
-0.0165606327354908,
0.04569818824529648,
0.029488610103726387,
0.029351241886615753,
-0.028603341430425644,
0.006357145961374044,
-0.004388186149299145,
0.0158... | |
d04818c3887f5211e382f85611cf6b213b0580fd | subsection | 122 | 510 | Proving | Static Semantics of \mathsf {{\color {RoyalBlue}{L^{\tau }}}}
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 {{\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.03388075530529022,
0.02603629045188427,
-0.044624920934438705,
-0.011995618231594563,
0.010293949395418167,
-0.023319726809859276,
0.027425097301602364,
0.031499944627285004,
0.01111807581037283,
0.025303734466433525,
-0.029500674456357956,
0.019275402650237083,
0.0047921426594257355,
0... | |
94b172dda8d605e85df250c079f384727dc5bb17 | subsection | 123 | 510 | Proving | We denote access to the parts of \mathsf {{\color {RoyalBlue}{C}}} and \mathsf {{\color {RoyalBlue}{P}}} via functions \mathtt {.funs}, \mathtt {.intfs} and \mathtt {.mon}.
We denote access to parts of \mathsf {{\color {RoyalBlue}{M}}} with a dot notation, so \mathsf {{\color {RoyalBlue}{M}}}.\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.03110312856733799,
0.0005990175413899124,
-0.013987250626087189,
-0.02794397808611393,
-0.02806607075035572,
0.0019630223978310823,
0.019794287160038948,
0.00435336958616972,
0.03897811099886894,
0.029882200062274933,
-0.0019296377431601286,
-0.008592276833951473,
0.022571897134184837,
... | |
44d9c0294b1b7005c1d7d38693ae51e459c15479 | subsection | 124 | 510 | Proving | 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}}}}
&... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04913119971752167,
0.04080025479197502,
-0.03576507046818733,
0.006377900950610638,
-0.0019168033031746745,
0.013038077391684055,
0.008025779388844967,
0.03222518414258957,
0.0006127095548436046,
0.013663660734891891,
0.004211245570331812,
0.007678656838834286,
0.007541333790868521,
-0.... | |
068d8c9ca0ea9d39f8f7066f73bc9995cb85cd05 | subsection | 125 | 510 | Proving | \mathsf {{\color {RoyalBlue}{(s,s^{\prime })}}}\in \mathsf {{\color {RoyalBlue}{\rightsquigarrow }}}
}{
\vdash \mathsf {{\color {RoyalBlue}{M}}}
}\end{array}
Notes
Monitor typing just ensures that the monitor is coherent and that it can't get stuck for no good reason.
\mathsf {{\color {RoyalBlue}{UN}}} Typing
Atta... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.03896385803818703,
-0.005747703369706869,
-0.04646981880068779,
-0.011770014651119709,
-0.0007327654166147113,
-0.021785587072372437,
-0.0126472357660532,
0.032708894461393356,
0.038933347910642624,
0.01716301590204239,
0.01769697666168213,
-0.0049200644716620445,
0.025126654654741287,
... | |
35716d8c8969e7856fadada1644390abf0ee78ee | subsection | 126 | 510 | Proving | \mathsf {{\color {RoyalBlue}{\Delta ,\Gamma }}}\vdash _\mathsf {{\color {RoyalBlue}{UN}}} \mathsf {{\color {RoyalBlue}{e}}} : \mathsf {{\color {RoyalBlue}{UN}}}
{\color {RoyalBlue}{L^{\tau }}}-base\endcsname \begin{array}{c}\textsf {\scriptsize ({TU\mathsf {{\color {RoyalBlue}{L^{\tau }}}}-base})} \\ {
\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.03739434480667114,
0.04050799459218979,
-0.05839622765779495,
-0.002930495422333479,
0.012767497450113297,
0.02010136842727661,
0.007898600772023201,
0.046948980540037155,
0.008501489646732807,
0.023779749870300293,
-0.018239282071590424,
0.019612951204180717,
0.006555457599461079,
0.01... | |
eaaee5815ad822a74967a968553ae0af0d41039f | subsection | 127 | 510 | Proving | \mathit {Whole\ Programs}~\mathbf {{\color {RedOrange}{P}}} \mathrel {::=}&\ \mathbf {{\color {RedOrange}{H_0 ; \overline{F} ;\overline{I}}}}
\\
\mathit {Components}~\mathbf {{\color {RedOrange}{C}}} \mathrel {::=}&\ \mathbf {{\color {RedOrange}{H_0 ; \overline{F} ; \overline{I}}}}
\\
\mathit {Statements}~\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.036325253546237946,
-0.008791321888566017,
-0.02706078626215458,
-0.024862956255674362,
0.0019879681058228016,
0.007745825685560703,
-0.004552103579044342,
0.04569655656814575,
0.0031193166505545378,
0.019749948754906654,
-0.037851523607969284,
-0.02751866728067398,
0.014621676877140999,
... | |
55ffe8df841e025a819e7cf44abb93b9f3333895 | subsection | 128 | 510 | Proving | Definition 15 (\mathbf {{\color {RedOrange}{L^{\pi }}}}: \mathbf {{\color {RedOrange}{M\mathop {\raisebox {1mm}{\frown }}C}}})
\mathbf {{\color {RedOrange}{(\left\lbrace \sigma \right\rbrace ,\rightsquigarrow ,\sigma _0,H_0,\sigma _c) \mathop {\raisebox {1mm}{\frown }}(H_0 ; \overline{F} ;\overline{I})}}}
A monitor... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.007060337346047163,
-0.014807255007326603,
-0.026029033586382866,
-0.0063279843889176846,
0.01737811788916588,
-0.025433996692299843,
0.014463964849710464,
0.024915248155593872,
0.04391064494848251,
-0.0049700806848704815,
-0.0054812016896903515,
0.01165661308914423,
-0.029004216194152832... | |
f5723470ae437c080175a65de0daf3487a926051 | subsection | 129 | 510 | Proving | Definition 17 (\mathsf {{\color {RoyalBlue}{L^{\tau }}}} Attacker)
\mathsf {{\color {RoyalBlue}{C}}}\vdash _{\mathsf {{\color {RoyalBlue}{att}}}}\mathsf {{\color {RoyalBlue}{A}}} \mathrel {\overset{\mbox{[}0pt]{\mbox{\normalfont \tiny \sffamily def}}}{=}}&\ \mathsf {{\color {RoyalBlue}{C}}}= \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.021102555096149445,
0.027160193771123886,
-0.07104374468326569,
0.001084309769794345,
-0.008003102615475655,
-0.008842322044074535,
0.01544163841754198,
0.015792585909366608,
0.05416780337691307,
0.01623508334159851,
-0.01740998961031437,
0.0037860244046896696,
-0.034179121255874634,
-0... | |
dc9102fe64553a94f96cf05f18efa1ec344bee77 | subsection | 130 | 510 | Proving | Lemma 5 (Semantics and typed attackers coincide)
\mathsf {{\color {RoyalBlue}{C}}}\vdash _{\mathsf {{\color {RoyalBlue}{attacker}}}}\mathsf {{\color {RoyalBlue}{A}}} \iff (\mathsf {{\color {RoyalBlue}{C}}}\vdash _{\mathsf {{\color {RoyalBlue}{att}}}}\mathsf {{\color {RoyalBlue}{A}}} )
Theorem 10 (Typability Implies... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.01878226548433304,
0.010535462759435177,
-0.02964577078819275,
-0.004932061303406954,
-0.0279216468334198,
-0.030454430729150772,
-0.01716494746506214,
0.030835872516036034,
0.01611216366291046,
0.019621441140770912,
-0.024641234427690506,
0.006263298448175192,
-0.01637154445052147,
-0.... | |
235d74489134f5a97a2270e0b4ec6e16ee8dc67e | subsection | 131 | 510 | Proving | \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.038674984127283096,
0.021397920325398445,
-0.04804611578583717,
0.00554407574236393,
0.00849353987723589,
0.011828379705548286,
-0.013278310187160969,
0.027197642251849174,
0.03366890922188759,
0.020360074937343597,
-0.028739146888256073,
0.01117972657084465,
0.024664079770445824,
0.023... | |
c5f1ff7228399b6983be084867b1bd4e70fb7e48 | subsection | 132 | 510 | Proving | \colorbox {yellow}{\mathsf {{\color {RoyalBlue}{M}}}\operatorname{{\color {black}{\approx }}}\mathbf {{\color {RedOrange}{M}}} }
\begin{array}{c}\textsf {\scriptsize ({Ok Mon})} \\ {
\mathbf {{\color {RedOrange}{M}}} = \mathbf {{\color {RedOrange}{(\left\lbrace \sigma \right\rbrace ,\rightsquigarrow ,\sigma _0,H_0,\s... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.06480039656162262,
0.015803486108779907,
-0.02767135575413704,
-0.05525118485093117,
-0.0048013003543019295,
0.004114855546504259,
-0.0219662357121706,
0.05110200494527817,
0.04875284060835838,
0.00236251438036561,
0.008344118483364582,
0.002459760755300522,
0.02362895756959915,
0.02147... | |
be8f1f3cb0a436e655ef909e4d102d5466e52da9 | subsection | 133 | 510 | Proving | (\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.07674426585435867,
0.028084615245461464,
-0.04301219806075096,
-0.006181668024510145,
-0.014194941148161888,
-0.019796600565314293,
-0.03834160417318344,
0.056596606969833374,
0.04447748512029648,
0.03647947311401367,
-0.006971547845751047,
0.02442140504717827,
0.016560764983296394,
0.0... | |
61d73b214f520597f7a69a9907d79b8115c3d535 | subsection | 134 | 510 | Proving | The remark about optimisation for {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathbf {{\color {RedOrange}{L^{P}}}}}}} in sec:compup-opt-deref is also valid for the tr:compap-deref case above.
As expressions are executed atomically, we are sure that albe... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.02765381708741188,
0.028508460149168968,
-0.018466399982571602,
0.014589982107281685,
-0.016329791396856308,
-0.006627301219850779,
0.04712747409939766,
-0.0006862900336273015,
0.014872319996356964,
0.039771437644958496,
-0.016116131097078323,
-0.01336143258959055,
0.01513176504522562,
... | |
cde6b77af6370af96026d33cf2fdd06e2976e78a | subsection | 135 | 510 | Proving | 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^{\... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.008474624715745449,
0.020015675574541092,
-0.028940347954630852,
0.02553829364478588,
-0.01389045175164938,
-0.016781434416770935,
-0.013249705545604229,
0.04637778550386429,
0.02602647989988327,
0.04668290168046951,
-0.018261251971125603,
-0.02678927220404148,
-0.006365503650158644,
0.... | |
96d001825080475ee5d15a1200978ec7a9849527 | subsection | 136 | 510 | Proving | \mathsf {{\color {RoyalBlue}{\Omega }}}\operatorname{{\color {black}{\mathrel {\hbox{$\sim $}\vspace{-1.48752pt}\hbox{$\sim $}\vspace{-1.48752pt}\hbox{$\sim $}}}_{\beta }}}\mathbf {{\color {RedOrange}{\Omega }}}
{\color {RoyalBlue}{L^{\tau }}}-Secure heap\endcsname \begin{array}{c}\textsf {\scriptsize ({\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.06272539496421814,
0.04033218324184418,
-0.029715240001678467,
-0.018335584551095963,
0.010479656048119068,
0.013210163451731205,
-0.005758471786975861,
0.03169829025864601,
0.02033388800919056,
0.0002955507079605013,
-0.015345755964517593,
-0.00009283629333367571,
0.005727963522076607,
... | |
4f59a67cbbcc8b96793e1c56ca481a211cb4ef7f | subsection | 137 | 510 | Proving | 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.03787127882242203,
0.037627145648002625,
-0.013419738970696926,
-0.007697849068790674,
-0.009353382512927055,
0.014152140356600285,
0.003187092486768961,
0.023406343534588814,
-0.005367132369428873,
0.017180927097797394,
-0.02397090382874012,
-0.012817032635211945,
-0.0017127522733062506,... | |
495276e0fcd807cfefbe0ec3d1c6fb871e6c843f | subsection | 138 | 510 | Proving | \spadesuit
Lemma 6 (A target location is either high or low)
&
\forall \\
\text{if }
&\ \mathsf {{\color {RoyalBlue}{H}}}\operatorname{{\color {black}{\approx _{\beta }}}}\mathbf {{\color {RedOrange}{H}}}
\\
&\ \mathbf {{\color {RedOrange}{n\mapsto v:\eta }}}\in \mathbf {{\color {RedOrange}{H}}}
\\
\text{ then eithe... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/2487726.2488368",
"end": 1646,
"openalex_id": "https://openalex.org/W2036329595",
"raw": "Frank McKeen, Ilya Alexandrovich, Alex Berenzon, Carlos V. Rozas, Hisham Shafi, Vedvyas Shanbhogue, and Uday R. Savagaonkar. Innovative instru... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05728635564446449,
0.030108146369457245,
-0.02310376800596714,
-0.008263335563242435,
-0.007710157427936792,
-0.0312831737101078,
-0.007836053147912025,
0.0063901604153215885,
0.033541664481163025,
0.017777998000383377,
-0.017533836886286736,
0.010781249962747097,
-0.008454086259007454,
... | |
c62147f2f8f42ba1907fe6dc59be51cc760ea1ca | subsection | 139 | 510 | Proving | \mathit {{\color {CarnationPink}{L^{I}}}}, a Target Language with Memory Isolation
Language \mathit {{\color {CarnationPink}{L^{I}}}} replaces \mathbf {{\color {RedOrange}{L^{\pi }}}}'s capabilities with a simple security
abstraction called an enclave. An enclave is a collection of code and
memory locations, with the 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.03175975754857063,
-0.006311527453362942,
-0.0015349786262959242,
-0.006483139935880899,
-0.018335845321416855,
-0.03325469419360161,
-0.009923017583787441,
0.009518774226307869,
-0.019769763574004173,
-0.004862355068325996,
-0.02695460617542267,
-0.01624598540365696,
-0.03731237724423408... | |
be0a53daceb5829eb75af4bc0ebe0fdff90c27c9 | subsection | 140 | 510 | Proving | Monitors of \mathit {{\color {CarnationPink}{L^{I}}}} are the same as those of \mathbf {{\color {RedOrange}{L^{\pi }}}}.
Compiler from \mathsf {{\color {RoyalBlue}{L^{\tau }}}} to \mathit {{\color {CarnationPink}{L^{I}}}}
The high-level structure of the compiler {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.06002986058592796,
-0.0005850965972058475,
-0.015671242028474808,
0.019379237666726112,
-0.0036316998302936554,
-0.02755819261074066,
-0.009384434670209885,
0.003345588920637965,
0.0063936226069927216,
0.018936719745397568,
-0.009689618833363056,
0.0071222516708076,
-0.00943021196871996,
... | |
b335d867ae635ca076bd612de8416f352d09fe92 | subsection | 141 | 510 | Proving | The only
change is that every location in the \mathit {{\color {CarnationPink}{trusted}}} \mathit {{\color {CarnationPink}{target}}}
\mathit {{\color {CarnationPink}{heap}}} is isolated in the enclave.
The Second Target Language: \mathit {{\color {CarnationPink}{L^{I}}}}
For clarity, we use a \mathit {{\color {Carnati... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.032187629491090775,
-0.011334316805005074,
0.004366687033325434,
-0.004530675709247589,
-0.019800731912255287,
-0.08292509615421295,
-0.001525480067357421,
0.03749630227684975,
-0.024590739980340004,
0.012356389313936234,
0.0026066640857607126,
-0.017832862213253975,
-0.02410258539021015,... | |
bd3a12911b0e3e9f44dd732232e33f60612da892 | subsection | 142 | 510 | Proving | Syntax
\mathit {Whole\ Programs}~\mathit {{\color {CarnationPink}{P}}} \mathrel {::=}&\ \mathit {{\color {CarnationPink}{H_0 ; \overline{F} ; \overline{I} ; \overline{E}}}}
\\
\mathit {Components}~\mathit {{\color {CarnationPink}{C}}} \mathrel {::=}&\ \mathit {{\color {CarnationPink}{H_0 ; \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.05820528417825699,
-0.0017693170811980963,
-0.018343668431043625,
-0.025470534339547157,
-0.012575027532875538,
-0.021258510649204254,
0.005070452578365803,
0.03867126256227493,
-0.010797126218676567,
0.03445923700928688,
-0.03445923700928688,
0.005474867764860392,
-0.025333186611533165,
... | |
8eac4c20b5840220a589d41c7fed693f104985d4 | subsection | 143 | 510 | Proving | Properties of \mathit {{\color {CarnationPink}{L^{I}}}}
Definition 21 (\mathit {{\color {CarnationPink}{L^{I}}}} Attacker)
\mathit {{\color {CarnationPink}{C}}}\vdash _{\mathit {{\color {CarnationPink}{att}}}}\mathit {{\color {CarnationPink}{A}}} \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.03841601312160492,
0.0031180588994175196,
-0.0062857018783688545,
-0.00025840793387033045,
-0.019482623785734177,
-0.039514485746622086,
0.004313791636377573,
0.023113684728741646,
0.015973616391420364,
0.03380853310227394,
-0.04006372019648552,
-0.002524960320442915,
-0.05269614979624748... | |
263dd2bdd815cfb373db107ea3fbe2f43e1d615e | subsection | 144 | 510 | Proving | 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 {{\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.0647578164935112,
-0.004398312885314226,
-0.002048477064818144,
-0.009757922030985355,
-0.024200256913900375,
-0.013427633792161942,
0.00987999141216278,
0.043182048946619034,
0.005470234900712967,
0.010787882842123508,
-0.0156859178096056,
0.00046276699868030846,
0.005630450788885355,
... | |
dd57d40da67ae341798a9d296e0bba7b2d30659c | subsection | 145 | 510 | Proving | Some auxiliary functions are changed:
\mathsf {{\color {RoyalBlue}{\Delta }}}\vdash _{\varphi }\mathit {{\color {CarnationPink}{H_0}}} ~~ \mathsf {{\color {RoyalBlue}{\Delta , \mathit {{\color {CarnationPink}{H}}} }}}\vdash \mathit {{\color {CarnationPink}{v}}}: \mathsf {{\color {RoyalBlue}{\tau }}}
\begin{array}{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.04168247431516647,
0.014768900349736214,
-0.036434024572372437,
-0.036586593836545944,
-0.042628418654203415,
-0.02981242910027504,
0.0009502330212853849,
0.05141652375459671,
0.02068866603076458,
0.03872259333729744,
0.0036483609583228827,
0.004603838548064232,
-0.03423699736595154,
0.... | |
2682565af188c9d3f3978719b33e3bd11f32480f | subsection | 146 | 510 | Proving | Properties of the \mathsf {{\color {RoyalBlue}{L^{\tau }}}}-\mathit {{\color {CarnationPink}{L^{I}}}} Compiler
Theorem 13 (Compiler {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{L^{\tau }}}}}_{\mathit {{\color {CarnationPink}{L^{I}}}}}}} is \mathbf {\mathit {CC}} )
... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.028896357864141464,
-0.008490403182804585,
-0.015394099988043308,
-0.005187307950109243,
-0.016034884378314018,
-0.011167969554662704,
-0.030391521751880646,
0.042017195373773575,
0.007773333694785833,
0.03789786249399185,
-0.01568397879600525,
-0.004832587670534849,
-0.022656330838799477... | |
36a74d61bd6e2340ed65258be739cfbfedce8df6 | subsection | 147 | 510 | Proving | The intuition behind tr:state-rel-proof-o is that high locations only need to be in sync, nothing is enforced on low locations.
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.
\spadesuit
Lemma 7 (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.06507936865091324,
0.02599206566810608,
-0.02211538515985012,
-0.01894078217446804,
-0.0031345393508672714,
-0.016727717593312263,
-0.015621185302734375,
0.033363860100507736,
-0.008928571827709675,
0.02666361629962921,
-0.022893773391842842,
-0.014697803184390068,
-0.012408426031470299,
... | |
ea2970a9ef806a59559991b0957213230377c8ee | subsection | 148 | 510 | Proving | Proofs
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}}... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05478186905384064,
0.03485286608338356,
-0.02027997374534607,
-0.025071479380130768,
-0.006409021094441414,
0.001109180273488164,
-0.01780792325735092,
0.013390276581048965,
0.037385955452919006,
0.02298091910779476,
-0.018723497167229652,
-0.0037176136393100023,
-0.027680866420269012,
... | |
3d9c782017265fa430b383a0a4dda7e3ff1e4af3 | subsection | 149 | 510 | Proving | \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,
... | |
3db30fe382a5736645d3e901012c0e9ae9896a15 | subsection | 150 | 510 | Proving | 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... | |
e37ff783b46dc6289273761e4b20a6a65fda7576 | subsection | 151 | 510 | Proving | 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,
... | |
c5b44718f121194f74e684febc527fc788eb910a | subsection | 152 | 510 | Proving | 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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.