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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
4ec5e5cf7c12170d1bbc026a08b0af9b8e670b26 | subsection | 253 | 510 | The Source Language | This
representation of the set by a single location is made explicit in the
following monitor rule:{\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\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.0511382557451725,
0.018337763845920563,
-0.029520442709326744,
-0.019878624007105827,
-0.014355936087667942,
-0.019314149394631386,
-0.01951247826218605,
0.018886981531977654,
0.015301810577511787,
0.014386448077857494,
0.012235346250236034,
0.013547366484999657,
0.03576016426086426,
0.... | |
c0c80cd9b2aaa81a1cd9471753587041811e9f82 | subsection | 254 | 510 | The Source Language | In particular, a monitor and
a component agree if they mention the same \mathsf {{\color {RoyalBlue}{\ell _{root}}}}:\mathsf {{\color {RoyalBlue}{M\mathop {\raisebox {1mm}{\frown }}C}}}\mathrel {\overset{\mbox{[}0pt]{\mbox{\normalfont \tiny \sffamily def}}}{=}}&\ (\mathsf {{\color {RoyalBlue}{M}}} = \mathsf {{\color {R... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05937056615948677,
0.03853290155529976,
-0.03722101449966431,
0.01438500639051199,
0.00833659153431654,
-0.043170273303985596,
-0.0006487935315817595,
0.018351180478930473,
-0.012851927429437637,
0.02506316639482975,
-0.02358347922563553,
0.016978273168206215,
0.015201123431324959,
0.02... | |
69bd34df04e3e2bfffd32330273c3cfab5ab885c | subsection | 255 | 510 | The Source Language | \otimes includes ==,<,> etc; {\color {black}{\left[\mathsf {{\color {RoyalBlue}{v}}}\mathrel {}/\mathrel {}\mathsf {{\color {RoyalBlue}{x}}}\right]}} substitutes value \mathsf {{\color {RoyalBlue}{v}}} for variable \mathsf {{\color {RoyalBlue}{x}}}.]\mathsf {{\color {RoyalBlue}{L^{U}}}} has a big-step semantics for exp... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/2837614.2837642",
"end": 1603,
"openalex_id": "https://openalex.org/W2295752850",
"raw": "Jeehoon Kang, Yoonseung Kim, Chung-Kil Hur, Derek Dreyer, and Viktor Vafeiadis. Lightweight verification of separate compilation. POPL 2016, p... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04266371205449104,
0.009628326632082462,
-0.04458632692694664,
0.04782119765877724,
0.01187137607485056,
-0.009796174243092537,
0.012466470710933208,
0.03799450770020485,
0.0009470016229897738,
-0.02287299931049347,
-0.002868661656975746,
0.028183074668049812,
0.010520968586206436,
-0.0... | |
38ad2e0681fd521514988d6defec56b3fbc63b4d | subsection | 256 | 510 | The Source Language | This ensures that the context cannot violate any invariants (including static types, which is what we care about in this section) of the trusted locations, since it can never gets direct access to them.
[Figure: Typing judgements and rules of \mathsf {{\color {RoyalBlue}{L^{\tau }}}}. For space constraints, unsurprisin... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 1774,
"openalex_id": "https://openalex.org/W2186841663",
"raw": "Stephen Chong. Expressive and Enforceable Information Security Policies. PhD thesis, Cornell University, August 2008.",
"source_ref_id": "c4bd16441eb9494d0951f... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.03683749958872795,
0.010132601484656334,
-0.05167016014456749,
0.01571773923933506,
0.013283778913319111,
-0.00911018531769514,
0.03460954874753952,
0.0321374349296093,
0.007813090458512306,
0.018098291009664536,
-0.016740156337618828,
0.01183408498764038,
0.015809299424290657,
0.013184... | |
3e050f7d2df3a6a99926c20af4632ea8a0325ae2 | subsection | 257 | 510 | The Source Language | For concurrency, the program state \mathsf {{\color {RoyalBlue}{\Omega }}} contains a soup (i.e., a multiset) \mathsf {{\color {RoyalBlue}{\Pi }}} of processes, where each process is a statement executing as in the program state for \mathsf {{\color {RoyalBlue}{L^{U}}}}, and a soup takes a step if any process in it doe... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.3233/jcs-2009-0352",
"end": 496,
"openalex_id": "https://openalex.org/W1699577049",
"raw": "Andrei Sabelfeld and David Sands. Declassification: Dimensions and principles. J. Comput. Secur., 17(5):517–548, October 2009.",
"source_re... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05498778447508812,
-0.028714487329125404,
-0.04119506850838661,
0.013159534893929958,
-0.013991065323352814,
0.031735457479953766,
-0.0010022225324064493,
0.04388037323951721,
0.011191326193511486,
-0.002969477791339159,
-0.014967541210353374,
-0.004363625776022673,
0.018064800649881363,
... | |
e8194c30101a1814dc26ac79eef270afac868589 | subsection | 258 | 510 | The Source Language | The monitor transitions should, therefore, be of the form \mathsf {{\color {RoyalBlue}{(\sigma ,\Delta ,\sigma ^{\prime })}}}, but since \mathsf {{\color {RoyalBlue}{\Delta }}} never changes (it maps trusted locations to static types), we write the transitions as pairs of states only.A monitor and a component agree 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.04335230961441994,
0.01889989897608757,
-0.02353716269135475,
-0.010525367222726345,
-0.004755483008921146,
0.017832107841968536,
0.005846155341714621,
0.030279498547315598,
0.011021127924323082,
0.009266899898648262,
0.013301623985171318,
0.003708666656166315,
0.03694556653499603,
0.00... | |
47fb955ec271da1b2d6a3dc29bfbca36edacb210 | subsection | 259 | 510 | The Source Language | In fact, in the target if one allocates something, that reveals how much it's been allocated entirely.\mathit {Components}~\mathsf {{\color {RoyalBlue}{C}}} \mathrel {::=}&\ \mathsf {{\color {RoyalBlue}{\overline{F} ; \overline{I} ; \overline{E}}}}
\\
\mathit {Exports}~\mathsf {{\color {RoyalBlue}{E}}} \mathrel {::=}&\... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.043528180569410324,
0.03053993359208107,
-0.049541544169187546,
-0.001882990705780685,
-0.011591744609177113,
-0.029105274006724358,
0.021138334646821022,
0.026938023045659065,
0.007936414331197739,
0.018375853076577187,
-0.020558366551995277,
-0.0005432437756098807,
-0.000743084994610399... | |
6c6673ac0e94a5551244aaa497045ded050c64a9 | subsection | 260 | 510 | The Target Language | \mathbf {{\color {RedOrange}{L^{P}}}} is an untyped, imperative language that follows the structure of \mathsf {{\color {RoyalBlue}{L^{U}}}} and it has similar expressions and statements (fig:lp-syn).
However, there are critical differences (that make the compiler interesting).
The main difference is that heap location... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.17863/cam.15863",
"end": 972,
"openalex_id": "https://openalex.org/W2166051945",
"raw": "Ian Stark. Names and Higher-Order Functions. PhD thesis, University of Cambridge, December 1994. Also available as Technical Report 363, University ... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05505812540650368,
0.02929922379553318,
-0.001525047468021512,
-0.0029280148446559906,
-0.0010367271024733782,
-0.006168860010802746,
0.013604301027953625,
-0.0035517679061740637,
0.021821817383170128,
0.004162168595939875,
-0.026445601135492325,
-0.011292409151792526,
0.00933149736374616... | |
2c92887c4d30d60da97c29c542c128b43b3cc8c6 | subsection | 261 | 510 | The Target Language | A globally available location can be freely read and written but one that is protected by a capability requires the same capability to be supplied at the time of read/write (tr:et-ac-t, tr:et-de-t).\mathbf {{\color {RedOrange}{L^{P}}}} has a big-step semantics for expressions, a labelled small-step semantics and a 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.04085255041718483,
0.03767953813076019,
0.008329161442816257,
0.004786216653883457,
0.019983883947134018,
-0.030784334987401962,
-0.017909221351146698,
0.002095638308674097,
0.013531072996556759,
-0.00000875963451107964,
0.0122649185359478,
-0.007326153106987476,
0.03630660101771355,
0.... | |
e9aad6bbec99073ce1deb45cd8dc5122f363cf49 | subsection | 262 | 510 | The Target Language | We can now give a precise definition of component-monitor agreement for \mathbf {{\color {RedOrange}{L^{P}}}} as well as a precise definition of attacker, which must care about the \mathbf {{\color {RedOrange}{k_{root}}}} capability.\mathbf {{\color {RedOrange}{M\mathop {\raisebox {1mm}{\frown }}C}}}\mathrel {\overset{... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.02765631675720215,
0.025901086628437042,
-0.02481742389500141,
0.01840701885521412,
-0.003903478616848588,
-0.05683892220258713,
0.018330704420804977,
-0.01413341611623764,
0.013400798663496971,
0.022802725434303284,
0.00232377159409225,
-0.01282080914825201,
-0.005200822371989489,
0.03... | |
cef0115d2601f0ee5ab4dc106ecb3685b29e3a47 | subsection | 263 | 510 | The Target Language | Elided elements are either the same as \mathbf {{\color {RedOrange}{L^{P}}}} (fig:lp-syn,fig:lp-sem) or \mathsf {{\color {RoyalBlue}{L^{\tau }}}} (fig:la).]Monitors are also updated to consider a fixed set of locations (a heap part \mathbf {{\color {RedOrange}{H_0}}}).
Atomic co-creation of locations and capabilities i... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1109/isca.2014.6853201",
"end": 438,
"openalex_id": "https://openalex.org/W4238851087",
"raw": "Jonathan Woodruff, Robert N.M. Watson, David Chisnall, Simon W. Moore, Jonathan Anderson, Brooks Davis, Ben Laurie, Peter G. Neumann, Robert ... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.03337739780545235,
-0.0059951175935566425,
-0.004397182259708643,
0.01774127595126629,
-0.03651987761259079,
-0.04512355476617813,
0.02460591495037079,
0.007654071785509586,
0.032248545438051224,
0.012142783030867577,
0.0037984333466738462,
-0.03276720643043518,
-0.0402725450694561,
0.0... | |
507b1cdb5b0e3be7c6ea1b45f5a935479293e6db | subsection | 264 | 510 | Compiler from | We now present {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathbf {{\color {RedOrange}{L^{P}}}}}}}, the compiler from \mathsf {{\color {RoyalBlue}{L^{U}}}} to \mathbf {{\color {RedOrange}{L^{P}}}}, detailing how it uses the capabilities of \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.05705517902970314,
0.02634606882929802,
-0.035758648067712784,
-0.0007990013691596687,
0.013081502169370651,
-0.0063691274262964725,
-0.00598774291574955,
0.0011927812593057752,
0.04451524466276169,
0.020320186391472816,
-0.02157112956047058,
0.010915235616266727,
0.030312471091747284,
... | |
e17aa770f8d6fe1d5e5fcb8922d52189af3643a6 | subsection | 265 | 510 | Compiler from | Unlike existing secure compilers, {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathbf {{\color {RedOrange}{L^{P}}}}}}} needs neither dynamic checks nor other constructs that introduce runtime overhead to attain \mathbf {\mathit {RSC}} , , , , .The high-... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/2429069.2429114",
"end": 311,
"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.07262042909860611,
-0.004020059481263161,
-0.03902585059404373,
0.03083316795527935,
-0.012357677333056927,
-0.007181946653872728,
0.008063003420829773,
0.008734283968806267,
0.029810989275574684,
0.017819466069340706,
-0.012967932969331741,
-0.0045692892745137215,
0.026469839736819267,
... | |
caca30bf4808a728e46ba2b550a44bb8640805bb | subsection | 266 | 510 | Compiler from | The interested reader can find the full compiler formalisation (including auxiliary functions) in the accompanying technical report .
[Figure: {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{L^{\tau }}}}}_{\mathbf {{\color {RedOrange}{L^{\pi }}}}}}}, compilation of com... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.48550/arxiv.1804.00489",
"end": 133,
"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.03687473013997078,
-0.003220433834940195,
-0.03504320606589317,
0.025336114689707756,
-0.019322603940963745,
-0.05598365515470505,
0.004651314113289118,
0.028892328962683678,
0.013721185736358166,
0.03940834477543831,
-0.015117724426090717,
0.01142414566129446,
0.011462302878499031,
0.0... | |
ce5f0129e4b94362cf95f37918526ba5c7905bed | subsection | 267 | 510 | Compiler from | Its type is \mathsf {{\color {RoyalBlue}{\ell }}}\times \mathit {{\color {CarnationPink}{n}}}, but it has the same properties as \beta in sec:compup-proof.The cross-language relation \operatorname{{\color {black}{\approx }}} is mostly unchanged. The only change is for relating locations, as defined below:\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.03890278935432434,
0.027613351121544838,
-0.014775431714951992,
-0.0014493195340037346,
-0.019222553819417953,
-0.015522975474596024,
-0.002875755075365305,
0.013532067649066448,
0.016049306839704514,
0.028360895812511444,
-0.004778940696269274,
0.004489076789468527,
-0.01229633204638958,... | |
bf79a21f3c0f65ef051b8b7a6dff04f005aba802 | subsection | 268 | 510 | Compiler from | 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 high-level structure of the compiler {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\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.053251128643751144,
-0.012504098005592823,
-0.009994123131036758,
0.024184253066778183,
-0.005912553984671831,
-0.04852108657360077,
0.009711846709251404,
0.022582141682505608,
0.00204841373488307,
0.017241770401597023,
-0.0025080672930926085,
-0.005821004509925842,
-0.007289606612175703,... | |
2137239243649a1c308da99e4d8c671aaeeb02c0 | subsection | 269 | 510 | Compiler from | 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. | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.014134078286588192,
-0.015553591772913933,
-0.010127387940883636,
-0.0028275789227336645,
-0.02990136109292507,
-0.07906536012887955,
0.012996941804885864,
0.04731711000204086,
-0.029336607083678246,
0.004407359752804041,
0.004907242022454739,
-0.020773736760020256,
-0.022467995062470436,... | |
dbaf80f827ff47c31e521914e7921f17f8aca107 | subsection | 270 | 510 | Proof of | {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathbf {{\color {RedOrange}{L^{P}}}}}}} attains \mathbf {\mathit {RSC}} (thm:comp-up-rsc).
In order to set up this theorem, we need to instantiate the cross-language relation for values, which we write as \ope... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.045727845281362534,
0.024481797590851784,
-0.02309286780655384,
0.008821994066238403,
-0.02161235921084881,
0.02167341113090515,
-0.020147114992141724,
0.013667985796928406,
0.02521441876888275,
0.011462487280368805,
0.003926397766917944,
0.023123392835259438,
0.009539353661239147,
0.03... | |
dee6d09be0369e2c058d3c9b038306cfae2dd909 | subsection | 271 | 510 | Proof of | The relation is parametrised by a partial bijection \beta : \mathsf {{\color {RoyalBlue}{\ell }}}\times \mathbf {{\color {RedOrange}{n}}}\times \mathbf {{\color {RedOrange}{\eta }}} from source heap locations to target heap locations such that:if (\mathsf {{\color {RoyalBlue}{\ell _1}}},\mathbf {{\color {RedOrange}{n}}... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.042370375245809555,
0.0067043183371424675,
-0.015018894337117672,
0.003376961685717106,
-0.01619415357708931,
0.008409970439970493,
0.014873894862830639,
0.035501979291439056,
0.037211447954177856,
0.010661277920007706,
-0.032846201211214066,
-0.011538906954228878,
-0.015888892114162445,
... | |
7ce2064f8a79770e48cd8b879740bc1f8837ce9b | subsection | 272 | 510 | Proof of | Heaps are related, written \mathsf {{\color {RoyalBlue}{H}}}\operatorname{{\color {black}{\approx _{\beta }}}}\mathbf {{\color {RedOrange}{H}}}, when locations related in \beta point to related values.
States are related, written \mathsf {{\color {RoyalBlue}{\Omega }}}\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.06600052118301392,
0.011676780879497528,
-0.01548509020358324,
-0.006750400178134441,
-0.01843862794339657,
0.000221205351408571,
0.016820669174194336,
0.05757492408156395,
0.007002252619713545,
0.012485760264098644,
-0.05134730786085129,
-0.0059986598789691925,
-0.0016503946390002966,
... | |
5c077dc58eb97a28bdba9786ac66cde89bddfede | subsection | 273 | 510 | Proof of | For example, if executing \mathsf {{\color {RoyalBlue}{{let}~x={new}~e~{in}~s}}} creates some source location \mathsf {{\color {RoyalBlue}{\ell }}}, then executing its compiled counterpart will create some target location \mathbf {{\color {RedOrange}{n}}}.
At this point we add (\mathsf {{\color {RoyalBlue}{\ell }}}, \m... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05243043228983879,
0.005371220409870148,
-0.01491581741720438,
0.020111557096242905,
-0.011436731554567814,
-0.010025260038673878,
-0.017776908352971077,
0.03894134610891342,
0.029114454984664917,
0.0065271006897091866,
0.0073549095541238785,
-0.0017157004913315177,
-0.005527626257389784,... | |
28ad24b1e29873450c03e4ddc04f27d9741371cd | subsection | 274 | 510 | Monitor Relation | In sec:rsc-theory, we left the monitor relation abstract. Here, we define it for our two languages.
Two monitors are related when they can simulate each other on related heaps. | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04434485733509064,
-0.005230281967669725,
-0.008919328451156616,
0.037539005279541016,
-0.018037034198641777,
0.002533119870349765,
-0.0019513415172696114,
0.038363032042980194,
0.053622789680957794,
0.0013075704919174314,
0.028703603893518448,
-0.012719008140265942,
0.003599395276978612,... | |
56a06394de9a635e8f1269ef53faf13709354df2 | subsection | 275 | 510 | Monitor Relation | Given a monitor-specific relation \mathsf {{\color {RoyalBlue}{\sigma }}} \operatorname{{\color {black}{\approx }}}{{\color {RedOrange}{\sigma }}} on monitor states, we say that a relation \mathcal {R} on source and target monitors is a bisimulation if the following hold whenever \mathsf {{\color {RoyalBlue}{M}}}=\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.10186183452606201,
0.00928444042801857,
-0.004321804270148277,
0.00036571311648003757,
-0.013526140712201595,
0.005683572962880135,
0.010535589419305325,
0.036069709807634354,
0.055172618478536606,
0.006145124789327383,
0.005828523077070713,
-0.010283834300935268,
0.020964374765753746,
... | |
c33f0b6484afbe582a9c88b4adb435de98195ac4 | subsection | 276 | 510 | Monitor Relation | In particular, this means that neither \mathsf {{\color {RoyalBlue}{M}}} nor \mathbf {{\color {RedOrange}{M}}} can be sensitive to the specific addresses allocated during the run of the program.
However, they can be sensitive to the “shape” of the heap or the values stored in the heap.
Note that the union of any two bi... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/2699503",
"end": 2034,
"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.05372081696987152,
0.01727612502872944,
-0.038001373410224915,
0.002043146174401045,
-0.012422938831150532,
-0.0010530500439926982,
-0.007989444769918919,
0.03476591408252716,
0.02396070398390293,
0.019580626860260963,
-0.022175097838044167,
0.012690016999840736,
0.010003975592553616,
0... | |
21d0c1d5a25948fb4af792aa1b5a1ff8a0150828 | subsection | 277 | 510 | Monitor Relation | Under this assumption, the backtranslation is unique: a target value \mathbf {{\color {RedOrange}{v}}} will be related to at most one source value \mathsf {{\color {RoyalBlue}{v}}}.
We do away with this assumption (e.g., the target value \mathbf {{\color {RedOrange}{0}}} is related to both source values \mathsf {{\colo... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.48550/arxiv.1804.00489",
"end": 857,
"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.055566269904375076,
-0.013830538839101791,
-0.044764261692762375,
0.041956957429647446,
-0.01543253194540739,
-0.009337330237030983,
0.006964854896068573,
0.026181142777204514,
0.027340680360794067,
0.0057061463594436646,
-0.007380610331892967,
0.012640487402677536,
0.04058382287621498,
... | |
d82ad621fa1c84c5962fb12147fc4b9f27b840d1 | subsection | 278 | 510 | Notation | ex:bt needs to reason about lists of finite length whose elements are pairs, which are not a base type in our language.
However, they can be easily encoded as sequences of pairs, with \mathsf {{\color {RoyalBlue}{{unit}}}} being the empty list.
Thus, list \mathsf {{\color {RoyalBlue}{\left\langle 1,1\right\rangle ::\le... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.037198763340711594,
0.03042425587773323,
-0.016829464584589005,
0.015250272117555141,
0.01995733566582203,
-0.027647318318486214,
0.03539833053946495,
0.024672025814652443,
-0.008224008604884148,
0.026014722883701324,
-0.02750999666750431,
0.0014304282376542687,
0.03001229278743267,
0.0... | |
56b1074e61dc9f7ee226cdfc19f1ae89b9880b64 | subsection | 279 | 510 | Notation | \mathbf {{\color {RedOrange}{\mathtt {call}~ f~ 0~ ({\color {black}{\overbrace{\mathbf {{\color {RedOrange}{1\mapsto 4:\bot }}}}^{\node (h1){};}}}, {\color {black}{\overbrace{\mathbf {{\color {RedOrange}{2\mapsto 3:\bot }}}}^{\node (h2){};}}} ){?} }}} \right.{\scriptstyle (2)}\left. \mathbf {{\color {RedOrange}{\mathtt... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.03909407928586006,
0.000830196077004075,
-0.021607032045722008,
-0.019028227776288986,
-0.0011844957480207086,
0.0355844646692276,
0.007755490485578775,
0.032593660056591034,
-0.0015907719498500228,
0.009384410455822945,
-0.032441068440675735,
0.010399146936833858,
0.01380195003002882,
... | |
d5a0458f8e80baeac0622be702e04ad64cbe615e | subsection | 280 | 510 | Notation | \begin{aligned}
&\mathsf {{\color {RoyalBlue}{\node (ch4){}; {let}~x={new}~L(1)~{in}~x:=55;}}}\quad \\
&\mathsf {{\color {RoyalBlue}{\node (ch5){}; {let}~x={new}~L(3)~{in}~x:=15;}}}
\\
&\mathsf {{\color {RoyalBlue}{\node (zz){}; {call}~f~2;}}}
\end{aligned}
\right]{\scriptstyle (3)}
;[dotted] (h1.-90) |- ([yshift=1em]h... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.028971152380108833,
-0.006865201983600855,
-0.017086725682020187,
-0.0013463423820212483,
0.0009568375535309315,
0.020473558455705643,
0.013615984469652176,
0.02999330498278141,
0.000987826264463365,
0.022609399631619453,
-0.04289988428354263,
0.015317028388381004,
0.008062798529863358,
... | |
aff30a30104c9da4c6a2b8c6898a36e3711151b6 | subsection | 281 | 510 | Notation | In order to backtranslate the last call we look up the locations to be updated in \mathsf {{\color {RoyalBlue}{L}}} so we can ensure that when the \mathsf {{\color {RoyalBlue}{{call}~f~2}}} statement is executed, the heap is in the right state.For the backtranslation to be used in the proof we need to prove its correct... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.054597433656454086,
0.030625224113464355,
-0.0005893867928534746,
0.007808898109942675,
0.0015192445134744048,
-0.0014686984941363335,
-0.007232862990349531,
0.02214110642671585,
0.0028496563900262117,
0.036866240203380585,
-0.035065650939941406,
0.013496766798198223,
-0.00638216221705079... | |
6286d09d0e67069b0101e7f88b93ad7b76c9782c | subsection | 282 | 510 | Notation | The only missing element in the proof is to demonstrate that related monitor states either both step or both get stuck on related source and target actions.
We prove this by showing an invariant, namely that the monitor states always remain related. This follows from the rules of
fig:mon-st-act-rel.
Finally, recall tha... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.03680044412612915,
0.030209319666028023,
-0.04702278971672058,
0.01617266610264778,
-0.009917200542986393,
0.011801469139754772,
0.018888453021645546,
0.038082052022218704,
-0.0019367148634046316,
0.005286631174385548,
-0.0023114706855267286,
-0.016309980303049088,
0.014448598958551884,
... | |
195ec1b8c023decbb5d282692c1430e66ab927ad | subsection | 283 | 510 | Notation | Additionally, an attacker has no way to decrement the amount of the balance since deposit only adds the absolute value \mathsf {{\color {RoyalBlue}{abs(x)}}} of its input \mathsf {{\color {RoyalBlue}{x}}} to the existing balance.By compiling \mathsf {{\color {RoyalBlue}{C_a}}} with {\color {black}{\left.\mathsf {{\colo... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.013109914027154446,
0.028936434537172318,
-0.03772725164890289,
0.005677402019500732,
-0.024144219234585762,
0.0085008405148983,
0.03122570924460888,
0.00209468649700284,
0.029928453266620636,
-0.005482813343405724,
-0.009355503134429455,
0.008416900411248207,
-0.02052716538310051,
0.03... | |
754601d19900a661c4709d63d6ddcb93d75f6586 | subsection | 284 | 510 | Richer Source Monitors | In \mathsf {{\color {RoyalBlue}{L^{\tau }}}}, source language monitors only enforce the property of type safety on specific memory locations (robustly).
This can be generalized substantially to enforce arbitrary invariants other than types on locations.
The only requirement is to find a type system (e.g., based on refi... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/3133913",
"end": 439,
"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.02218385599553585,
0.0355185829102993,
-0.007647633086889982,
0.0058663636445999146,
-0.011610670946538448,
-0.03417595475912094,
-0.025204766541719437,
0.042475830763578415,
0.01882728934288025,
-0.004493222571909428,
0.003167760092765093,
-0.003888659179210663,
0.017621977254748344,
-... | |
c88acb2a1721aa1662843bd2f9e20a7c744cb978 | subsection | 285 | 510 | New Monitor Relation | As monitors have changed, we also need a new monitor relation \mathsf {{\color {RoyalBlue}{M}}}\operatorname{{\color {black}{\approx }}}\mathbf {{\color {RedOrange}{M}}}.
Informally, a source and a target monitor are related if the target monitor can always step whenever the target heap satisfies the types specified in... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.0594034269452095,
-0.0024808633606880903,
-0.030739061534404755,
-0.011044705286622047,
-0.010587051510810852,
-0.013897411525249481,
-0.0231420136988163,
0.012341390363872051,
0.0744449719786644,
0.009175953455269337,
-0.00483205821365118,
-0.021006297320127487,
0.014583892188966274,
0... | |
870cb74edecffc8e36641949bc862dc73c898fa6 | subsection | 286 | 510 | New Monitor Relation | For a fixed partial bijection \beta _0 between the domains of
\mathsf {{\color {RoyalBlue}{\Delta }}} and \mathbf {{\color {RedOrange}{H_0}}}, we say that the source monitor
\mathsf {{\color {RoyalBlue}{M}}} and the target monitor \mathbf {{\color {RedOrange}{M}}} are related, written
\mathsf {{\color {RoyalBlue}{M}}} ... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.07324624061584473,
0.03152640163898468,
-0.012551047839224339,
-0.008293610997498035,
0.007202547043561935,
-0.007828191854059696,
-0.013855746947228909,
-0.000683822319842875,
0.08142540603876114,
0.027711493894457817,
0.004478702321648598,
0.0008354649180546403,
0.008293610997498035,
... | |
f7cd8cde6a7dd538ce23719987f6e125a0911e9b | subsection | 287 | 510 | New Monitor Relation | The relation captures the following:Heaps (both \mathsf {{\color {RoyalBlue}{source}}} and \mathbf {{\color {RedOrange}{target}}}) can be partitioned into two parts, a trusted part and an untrusted part;
The trusted \mathsf {{\color {RoyalBlue}{source\ heap}}} contains only locations whose type is trusted (\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.05585983023047447,
0.028998272493481636,
-0.015094364061951637,
0.033699046820402145,
-0.010912507772445679,
-0.013774179853498936,
0.010920139029622078,
0.013751286081969738,
0.01165272668004036,
0.0021042826119810343,
-0.0013612017501145601,
-0.000054848707804922014,
0.01342314761132001... | |
b26a543da534401c461c842c3bddadfaeb1f13fc | subsection | 288 | 510 | Non-Atomic Allocation of Capabilities | The compiler of fig:compap uses a new target language construct, \mathbf {{\color {RedOrange}{newhide}}}, that simultaneously allocates a new location and protects it with a capability.
This atomic construct is what certain capability machines provide, and it simplifies our proof of security in the concurrent setting a... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.48550/arxiv.1804.00489",
"end": 2166,
"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.012571717612445354,
-0.00018653992447070777,
-0.017438681796193123,
0.03213111311197281,
-0.004668623674660921,
-0.031856488436460495,
-0.008765111677348614,
0.008681198582053185,
0.032832931727170944,
0.022641297429800034,
-0.01469243224710226,
-0.03170391917228699,
-0.016508009284734726... | |
bdb1b7786d5e0be824ddddcce5ad80515d4bef06 | subsection | 289 | 510 | Fully Abstract Compilation | Our next goal is to compare \mathbf {\mathit {RSC}} to fully abstract compilation (or \mathbf {\mathit {FAC}}) at an intuitive
level. We first define \mathbf {\mathit {FAC}} (sec:facomp-def).
Then, we present a series of examples of how \mathbf {\mathit {FAC}} may result in inefficiencies in compiled code (sec:fac-shor... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04024956375360489,
-0.01026836782693863,
-0.02433587983250618,
0.0023458567447960377,
-0.0015848836628720164,
-0.0375337079167366,
0.00902487337589264,
0.014700702391564846,
0.032895397394895554,
0.07647111266851425,
-0.025495458394289017,
-0.029767587780952454,
0.0012711492599919438,
0... | |
c9d2462e9b20b64b0d489bd71ef0ddd40118d176 | subsection | 290 | 510 | Remark | This does not imply that one should always prefer \mathbf {\mathit {RSC}} to \mathbf {\mathit {FAC}} blindly.
In some cases, one may want to establish full abstraction for reasons other than security, so there \mathbf {\mathit {FAC}} is preferable.
Also, when the target language is typed , , , or has abstractions simil... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/2034574.2034830",
"end": 490,
"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 I... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
0.002477773232385516,
-0.010704590938985348,
-0.03671453148126602,
0.03991904482245445,
0.0211345087736845,
-0.0328691191971302,
0.04016319662332535,
0.013512351550161839,
0.028550662100315094,
0.03479182720184326,
-0.021851709112524986,
-0.04373393580317497,
-0.025575043633580208,
0.03134... | |
cec6137d06d0a3883b026a9ff8fd771cc53b5bac | subsection | 291 | 510 | 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 equivalence and \mathbf {\mathit {FAC}} are def... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/2699503",
"end": 726,
"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.031019462272524834,
-0.00932262185961008,
-0.01850792206823826,
0.02316160500049591,
-0.0012873915256932378,
-0.032896190881729126,
0.01896566152572632,
0.031141525134444237,
0.05175504833459854,
0.04586546868085861,
-0.020155783742666245,
-0.03805338591337204,
-0.004340893588960171,
0.... | |
838e3062e9fb611fb74923208a3f0e5f6f516249 | subsection | 292 | 510 | Formalising Fully Abstract Compilation | \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... | |
dfdd40ab6d32250ad076ebd9732ae6fb8480be43 | subsection | 293 | 510 | Formalising Fully Abstract Compilation | 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": 1945,
"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.009964702650904655,
0.010132561437785625,
-0.043490663170814514,
0.026857390999794006,
0.00042679981561377645,
-0.005863609258085489,
0.030336644500494003,
-0.012902230024337769,
-0.016755349934101105,
0.02806292288005352,
-0.008408194407820702,
-0.027574606239795685,
-0.01309297792613506... | |
b2c3aa923f3c568e817752c42973180830953ad3 | subsection | 294 | 510 | Formalising Fully Abstract Compilation | 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": 2032,
"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.027313105762004852,
0.03598005697131157,
-0.05657932534813881,
0.00205229758284986,
-0.00390241714194417,
-0.028030265122652054,
0.024261360988020897,
-0.01010890118777752,
0.044280800968408585,
0.01010890118777752,
-0.012466372922062874,
-0.011032053269445896,
0.011917059309780598,
-0.... | |
fe8769d06c9c39ca18570f2949cd36f9520bafa1 | subsection | 295 | 510 | Formalising Fully Abstract Compilation | In contrast, \mathbf {\mathit {RSC}} does not require this unless the safety property(ies) of interest care about the size of the code (which is very unlikely in a security context, since security by code obscurity is a strongly discouraged practice).Example 8 (Wrappers for heap resources)
Assume that the \text{\textt... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/2699503",
"end": 1550,
"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.051512233912944794,
0.008887996897101402,
-0.05398409068584442,
0.029723292216658592,
-0.00953647680580616,
0.0052984668873250484,
0.029936909675598145,
0.011504805646836758,
0.014190278016030788,
0.026320677250623703,
-0.04009898006916046,
-0.022322986274957657,
0.013595202006399632,
-... | |
b10bdeb23614770cc37c88291226c2467e9df3cc | subsection | 296 | 510 | Formalising Fully Abstract Compilation | 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.016696011647582054,
0.01576506346464157,
-0.024250421673059464,
-0.005001935642212629,
-0.027455324307084084,
-0.020969213917851448,
0.006798969581723213,
-0.009133969433605671,
0.008141975849866867,
0.043220385909080505,
-0.01579558663070202,
-0.02246483415365219,
-0.014422057196497917,
... | |
5b7c6a1d959c0723648372ca65dbd66936106057 | subsection | 297 | 510 | Formalising Fully Abstract Compilation | (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.024061337113380432,
0.018477031961083412,
-0.012114586308598518,
-0.0197739340364933,
-0.022917013615369797,
-0.029203170910477638,
0.004966369830071926,
0.01911785453557968,
0.03982250392436981,
0.03350583091378212,
-0.02229144796729088,
-0.03741179406642914,
0.007285534869879484,
0.00... | |
0707db59965e8ec3fadf7ee0581ffa4ba65363e4 | subsection | 298 | 510 | Towards a Fully Abstract Compiler from | In this section, we describe what it would take to build a fully abstract compiler from \mathsf {{\color {RoyalBlue}{L^{U}}}} to \mathbf {{\color {RedOrange}{L^{P}}}}. Along the way, we note how this compiler would be less efficient than the \mathbf {\mathit {RSC}} compiler we described earlier. In fact, to get a fully... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05250263214111328,
0.017002306878566742,
-0.015613428317010403,
0.0072305588982999325,
-0.0023103447165340185,
-0.05473094433546066,
-0.030509524047374725,
-0.006223240867257118,
0.04081163927912712,
0.02912064641714096,
-0.004109399393200874,
-0.02860172465443611,
0.0036210028920322657,
... | |
763171a5d06f2656965a500f2017877c926df017 | subsection | 299 | 510 | Language Extensions to | This section lists the language extensions required for a fully-abstract compiler from \mathsf {{\color {RoyalBlue}{L^{U}}}} to \mathbf {{\color {RedOrange}{L^{P}}}}. It is not possible to motivate all the language changes before explaining the details of the compiler, so some of the justification is postponed to sec:f... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.06976102292537689,
-0.015426157973706722,
-0.02407762221992016,
0.029448550194501877,
-0.007507091388106346,
-0.0389087051153183,
0.011466624215245247,
-0.008704869076609612,
0.03692512586712837,
0.0027388676535338163,
-0.024718472734093666,
-0.017440255731344223,
-0.006744175683706999,
... | |
8c8295b6c7864f419426f3719e68a33427d2fc91 | subsection | 300 | 510 | The | The fully abstract compiler {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\fbox{$\mathsf {{\color {RoyalBlue}{\cdot }}}$}}}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathbf {{\color {RedOrange}{L^{P}}}}}}} is similar to the \mathbf {\mathit {RSC}} attaining compiler {\color {black}{\left.\mathsf {{\color ... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1016/j.tcs.2006.12.032",
"end": 1407,
"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.054042574018239975,
0.013167345896363258,
-0.022184614092111588,
0.042416248470544815,
0.02154379151761532,
-0.04958733916282654,
0.002824571216478944,
0.005462236236780882,
0.02520562708377838,
0.037533801048994064,
-0.012625699862837791,
-0.0017212529201060534,
0.012007765471935272,
0... | |
f90e72698f2e3efba1b1ba1ce2cf127b162350c3 | subsection | 301 | 510 | The | To implement lookup in \mathbf {{\color {RedOrange}{\overline{L}}}} we must compare capabilities too, for we rely on the newly added operation \mathbf {{\color {RedOrange}{eqcap}}}.
To ensure capabilities do not leak to the context, the second field of the pair is a constant capability \mathbf {{\color {RedOrange}{k_{c... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/2699503",
"end": 531,
"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.05097879469394684,
0.011242181062698364,
-0.01604718528687954,
0.023536887019872665,
0.0036781153175979853,
-0.0035770577378571033,
-0.0032738849986344576,
0.0032834187150001526,
0.024223316460847855,
0.014834493398666382,
-0.04023999348282814,
-0.028906287625432014,
0.011318451724946499,... | |
e7471c150fc74f27fb0e45d8e9d712a5d56f66fa | subsection | 302 | 510 | Determining when a Location is Passed to the Context. | A component-allocated location can be passed to the context not just as a function argument but on the heap.
So before passing control to the context the compiled code needs to scan the whole heap where a location can be passed and mask any component-allocated locations it finds.
Dually, when receiving control the comp... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.0005374952452257276,
0.00505922781303525,
-0.018115544691681862,
0.03732992708683014,
0.007771980948746204,
-0.03430812433362007,
0.009996362030506134,
0.0016158241778612137,
-0.0047501795925199986,
0.029119174927473068,
-0.0031458018347620964,
0.005414060316979885,
0.008485461585223675,
... | |
432a1e7a1c3d17479be675e42ed6c2265bbf4c9a | subsection | 303 | 510 | Enforcing the Masking of Locations | The functions \mathbf {{\color {RedOrange}{mask}}} and \mathbf {{\color {RedOrange}{unmask}}} are added by the compiler to the compiled code.
The first function takes a location (which intuitively contains a value \mathbf {{\color {RedOrange}{v}}}) and replaces (in \mathbf {{\color {RedOrange}{v}}}) any pair \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.045568402856588364,
0.006363705266267061,
-0.035404786467552185,
0.0014154284726828337,
-0.006607876159250736,
0.005986003205180168,
0.047491248697042465,
0.008881717920303345,
-0.001894232351332903,
-0.005837211385369301,
-0.007687569595873356,
-0.0068062650971114635,
-0.0061920224688947... | |
36c4e1eae375f57365bc9c1017e0535fd4fcf317 | subsection | 304 | 510 | Letting the Context use Masked Locations | Masked locations cannot be used directly by the context for reading and writing.
Thus, compiled code must provide a \mathbf {{\color {RedOrange}{read}}} and a \mathbf {{\color {RedOrange}{write}}} function (both of which are public) that implement reading and writing for masked locations.As should be clear, code compil... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.020198294892907143,
0.015316531993448734,
-0.01601828634738922,
-0.00963385496288538,
0.005453845020383596,
-0.005816163029521704,
-0.015110583044588566,
0.021449247375130653,
0.00028341877623461187,
0.0013949257554486394,
-0.03112124092876911,
-0.024744438007473946,
0.011281449347734451,... | |
b57ae9430b31a1b40ea691c6fa90ad97de633de1 | subsection | 305 | 510 | Proving that | Using {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\fbox{$\mathsf {{\color {RoyalBlue}{\cdot }}}$}}}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathbf {{\color {RedOrange}{L^{P}}}}}}} as a concrete example, we now discuss why proving \mathbf {\mathit {FAC}} can be harder than proving \mathbf {\mathit {RSC... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05007009580731392,
0.021297333762049675,
-0.03000849299132824,
-0.024943511933088303,
-0.013341345824301243,
-0.012921806424856186,
-0.008444179780781269,
0.05251104757189751,
0.03981808200478554,
0.04497459903359413,
-0.015652624890208244,
-0.034020815044641495,
0.0033238944597542286,
... | |
0d75d878ce7452e09f9fdb55f05409f717a55dfa | subsection | 306 | 510 | Proving that | By unfolding the definition of \operatorname{\mathsf {{\color {RoyalBlue}{\operatorname{\mathrel {\operatorname{\mathrel {\lnot \simeq }}_{\mathit {ctx}}}}}}}} we see that, given a target context \mathbf {{\color {RedOrange}{\mathbb {C}}}} that distinguishes {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\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.03959035873413086,
0.023626010864973068,
-0.02612902596592903,
0.006677248049527407,
0.019505195319652557,
-0.021245095878839493,
-0.02571694366633892,
0.021290883421897888,
0.025900091975927353,
0.037728358060121536,
-0.010332564823329449,
-0.009813646785914898,
0.004876298829913139,
0... | |
5bc55224c5fcd168e32c5fe8aa1e660645be2ed4 | subsection | 307 | 510 | Proving that | So if we write \mathbf {{\color {RedOrange}{\mathsf {TR}^{}_{}\left(\mathbf {{\color {RedOrange}{C}}}\right)}}} to denote the traces of the component \mathbf {{\color {RedOrange}{C}}}, we can formally state full abstraction of the trace semantics as: \mathbf {{\color {RedOrange}{\mathsf {TR}^{}_{}\left({\color {black}{... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.045951273292303085,
0.026713373139500618,
-0.022441674023866653,
0.023296013474464417,
0.008223019540309906,
-0.034814342856407166,
-0.006712669041007757,
0.0380181185901165,
0.025141997262835503,
0.03228183835744858,
-0.004531051963567734,
-0.02064145728945732,
0.041588038206100464,
0.... | |
b5525cb31808adb5f212ccaba77caa69f6347adb | subsection | 308 | 510 | Proving that | 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... | |
ff141ed190f3fcb3754bfd48bf9b96ea36e9dd20 | subsection | 309 | 510 | Proving that | 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,
... | |
af324163d890e12bda4bc7d112269d12a43efed9 | subsection | 310 | 510 | Proving that | \\
{\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": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.02249000407755375,
0.027113119140267372,
-0.04317958652973175,
-0.015654508024454117,
0.014441512525081635,
0.01844668574631214,
0.01485347282141447,
0.024153105914592743,
-0.005191468168050051,
0.028440548107028008,
-0.017882147803902626,
-0.00620611198246479,
0.022764645516872406,
0.0... | |
2a1da6321d76b13a9fc6f55ab9feb4feeaf1b87c | subsection | 311 | 510 | Related Work | Recent work , presents new criteria for secure compilation that ensure preservation of subclasses of hyperproperties.
Hyperproperties are a formal representation of predicates on programs, i.e., they are predicates on sets of traces.
Hyperproperties capture many security-relevant properties including not just conventi... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.48550/arxiv.1710.07309",
"end": 118,
"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.02346055954694748,
-0.020224619656801224,
-0.039228130131959915,
0.05476674437522888,
-0.0014672388788312674,
-0.060292262583971024,
0.006826763041317463,
0.004250986035913229,
0.009013311937451363,
0.040907155722379684,
-0.040021851658821106,
0.003432461293414235,
-0.0009392046486027539,... | |
4de517b1c3cf03b60cba9bacf6f944e227dc6c85 | subsection | 312 | 510 | Related Work | In the last few steps of compilation, where the target languages are unlikely to be typed, one could establish robust safety preservation and combine the two properties (vertically) to get an end-to-end security guarantee.There are three other criteria for secure compilation that we would like to mention: securely comp... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1109/csf.2016.11",
"end": 448,
"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.01412605307996273,
0.01312685664743185,
-0.04176796227693558,
0.056077077984809875,
0.007707546930760145,
-0.024697711691260338,
0.04887675493955612,
-0.004233239684253931,
0.00729947816580534,
0.06230108439922333,
-0.016643114387989044,
-0.011090325191617012,
-0.0006435668328776956,
0.... | |
063a2b32fe1a2d3b6b9cd5fad085a3e1bd955d3d | subsection | 313 | 510 | Conclusion | This paper has examined robustly safe compilation (\mathbf {\mathit {RSC}}), a soundness criterion for compilers with direct relevance to security.
We have shown that the criterion is easily realizable and may lead to more efficient code than does fully abstract compilation.
We have also presented two techniques for es... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.006675236392766237,
0.019133133813738823,
-0.020841995254158974,
0.019957048818469048,
-0.005027406383305788,
-0.024946311488747597,
0.03817472234368324,
-0.020292717963457108,
0.04107368364930153,
0.0666455626487732,
-0.021482817828655243,
0.01283934060484171,
0.00955130998045206,
-0.0... | |
a0a5ce306f04c2c9251da5865f59e08de70b09a3 | subsection | 314 | 510 | The Untyped Source Language: | 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.040290456265211105,
0.024281105026602745,
-0.04062621295452118,
0.010789906606078148,
-0.014818952418863773,
0.005799384322017431,
0.0077261533588171005,
0.027547074481844902,
-0.0025887382216751575,
0.0018704921239987016,
0.011400368064641953,
-0.017840737476944923,
0.018725905567407608,... | |
1f2b35e7664ec8a99293811b6137f77ea3ed2529 | subsection | 315 | 510 | 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 {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.043121472001075745,
0.009391813538968563,
-0.02415473759174347,
-0.011337315663695335,
-0.010742221027612686,
-0.002388007938861847,
-0.005943316966295242,
0.05398576334118843,
0.01226810459047556,
0.028244106099009514,
-0.008750942535698414,
-0.009086636826395988,
-0.035461537539958954,
... | |
bdb775c39cb161fa4cd522234efeb0b16205905c | subsection | 316 | 510 | Dynamic Semantics | tr:us-aux-intern,tr:us-aux-in,tr:us-aux-out dictate the kind of a jump between two functions: if internal to the component/attacker, in(from the attacker to the component) or out(from the component to the attacker).
tr:plug-us tells how to obtain a whole program from a component and an attacker.
tr:whole-us tells when ... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.0439174585044384,
0.022279182448983192,
-0.054904449731111526,
0.03265578672289848,
0.022859051823616028,
-0.009140568785369396,
-0.044497326016426086,
0.03128241375088692,
0.022965868934988976,
0.03924798592925072,
-0.022126585245132446,
0.004635137971490622,
0.019395096227526665,
0.02... | |
e35dc9e1a1d762543933e18c0c36a88c65c06f5a | subsection | 317 | 510 | Component Semantics | &\mathsf {{\color {RoyalBlue}{H\triangleright e \operatorname{\mathsf {{\color {RoyalBlue}{\ \hookrightarrow \!\!\!\!\rightarrow \ }}}}e^{\prime }}}}
&&\text{Expression $\mathsf {{\color {RoyalBlue}{e}}}$ reduces to $\mathsf {{\color {RoyalBlue}{e^{\prime }}}}$.}
\\
&\mathsf {{\color {RoyalBlue}{C, H \triangleright 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.07140442728996277,
0.04040147736668587,
-0.024564342573285103,
-0.01626434177160263,
-0.012442373670637608,
-0.016691546887159348,
-0.00942904595285654,
0.0463518463075161,
0.028165079653263092,
0.021619673818349838,
-0.0231911800801754,
0.008521233685314655,
-0.020490629598498344,
0.00... | |
bbd29177ebd574a2787823fa2769bcd250e69b5d | subsection | 318 | 510 | Monitor Semantics | Let {{\color {black}{\mathtt {reach}(}}\mathsf {{\color {RoyalBlue}{\ell _o}}},\mathsf {{\color {RoyalBlue}{H}}}{{\color {black}{)}}}} return a set of locations \mathsf {{\color {RoyalBlue}{\left\lbrace \ell \right\rbrace }}} in \mathsf {{\color {RoyalBlue}{H}}} such that it is possible to reach any \mathsf {{\color {R... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.03833870589733124,
0.013644427992403507,
-0.03791136294603348,
-0.005299807526171207,
-0.0015968101797625422,
-0.032111719250679016,
-0.03720930218696594,
-0.022191273048520088,
0.022649141028523445,
0.008729992434382439,
0.004063567146658897,
0.011957952752709389,
0.030280252918601036,
... | |
b54f127e2611c31cc761c0e3766510199b445043 | subsection | 319 | 510 | Monitor Semantics | 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 {black}... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.013109885156154633,
0.02493778057396412,
0.008676332421600819,
0.008134539239108562,
-0.0008231832762248814,
0.006043672561645508,
0.026952337473630905,
0.005437016021460295,
0.034674808382987976,
0.00001395023809891427,
-0.041206859052181244,
0.018131017684936523,
0.00373150990344584,
... | |
84e9e78d5843f010009d3ce8e7b963bc93b18a32 | subsection | 320 | 510 | Monitor Semantics | 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 \oper... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05848541483283043,
0.019952770322561264,
-0.017786644399166107,
-0.010128929279744625,
-0.018091732636094093,
-0.036000411957502365,
-0.027061326429247856,
0.0011621954618021846,
-0.004290303215384483,
0.033559706062078476,
0.006040747277438641,
0.017832407727837563,
0.019510392099618912,... | |
8a43718ec72a8ed7acf4bddd2021f40c2948ee6a | subsection | 321 | 510 | Operational Semantics of | \text{Helpers}{\color {RedOrange}{L^{P}}}-Jump-Internal\endcsname \begin{array}{c}\textsf {\scriptsize ({\mathbf {{\color {RedOrange}{L^{P}}}}-Jump-Internal})} \\ {
((\mathbf {{\color {RedOrange}{f^{\prime }}}}\in \mathbf {{\color {RedOrange}{\overline{I}}}} \wedge \mathbf {{\color {RedOrange}{f}}}\in \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.07484876364469528,
0.042369529604911804,
-0.01962796039879322,
-0.02489362470805645,
-0.0038385940715670586,
0.008280068635940552,
-0.005563290324062109,
0.02110845036804676,
-0.01918533816933632,
0.024557843804359436,
-0.007417720276862383,
0.013919672928750515,
-0.013301529921591282,
... | |
e4399a558c0c3320fcf6757346f5fa845e96cbbe | subsection | 322 | 510 | Safety, Attackers and Robust Safety | These properties hold for both languages are written in black and only once.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{the... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
0.014469629153609276,
0.001420647487975657,
-0.025735650211572647,
-0.012021156959235668,
0.025735650211572647,
-0.058305662125349045,
0.018962306901812553,
0.02954946830868721,
0.020747175440192223,
0.004046462010592222,
-0.025506820529699326,
0.002017510123550892,
-0.0066513000056147575,
... | |
7c5350a2d8a8a6290ef406cc456edbce94a0db0d | subsection | 323 | 510 | Monitor Agreement and Attacker for | 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 ,\sigma _0,\ell _{root},\sigma _c) \mathop {\raisebox {1mm}{\frown }}(\ell _{root} ; \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.01379504892975092,
-0.00667243916541338,
-0.01761005073785782,
-0.011185587383806705,
0.007759714964777231,
-0.03183238208293915,
-0.005478343460708857,
0.03384670242667198,
0.026460856199264526,
0.0009370599873363972,
-0.00026585799059830606,
-0.018922412768006325,
-0.02093673311173916,
... | |
fd56983d6ffd7439aa9eb14574f24758c6e0dab7 | subsection | 324 | 510 | Cross-language Relations | Assume a partial bijection \beta : \mathsf {{\color {RoyalBlue}{\ell }}}\times \mathbf {{\color {RedOrange}{n}}}\times \mathbf {{\color {RedOrange}{\eta }}} from source to target heap locations such thatif (\mathsf {{\color {RoyalBlue}{\ell _1}}},\mathbf {{\color {RedOrange}{n}}},\mathbf {{\color {RedOrange}{\eta }}})\... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.06366296857595444,
0.023515012115240097,
-0.020432576537132263,
0.03405938297510147,
-0.012337369844317436,
-0.01306219957768917,
0.00421164371073246,
0.004844916518777609,
0.07056029886007309,
0.0151527626439929,
-0.015053574927151203,
-0.012215293012559414,
-0.003736689453944564,
0.02... | |
5b30431d03ba31f05965ae31b9a2623332e07cd7 | subsection | 325 | 510 | Cross-language Relations | 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.05408914387226105,
0.025533616542816162,
-0.03023436665534973,
-0.019352436065673828,
0.005772917531430721,
0.007436494342982769,
-0.016681555658578873,
0.02171807363629341,
0.03153165057301521,
0.025197848677635193,
-0.0029761239420622587,
0.010462220758199692,
0.01447617169469595,
0.0... | |
4ce06936a3c44e8d8824908a889a72e46d2e99ad | subsection | 326 | 510 | Cross-language Relations | In these cases the bijection \beta is not needed as states do not have locations inside.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 {{\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.07502143830060959,
0.009385310113430023,
-0.04056285321712494,
-0.014230571687221527,
-0.017763415351510048,
0.0009919432923197746,
-0.011254741810262203,
0.05060436949133873,
0.04092910885810852,
0.008568864315748215,
-0.013246258720755577,
-0.02282995730638504,
0.012948675081133842,
0... | |
a47cf56a87ae4f8bace0612d0a7b17a28ef433cf | subsection | 327 | 510 | Cross-language Relations | A source heap \mathsf {{\color {RoyalBlue}{H}}} is related to a target heap \mathbf {{\color {RedOrange}{H}}} if for any location pointing to a value in the former, a related location points to a related value in the target (tr:hrel-i).
The base case (tr:hrel-b) considers that in the target heap we may have keys, which... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.01406086515635252,
-0.019744720309972763,
-0.023422060534358025,
0.017928937450051308,
0.004329647868871689,
-0.013099568895995617,
0.00810998398810625,
0.05908157303929329,
0.012664697133004665,
0.011772064492106438,
-0.009513781405985355,
-0.0073470501229166985,
-0.00612254161387682,
... | |
7bc817080a4ad60baa379169f20c92be0cf41fec | subsection | 328 | 510 | Cross-language Relations | Two states are related if their monitors are related and if their whole heap is related (tr:state-rel-whole).\mathsf {{\color {RoyalBlue}{\Omega }}}\operatorname{{\color {black}{\approx _{\beta }}}}\mathbf {{\color {RedOrange}{\Omega }}}\begin{array}{c}\textsf {\scriptsize ({Related states -- Whole})} \\ {
\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.05541684851050377,
0.016280226409435272,
-0.01798911578953266,
0.0017689678352326155,
-0.025892728939652443,
0.012503884732723236,
0.002208587247878313,
0.07653384655714035,
0.012557287700474262,
-0.003932734951376915,
-0.02363455481827259,
-0.0001684333838056773,
0.028089873492717743,
... | |
af9d5a7a83642c84947a88c1be55296aae8db1e6 | subsection | 329 | 510 | Correct and Robustly-safe Compilation | Consider a compiler to be a function of this form: {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{{S}}}}}_{}} : \mathsf {{\color {RoyalBlue}{C}}}\rightarrow \mathbf {{\color {RedOrange}{C}}}, taking a source component and producing a target component.
}\begin{}[Correc... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.06683488935232162,
0.021591637283563614,
-0.040039896965026855,
0.029358522966504097,
-0.00759522058069706,
-0.007248076144605875,
-0.022324074059724808,
0.03259345516562462,
0.05490226671099663,
0.00691619049757719,
-0.0006990578840486705,
-0.004665472079068422,
0.020523499697446823,
-... | |
8a9f53b20a55962e3c50baf286276ce42844cbc6 | subsection | 330 | 510 | Correct and Robustly-safe Compilation | \\
\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... | |
aec7ff4a9009ff3b651182e771ab923fe92d460d | subsection | 331 | 510 | Correct and Robustly-safe Compilation | \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.07725997269153595,
0.0355481319129467,
-0.005862390156835318,
-0.022656211629509926,
-0.016019543632864952,
-0.0005096694221720099,
0.017835091799497604,
0.036890722811222076,
0.04204748943448067,
0.019223453477025032,
-0.02023039571940899,
0.013738665729761124,
0.030238796025514603,
0.... | |
1955e51717b7d9fc7bb80a683e2c1fd80ce08f63 | subsection | 332 | 510 | Alternative definition for RSC | Definition 12 (Property-Free RSC)\vdash {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{{S}}}}}_{}}: \mathbf {\mathit {PF\text{-}RSC}} \mathrel {\overset{\mbox{[}0pt]{\mbox{\normalfont \tiny \sffamily def}}}{=}}&\ \forall \mathsf {{\color {RoyalBlue}{C}}}\\
\text{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.059248242527246475,
0.03119613789021969,
-0.04230709373950958,
-0.005849276203662157,
-0.006127812899649143,
-0.02347341552376747,
0.027365300804376602,
0.042276568710803986,
0.07216014713048935,
0.0011255944846197963,
-0.0179026760160923,
0.021016186103224754,
-0.005311280023306608,
0.... | |
e2cf90260e332a061cb3a90db4509c365953782d | subsection | 333 | 510 | Alternative definition for RSC | \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... | |
c626783f46836fde033e6c5959015d9fb791f769 | subsection | 334 | 510 | Alternative definition for RSC | 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.06275397539138794,
0.005062896758317947,
-0.02737855724990368,
0.03503967076539993,
0.0009748078882694244,
-0.013605342246592045,
-0.013292488642036915,
0.05503181740641594,
0.03259788081049919,
0.024448411539196968,
0.02765325829386711,
-0.023074904456734657,
0.008706503547728062,
0.00... | |
653aec93a9c445d3e09e563b584c49b380078535 | subsection | 335 | 510 | Alternative definition for RSC | 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.07346714287996292,
0.00258568930439651,
-0.02976212464272976,
0.003760309424251318,
-0.02048720233142376,
0.03554369509220123,
-0.016017545014619827,
0.04429995268583298,
0.059859853237867355,
0.006670163478702307,
-0.021555038169026375,
-0.036489494144916534,
-0.007585451472550631,
0.0... | |
adc10e353b919f3fbd9efa387bc0478681a3c09a | subsection | 336 | 510 | Optimisation | We could optimise tr:compup-deref as follows:rename the current expressions except dereferencing to \mathit {{\color {black}{b}}};
reform expressions both in \mathsf {{\color {RoyalBlue}{L^{\tau }}}} and \mathbf {{\color {RedOrange}{L^{P}}}} as \mathit {{\color {black}{e}}} ::= \mathit {{\color {black}{b}}} \mid \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.020001864060759544,
0.028530500829219818,
-0.01348714530467987,
0.03661668673157692,
-0.013761770911514759,
0.03277193382382393,
0.02354147657752037,
0.011335914954543114,
0.032253198325634,
0.038722146302461624,
-0.048181455582380295,
-0.016202883794903755,
-0.016248654574155807,
0.024... | |
6f114aa675791635fe4878ad4c1b5254b0fb0d5d | subsection | 337 | 510 | Properties of the | Theorem 7 (Compiler {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathbf {{\color {RedOrange}{L^{P}}}}}}} is \mathbf {\mathit {CC}} )
\vdash {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \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.03655257076025009,
0.03911552578210831,
-0.03704075515270233,
-0.009656835347414017,
-0.02706354856491089,
-0.023814093321561813,
-0.0236615352332592,
0.031975872814655304,
0.003981728572398424,
0.041556429117918015,
-0.002339837606996298,
-0.0008814914035610855,
-0.017238901928067207,
... | |
9cfe4eef77e92bc53faf4bad865ae411f30ad446 | subsection | 338 | 510 | Values Backtranslation | Here is how values are back translated.{\color {black}{\left\langle \!\left\langle {\cdot } \right\rangle \!\right\rangle ^{\mathbf {{\color {RedOrange}{L^{P}}}}}_{\mathsf {{\color {RoyalBlue}{L^{U}}}}}}}:\mathbf {{\color {RedOrange}{v}}}\rightarrow \mathsf {{\color {RoyalBlue}{v}}}{\color {black}{\left\langle \!\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.05683328956365585,
0.016360173001885414,
-0.03986266255378723,
0.015932856127619743,
-0.01317055057734251,
-0.024509737268090248,
0.019214047119021416,
0.05158338323235512,
0.03558948263525963,
0.03195727989077568,
-0.027684099972248077,
0.028416644781827927,
0.019122479483485222,
0.032... | |
52eb042bcc0e69d74d5737fd5526d3d8980baba7 | subsection | 339 | 510 | Values Backtranslation | 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.04498627409338951,
0.007126387674361467,
0.005665249191224575,
0.02554512396454811,
0.007988573983311653,
-0.015778768807649612,
0.0001568911538925022,
0.047733061015605927,
0.03274781256914139,
0.03164909780025482,
-0.027437355369329453,
0.006176456809043884,
0.02557564340531826,
0.024... | |
1f666a1577cc5f8c0814d6cfeebdbebb3246e499 | subsection | 340 | 510 | Values Backtranslation | This is captured in thm:action-det below.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 {Red... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.02956457994878292,
-0.014050040394067764,
-0.030647698789834976,
-0.0017085825093090534,
-0.02173866145312786,
0.003323726821690798,
-0.019404616206884384,
0.048023372888565063,
0.010739661753177643,
0.026330476626753807,
0.02265397273004055,
0.0057359556667506695,
-0.006254632491618395,
... | |
693c2500029187ca7f98772fe51700738b885fa6 | subsection | 341 | 510 | Values Backtranslation | \\
\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.07204050570726395,
0.04594108462333679,
-0.04514741525053978,
-0.03699707239866257,
-0.04154539108276367,
0.003979779779911041,
-0.01826959289610386,
0.04578845575451851,
0.033425573259592056,
0.015812279656529427,
0.012065257877111435,
0.001717067090794444,
0.0054602730087935925,
-0.00... | |
3d98aef13ca44aedb9721a797e19eec4744c03ee | subsection | 342 | 510 | Skeleton | {\color {black}{\left\langle \!\left\langle {\cdot } \right\rangle \!\right\rangle ^{\mathbf {{\color {RedOrange}{L^{P}}}}}_{\mathsf {{\color {RoyalBlue}{L^{U}}}}}}}:\mathbf {{\color {RedOrange}{I}}}\rightarrow \mathsf {{\color {RoyalBlue}{F}}}{\color {black}{\left\langle \!\left\langle {\mathbf {{\color {RedOrange}{f}... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.059035249054431915,
0.002919346559792757,
-0.025002267211675644,
-0.030829519033432007,
-0.017603792250156403,
0.017100391909480095,
0.018763141706585884,
0.01661224476993084,
-0.023431044071912766,
0.01740548387169838,
-0.029929498210549355,
0.014690167270600796,
0.002999433083459735,
... | |
44cbecffceca4d923cc4a5a42c53f44be6bef4ed | subsection | 343 | 510 | Skeleton | 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}{\left\langl... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.019877683371305466,
0.03176157921552658,
-0.033287111669778824,
0.017940256744623184,
-0.014065406285226345,
0.0056749796494841576,
0.03215821832418442,
0.000027531086743692867,
0.019252214580774307,
0.019847173243761063,
-0.000656455522403121,
0.051715537905693054,
-0.020899789407849312,... | |
9ddb6a40aa2cbbd24712fc418a384709637418da | subsection | 344 | 510 | 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 locations of such a list and .... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05080968514084816,
0.03488016128540039,
-0.022139595821499825,
-0.0003044480399694294,
-0.004058671649545431,
0.008132601156830788,
0.02244475856423378,
-0.017928341403603554,
0.013389037922024727,
-0.0011043095728382468,
-0.0265797208994627,
0.03179801255464554,
-0.004344761837273836,
... | |
dea654d24abd0e61229a6ae2648bf159daeaf2ed | subsection | 345 | 510 | Single Action Translation | 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 {Royal... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.054128196090459824,
0.019100479781627655,
-0.0190241988748312,
-0.0011413375614210963,
-0.00466451421380043,
0.028940582647919655,
0.04555433616042137,
0.027247169986367226,
0.027262425050139427,
-0.0039245993830263615,
-0.004511954262852669,
0.0002922472485806793,
0.027094610035419464,
... | |
a21a0b812406e248f0244579ce0e22a1d6fdf93f | subsection | 346 | 510 | Single Action Translation | Where \mathsf {{\color {RoyalBlue}{::}}} is a recursive function that starts from \mathsf {{\color {RoyalBlue}{\ell _{glob}}}} and looks for its last element (i.e., it performs second projections until it hits a \mathsf {{\color {RoyalBlue}{0}}}), then replaces that second projection with \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.07295122742652893,
0.008310030214488506,
-0.013827158138155937,
-0.027120154350996017,
-0.008859453722834587,
0.025395574048161507,
0.028875257819890976,
0.00914179626852274,
0.00876025203615427,
0.026433374732732773,
-0.008302399888634682,
-0.0017484257696196437,
0.003031367901712656,
... | |
8fcf13d210151caf4508564a16c23ea1ac20ddc0 | subsection | 347 | 510 | Single Action Translation | If it does not find an element for \mathsf {{\color {RoyalBlue}{n}}}, it gets stuckLemma 4 (\mathsf {{\color {RoyalBlue}{update(n,v)}}} never gets stuck)
\mathsf {{\color {RoyalBlue}{C;H\triangleright update(n,v)}}}\mathsf {{\color {RoyalBlue}{~\mathrel {\xrightarrow{}}~}}}\mathsf {{\color {RoyalBlue}{C;H^{\prime }\tr... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.01329951360821724,
0.026263296604156494,
-0.0261259526014328,
-0.013230841606855392,
-0.004120331257581711,
0.019487641751766205,
0.03415296971797943,
0.02221926860511303,
0.030810922384262085,
0.024035265669226646,
-0.015115511603653431,
0.022692343220114708,
0.0021460058633238077,
0.0... | |
379913ea8d452c18360e767e118c5047ae29303c | subsection | 348 | 510 | Single Action Translation | 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 {RedOrange... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.025692811235785484,
-0.003005631733685732,
-0.032131269574165344,
0.009230493567883968,
-0.015546897426247597,
-0.014974758960306644,
0.009962829761207104,
0.016767458990216255,
-0.0014894659398123622,
0.017545565962791443,
-0.031734589487314224,
0.0008348447154276073,
0.00036569155054166... | |
40cbb097af54ca19009dad7fe3db2edbd7a211f5 | subsection | 349 | 510 | Single Action Translation | 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 \!\left\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.027798110619187355,
0.021420717239379883,
-0.05989867076277733,
0.012602216564118862,
0.015089094638824463,
-0.005995970219373703,
0.006388835608959198,
0.03258878365159035,
-0.010153480805456638,
-0.004413064569234848,
-0.009184666909277439,
0.01800316758453846,
0.009993283078074455,
0... | |
6962326485c8ebde5e6376b63ed262d0a543c9da | subsection | 350 | 510 | Single Action Translation | 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 {RedOrange... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.028908871114253998,
0.02646801620721817,
-0.04552193731069565,
0.014553595334291458,
0.014278999529778957,
-0.02828340232372284,
0.018047068268060684,
0.03765018284320831,
0.011235558427870274,
0.025354376062750816,
-0.023233884945511818,
0.026605315506458282,
-0.008909119293093681,
0.0... | |
624ee07daf463a0746576de0228912b07deabccc | subsection | 351 | 510 | Single Action Translation | 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.05556179955601692,
-0.00747917965054512,
-0.009428114630281925,
0.03368491306900978,
0.0010783977340906858,
-0.017513714730739594,
0.03092360496520996,
-0.0016171198803931475,
-0.019908882677555084,
0.020625906065106392,
-0.0232346560806036,
0.005625593941658735,
-0.017361154779791832,
... | |
5a2e3e2246f58436c927c579abadb969917b9674 | subsection | 352 | 510 | Single Action Translation | 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 {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.023343626409769058,
0.01548613142222166,
-0.05431588739156723,
-0.005446846131235361,
-0.00304954731836915,
-0.01473089586943388,
0.01122172363102436,
-0.007842238061130047,
0.025723760947585106,
0.03359651193022728,
-0.0231757964938879,
0.031231636181473732,
0.015432731248438358,
0.054... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.