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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1bd4ccca436c9a5f536e27d7339850404384a1c5 | subsection | 21 | 33 | Gu-Luo-Sun-Wu's work on discrete uniformization theorem | Furthermore, \mathbf {F} defined on \mathbb {R}^n is
a C^1-extension of the curvature K defined on
the space of conformal factors \Omega ^{\mathbb {E}, \mathcal {T}}_{D}(d^{\prime }) for d^{\prime }\in \mathcal {D}(d).
Then we can extend the Euclidean discrete Laplace operator to be defined on \mathbb {R}^n, which is t... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.4310/jdg/1531188190",
"end": 1528,
"openalex_id": "https://openalex.org/W2962889517",
"raw": "X. D. Gu, F. Luo, J. Sun, T. Wu, A discrete uniformization theorem for polyhedral surfaces, J. Differential Geom. 109 (2018), no. 2, 223-256.",... | 1806.02166 | Combinatorial Calabi flow with surgery on surfaces | [
"Xiang Zhu",
"Xu Xu"
] | [
"math.GT",
"math.DG"
] | 2,018 | en | Mathematics | [
-0.023600980639457703,
0.0038578524254262447,
-0.058338817209005356,
-0.028955824673175812,
0.03630920127034187,
0.019970059394836426,
0.019924292340874672,
0.018139343708753586,
0.019558148458600044,
0.03707199916243553,
-0.0275065079331398,
0.03101537935435772,
0.009550235234200954,
0.02... | |
55dc20d10af44b145994de76a57a58c0dc2e14d3 | subsection | 22 | 33 | Euclidean combinatorial Calabi flow with surgery on surfaces | We can extend the definition of combinatorial Calabi flow to be defined on a conformal class of d as follows.Definition 3.4 Suppose (S, V) is a marked surface with a PL metric d_0.
The Euclidean combinatorial Calabi flow with surgery defined on the conformal class \mathcal {D}(d_0) is\begin{aligned}\left\lbrace
\begin... | {
"cite_spans": []
} | 1806.02166 | Combinatorial Calabi flow with surgery on surfaces | [
"Xiang Zhu",
"Xu Xu"
] | [
"math.GT",
"math.DG"
] | 2,018 | en | Mathematics | [
-0.006716334261000156,
0.001734385616146028,
-0.06773543357849121,
-0.011640120297670364,
0.01751357689499855,
0.027109429240226746,
-0.006357824895530939,
0.014866706915199757,
0.016827069222927094,
0.038108810782432556,
-0.014874335378408432,
0.010747660882771015,
0.04530951380729675,
0.... | |
a10e50fbe7b7622a1496f29b64e900d8d52e31e1 | subsection | 23 | 33 | Euclidean combinatorial Calabi flow with surgery on surfaces | For any K^*: V\rightarrow (-\infty , 2\pi ) with \sum _{v\in V}K^*(v)=2\pi \chi (S),
the combinatorial Calabi flow with surgery for K^* (\ref {Calabi flow with surgery with target})
exists for all time and converges exponentially fast
to a unique PL metric d^*\in \mathcal {D}(d_0) with combinatorial curvature K^*
after... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1016/j.jfa.2018.04.008",
"end": 1310,
"openalex_id": "https://openalex.org/W2963749434",
"raw": "H. Ge, X. Xu, On a combinatorial curvature for surfaces with inversive distance circle packing metrics. J. Funct. Anal. 275 (2018), no. 3, 5... | 1806.02166 | Combinatorial Calabi flow with surgery on surfaces | [
"Xiang Zhu",
"Xu Xu"
] | [
"math.GT",
"math.DG"
] | 2,018 | en | Mathematics | [
-0.022343497723340988,
0.0309817623347044,
-0.05421045422554016,
-0.02934873290359974,
-0.005318790208548307,
0.03119543008506298,
-0.0009099938906729221,
0.020313657820224762,
0.01903165504336357,
0.045877426862716675,
-0.0022912004496902227,
0.018650105223059654,
0.05363050103187561,
0.0... | |
6f7fb2225c00d9c4aee2ff33344d4ca465c760c9 | subsection | 24 | 33 | Euclidean combinatorial Calabi flow with surgery on surfaces | As \sum _{i=1}^nu_i is invariant along the flow and \psi (t)\ge 0, by the properness of W^*|_{\Sigma _0} on \Sigma _0,
we have the solution u(t) lies in a compact subset of \Sigma _0,
which implies that the solution of the combinatorial Calabi flow (REF ) exists for all time.By the C^1-smoothness of \mathbf {F} and the... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 1375,
"openalex_id": "",
"raw": "T. Wu, Finiteness of switches in discrete Yamabe flow, Master Thesis, Tsinghua University, Beijing, 2014.",
"source_ref_id": "1d3c72b610d55bdeb209921893c3412c4a4f294f",
"start": 1339
... | 1806.02166 | Combinatorial Calabi flow with surgery on surfaces | [
"Xiang Zhu",
"Xu Xu"
] | [
"math.GT",
"math.DG"
] | 2,018 | en | Mathematics | [
-0.026523495092988014,
0.015398277901113033,
-0.051520898938179016,
-0.02919415757060051,
0.017153285443782806,
0.0013153014006093144,
0.005608391482383013,
0.025073707103729248,
-0.004498159047216177,
0.05078837275505066,
-0.010995499789714813,
-0.0009299629018642008,
0.03821336850523949,
... | |
ecad1e69a8e04b01b2a7aa48ab089f0113313882 | subsection | 25 | 33 | Euclidean combinatorial Calabi flow with surgery on surfaces | This method ensures the long time existence of the extended combinatorial Yamabe flow and
was then used to study the combinatorial Ricci flow of inversive distance circle packing metrics , , , .
Comparing to Ge-Jiang's method to extend combinatorial curvature flow, the extension of Gu-Luo-Sun-Wu
has the following two a... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1016/j.jfa.2016.12.021",
"end": 194,
"openalex_id": "https://openalex.org/W2343016474",
"raw": "H. Ge, W. Jiang, On the deformation of inversive distance circle packings. arXiv:1604.08317 [math.GT]. To appear in Trans. Amer. Math. Soc.",... | 1806.02166 | Combinatorial Calabi flow with surgery on surfaces | [
"Xiang Zhu",
"Xu Xu"
] | [
"math.GT",
"math.DG"
] | 2,018 | en | Mathematics | [
-0.06543941050767899,
-0.022235358133912086,
-0.05970124900341034,
-0.007981532253324986,
-0.015390775166451931,
-0.03864099457859993,
-0.0011445791460573673,
0.006924704182893038,
-0.002739359624683857,
0.0358329601585865,
-0.038396816700696945,
-0.008431733585894108,
-0.0000150226014739018... | |
df6f0bba98063fc8edbd2f599f6de538cd66a72b | subsection | 26 | 33 | Hyperbolic combinatorial Calabi flow | In this section, we introduce the combinatorial Calabi flow
for piecewise hyperbolic metrics. To handle the singularities that may develop along the flow,
we do surgery by flipping again.
Then we prove the long time existence and convergence of the hyperbolic combinatorial Calabi flow with surgery.
As the results are p... | {
"cite_spans": []
} | 1806.02166 | Combinatorial Calabi flow with surgery on surfaces | [
"Xiang Zhu",
"Xu Xu"
] | [
"math.GT",
"math.DG"
] | 2,018 | en | Mathematics | [
-0.01776626706123352,
0.01570574752986431,
-0.03486095741391182,
0.03904305398464203,
-0.02382572554051876,
0.024497302249073982,
0.013958120718598366,
0.03547148406505585,
-0.010653655044734478,
0.008799186907708645,
-0.03302938491106033,
0.005780905485153198,
0.06459350883960724,
0.04933... | |
eaad1b06130817991653285beb0e51f05a5e5401 | subsection | 27 | 33 | Hyperbolic combinatorial Calabi flow on triangulated surfaces | We define the combinatorial Calabi flow for PH metrics similar to the PL case.Definition 4.1 Suppose d_0 is a PH metric on a triangulated surface (S, V, \mathcal {T}).
The hyperbolic combinatorial Calabi flow on (S, V, \mathcal {T}) is defined as\begin{aligned}\left\lbrace
\begin{array}{ll}
\frac{du_i}{dt}=\Delta ^{\m... | {
"cite_spans": []
} | 1806.02166 | Combinatorial Calabi flow with surgery on surfaces | [
"Xiang Zhu",
"Xu Xu"
] | [
"math.GT",
"math.DG"
] | 2,018 | en | Mathematics | [
-0.003492742544040084,
-0.014886599034070969,
-0.07056446373462677,
0.012330468744039536,
-0.00612326804548502,
-0.01278065238147974,
0.007767584640532732,
0.010316085070371628,
0.010468689724802971,
0.02728573977947235,
-0.034641291946172714,
0.008935011923313141,
0.05615856871008873,
0.0... | |
146921b40b3970ae52e53b64f5a5ec2c5ab56c9f | subsection | 28 | 33 | Gu-Guo-Luo-Sun-Wu's work on discrete uniformization theorem | Definition 4.2 (, Definition 1)
Two PH metrics d, d^{\prime } on a closed marked surface
(S, V) are discrete conformal if there exists sequences of PH
metrics d_1=d, d_2, \cdots , d_m=d^{\prime } on (S, V) and triangulations \mathcal {T}_1, \cdots , \mathcal {T}_m
of (S, V) satisfying(a)
each \mathcal {T}_i is Delauna... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.4310/jdg/1531188190",
"end": 845,
"openalex_id": "https://openalex.org/W2962889517",
"raw": "X. D. Gu, R. Guo, F. Luo, J. Sun, T. Wu, A discrete uniformization theorem for polyhedral surfaces II, J. Differential Geom. 109 (2018), no. 3, ... | 1806.02166 | Combinatorial Calabi flow with surgery on surfaces | [
"Xiang Zhu",
"Xu Xu"
] | [
"math.GT",
"math.DG"
] | 2,018 | en | Mathematics | [
-0.01942199282348156,
-0.02175629511475563,
-0.06584864109754562,
-0.0221224594861269,
0.011694389395415783,
0.007624620106071234,
-0.01598919741809368,
-0.00644984096288681,
0.022839531302452087,
0.05040869489312172,
-0.019086342304944992,
0.010122932493686676,
0.023587118834257126,
0.039... | |
f54eeee4356f6f7905bff81545bb81c5a1dbbaf6 | subsection | 29 | 33 | Gu-Guo-Luo-Sun-Wu's work on discrete uniformization theorem | Furthermore, the discrete
Yamabe flow with surgery associated to curvature K^* having initial value d
converges to d^{\prime } linearly fast.Denote the Teichimüller space of all PH metrics on (S, V) by T_{hp}(S, V) and decorated
Teichimüller space of all equivalence class of decorated hyperbolic metrics on S-V by T_D(S... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.4310/jdg/1531188190",
"end": 540,
"openalex_id": "https://openalex.org/W2962889517",
"raw": "X. D. Gu, R. Guo, F. Luo, J. Sun, T. Wu, A discrete uniformization theorem for polyhedral surfaces II, J. Differential Geom. 109 (2018), no. 3, ... | 1806.02166 | Combinatorial Calabi flow with surgery on surfaces | [
"Xiang Zhu",
"Xu Xu"
] | [
"math.GT",
"math.DG"
] | 2,018 | en | Mathematics | [
-0.01253562979400158,
0.02099698968231678,
-0.04422185942530632,
-0.018296068534255028,
-0.0004213036154396832,
0.00411623390391469,
-0.014946621842682362,
-0.00413530832156539,
0.0510275699198246,
0.029206568375229836,
-0.00997204426676035,
-0.011421690694987774,
0.01878437027335167,
0.03... | |
6638b5e84fdaff1fd79448cf83f5d2be3bcfa455 | subsection | 30 | 33 | Gu-Guo-Luo-Sun-Wu's work on discrete uniformization theorem | Then we can extend the hyperbolic discrete Laplace operator to be defined on R^n, which is the total space of
the conformal factors for the conformal class \mathcal {D}(d).Definition 4.3 Suppose (S, V) is a marked surface with a PH metric d.
For a function f: V\rightarrow \mathbb {R} on the vertices, the hyperbolic dis... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.4310/jdg/1531188190",
"end": 1109,
"openalex_id": "https://openalex.org/W2962889517",
"raw": "X. D. Gu, R. Guo, F. Luo, J. Sun, T. Wu, A discrete uniformization theorem for polyhedral surfaces II, J. Differential Geom. 109 (2018), no. 3,... | 1806.02166 | Combinatorial Calabi flow with surgery on surfaces | [
"Xiang Zhu",
"Xu Xu"
] | [
"math.GT",
"math.DG"
] | 2,018 | en | Mathematics | [
-0.011404040269553661,
0.0006364713190123439,
-0.04683665931224823,
0.007361136376857758,
0.03505884110927582,
0.009100347757339478,
0.025920353829860687,
0.006911077070981264,
0.031076963990926743,
0.036889590322971344,
-0.04366336017847061,
0.009908928535878658,
0.019604269415140152,
0.0... | |
7a41241ed419485597b33688b843023df4de3412 | subsection | 31 | 33 | Hyperbolic combinatorial Calabi flow with surgery on surfaces | We can extend the definition of hyperbolic combinatorial Calabi flow to be defined on the discrete conformal class \mathcal {D}(d_0) as follows.Definition 4.4 Suppose (S, V) is a marked surface with a PH metric d_0.
The hyperbolic combinatorial Calabi flow with surgery defined on the conformal class \mathcal {D}(d_0) i... | {
"cite_spans": []
} | 1806.02166 | Combinatorial Calabi flow with surgery on surfaces | [
"Xiang Zhu",
"Xu Xu"
] | [
"math.GT",
"math.DG"
] | 2,018 | en | Mathematics | [
0.003546149702742696,
-0.0166033823043108,
-0.058905377984046936,
0.00782861653715372,
0.012002352625131607,
-0.002235657535493374,
-0.002317682607099414,
0.006149965804070234,
0.010193987749516964,
0.03784594312310219,
-0.020601622760295868,
0.0025141609366983175,
0.04251564294099808,
0.0... | |
c2f9baab7ebf6b4d8765d9ed4bd95dad3af0dc4f | subsection | 32 | 33 | Remarks and questions | We use the discrete uniformization theorems established in ,
to prove the long time existence and convergence of the combinatorial Calabi flow with surgery in
Theorem REF
and Theorem REF .
For the combinatorial Yamabe flow with surgery,
the long time existence and convergence were proved similarly , .
Similar results... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.4310/jdg/1531188190",
"end": 190,
"openalex_id": "https://openalex.org/W2962889517",
"raw": "X. D. Gu, R. Guo, F. Luo, J. Sun, T. Wu, A discrete uniformization theorem for polyhedral surfaces II, J. Differential Geom. 109 (2018), no. 3, ... | 1806.02166 | Combinatorial Calabi flow with surgery on surfaces | [
"Xiang Zhu",
"Xu Xu"
] | [
"math.GT",
"math.DG"
] | 2,018 | en | Mathematics | [
-0.012541363015770912,
0.017225302755832672,
-0.04748019576072693,
0.0041041686199605465,
-0.0034805333707481623,
-0.001876627211458981,
-0.007380637805908918,
0.026165980845689774,
0.004119425546377897,
0.03255872055888176,
-0.015432588756084442,
0.032650262117385864,
0.009833221323788166,
... | |
2e92f7309b6b7a8f3cbe2b6170d01e2e6d05ace7 | abstract | 0 | 19 | Abstract | The potential similarity of the powering mechanisms of relativistic SNe and
GRBs allowed us to make a prediction that relativistic SNe are born in
environments similar to those of GRBs, that is, ones which are rich in atomic
gas. Here we embark on testing this hypothesis by analysing the properties of
the host galaxy N... | {
"cite_spans": []
} | 10.1051/0004-6361/201732356 | 1808.00977 | Relativistic supernova 2009bb exploded close to an atomic gas cloud | [
"Michał J. Michałowski",
"G. Gentile",
"T. Kruhler",
"H. Kuncarayakti",
"P. Kamphuis",
"J. Hjorth",
"S. Berta",
"V. D'Elia",
"J. Elliott",
"L. Galbany",
"J. Greiner",
"L. K. Hunt",
"M. P. Koprowski",
"E. Le Floc'h",
"A. Nicuesa Guelbenzu",
"E. Palazzi",
"J. Rasmussen",
"A. Rossi",
... | [
"astro-ph.GA",
"astro-ph.HE"
] | 2,018 | en | Physics | [
-0.019717421382665634,
0.054757051169872284,
-0.03354403376579285,
-0.03827499598264694,
-0.013994486071169376,
-0.013994486071169376,
-0.02351745031774044,
0.023609017953276634,
0.007344434503465891,
0.030186578631401062,
-0.023151183500885963,
0.020923053845763206,
-0.03442918136715889,
... |
bbb1d88f51af77d4d26c7e60861cdcf8796dcdc9 | subsection | 1 | 19 | Introduction | The gas inflow from the intergalactic medium is predicted to be an important process providing the fuel for star formation (see e.g. , ). It has been studied mostly from indirect diagnostics because compiling a sample of galaxies for which this process can be observed directly is difficult.Based on the analysis of gas ... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 137,
"openalex_id": "",
"raw": "Sancisi R., Fraternali F., Oosterloo T., van der Hulst T., 2008, , 15, 189",
"source_ref_id": "24a7f6e125a27ca1e91b32705fa7bb1685d7b0cd",
"start": 0
},
{
"arxiv_id": "",
... | 10.1051/0004-6361/201732356 | 1808.00977 | Relativistic supernova 2009bb exploded close to an atomic gas cloud | [
"Michał J. Michałowski",
"G. Gentile",
"T. Kruhler",
"H. Kuncarayakti",
"P. Kamphuis",
"J. Hjorth",
"S. Berta",
"V. D'Elia",
"J. Elliott",
"L. Galbany",
"J. Greiner",
"L. K. Hunt",
"M. P. Koprowski",
"E. Le Floc'h",
"A. Nicuesa Guelbenzu",
"E. Palazzi",
"J. Rasmussen",
"A. Rossi",
... | [
"astro-ph.GA",
"astro-ph.HE"
] | 2,018 | en | Physics | [
-0.023603975772857666,
0.0374734103679657,
-0.03927384316921234,
0.0005616815760731697,
-0.01620389334857464,
0.005992541555315256,
-0.025267086923122406,
0.028578052297234535,
-0.010329600423574448,
0.02122374251484871,
-0.014937487430870533,
-0.0003478325088508427,
-0.010489808395504951,
... |
7faee6bd168036fdd58016635508e34cbb1fa194 | subsection | 2 | 19 | Radio | We performed radio observations with the Australia Telescope Compact Array (ATCA) using the Compact Array Broad-band Backend on 8 March 2016 (project no. C2700, PI: M. Michałowski).
The array was in the 6B configuration with baselines 214 – 5939 m.
The total integration time was \sim 6.5 hr.
Sources 1934-638 and 1018-4... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 182,
"openalex_id": "",
"raw": "Wilson W.E., Ferris R.H., Axtens P., et al., 2011, , 416, 832",
"source_ref_id": "2e6f8ad30220ce54fc49f724e5e0938a25f942d3",
"start": 0
},
{
"arxiv_id": "",
"doi": ""... | 10.1051/0004-6361/201732356 | 1808.00977 | Relativistic supernova 2009bb exploded close to an atomic gas cloud | [
"Michał J. Michałowski",
"G. Gentile",
"T. Kruhler",
"H. Kuncarayakti",
"P. Kamphuis",
"J. Hjorth",
"S. Berta",
"V. D'Elia",
"J. Elliott",
"L. Galbany",
"J. Greiner",
"L. K. Hunt",
"M. P. Koprowski",
"E. Le Floc'h",
"A. Nicuesa Guelbenzu",
"E. Palazzi",
"J. Rasmussen",
"A. Rossi",
... | [
"astro-ph.GA",
"astro-ph.HE"
] | 2,018 | en | Physics | [
0.010293065570294857,
-0.03171088173985481,
-0.02659868448972702,
0.013574027456343174,
0.033816803246736526,
-0.02783476933836937,
0.00863732397556305,
0.00826344732195139,
0.014039467088878155,
0.040012478828430176,
-0.0018245583632960916,
0.009438489563763142,
0.01941108889877796,
0.004... |
fbe346e461bee6a86b3f0a8e998282c7a35c6d8d | subsection | 3 | 19 | CO | We used the CO(1-0) and CO(2-1) data obtained with the Swedish European Southern Observatory (ESO) Submillimeter Telescope (SEST) by .
The beam sizes are 45 and 24^{\prime \prime }, respectively.
We estimated the molecular gas mass from the CO(1-0) line luminosity
assuming the Galactic CO-to-H_2 conversion factor \alph... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 134,
"openalex_id": "",
"raw": "Albrecht M., Krügel E., Chini R., 2007, , 462, 575",
"source_ref_id": "853a658c0a44eef914f8fe063ab905507c5b4fbd",
"start": 0
},
{
"arxiv_id": "",
"doi": "",
"en... | 10.1051/0004-6361/201732356 | 1808.00977 | Relativistic supernova 2009bb exploded close to an atomic gas cloud | [
"Michał J. Michałowski",
"G. Gentile",
"T. Kruhler",
"H. Kuncarayakti",
"P. Kamphuis",
"J. Hjorth",
"S. Berta",
"V. D'Elia",
"J. Elliott",
"L. Galbany",
"J. Greiner",
"L. K. Hunt",
"M. P. Koprowski",
"E. Le Floc'h",
"A. Nicuesa Guelbenzu",
"E. Palazzi",
"J. Rasmussen",
"A. Rossi",
... | [
"astro-ph.GA",
"astro-ph.HE"
] | 2,018 | en | Physics | [
-0.021273097023367882,
0.030887193977832794,
-0.04269879683852196,
-0.04568985104560852,
0.0016090258723124862,
-0.06665773689746857,
0.01825152337551117,
0.011720041744410992,
-0.019396059215068817,
0.03427501767873764,
-0.03253532573580742,
0.012269418686628342,
0.03007838875055313,
-0.0... |
9bc9fb0c8443b69105bc76423b4b430410979091 | subsection | 4 | 19 | Optical integral field spectroscopy | We obtained the observations of NGC 3278 using the Multi Unit Spectroscopic Explorer at the Very Large Telescope (VLT) on 15 May 2015 (proposal 095.D-0172(A), PI: H. Kuncarayakti, see for other results from this programme). The data acquisition and reduction was similar to that described in .
The total integration time... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 149,
"openalex_id": "",
"raw": "Bacon R., Accardo M., Adjali L., et al., 2010, , 7735, 773508",
"source_ref_id": "f23b7c8aa280508f39a6b4965ed2163acccac9fb",
"start": 0
},
{
"arxiv_id": "",
"doi": ""... | 10.1051/0004-6361/201732356 | 1808.00977 | Relativistic supernova 2009bb exploded close to an atomic gas cloud | [
"Michał J. Michałowski",
"G. Gentile",
"T. Kruhler",
"H. Kuncarayakti",
"P. Kamphuis",
"J. Hjorth",
"S. Berta",
"V. D'Elia",
"J. Elliott",
"L. Galbany",
"J. Greiner",
"L. K. Hunt",
"M. P. Koprowski",
"E. Le Floc'h",
"A. Nicuesa Guelbenzu",
"E. Palazzi",
"J. Rasmussen",
"A. Rossi",
... | [
"astro-ph.GA",
"astro-ph.HE"
] | 2,018 | en | Physics | [
-0.05362672731280327,
-0.007702928502112627,
-0.029133016243577003,
0.005169622600078583,
0.00477665476500988,
-0.040990717709064484,
-0.02510414458811283,
-0.033177148550748825,
0.017382141202688217,
0.03503897786140442,
0.0022090121638029814,
-0.013460095040500164,
0.027347493916749954,
... |
7e777c1db7885325fda446670eac8cfb4cac6195 | subsection | 5 | 19 | Broad-band photometry | We used the photometry for NGC 3278 listed in the NASA/IPAC Extragalactic Database (NED). This includes optical , near-infrared , , mid- and far-infrared , and radio , data. Additionally we used the 617 MHz flux reported in We also used the data from the Wide-field Infrared Survey Explorer (WISE; ). We used the fluxes ... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 174,
"openalex_id": "https://openalex.org/W1530452976",
"raw": "Lauberts A., Valentijn E.A., 1989, The surface photometry catalogue of the ESO-Uppsala galaxies, European Southern Observatory",
"source_ref_id": "e7b302001c42f... | 10.1051/0004-6361/201732356 | 1808.00977 | Relativistic supernova 2009bb exploded close to an atomic gas cloud | [
"Michał J. Michałowski",
"G. Gentile",
"T. Kruhler",
"H. Kuncarayakti",
"P. Kamphuis",
"J. Hjorth",
"S. Berta",
"V. D'Elia",
"J. Elliott",
"L. Galbany",
"J. Greiner",
"L. K. Hunt",
"M. P. Koprowski",
"E. Le Floc'h",
"A. Nicuesa Guelbenzu",
"E. Palazzi",
"J. Rasmussen",
"A. Rossi",
... | [
"astro-ph.GA",
"astro-ph.HE"
] | 2,018 | en | Physics | [
-0.07203317433595657,
0.0051697539165616035,
-0.03519247844815254,
-0.004147248808294535,
0.021686259657144547,
0.03751219063997269,
0.02910323441028595,
0.008096101693809032,
0.01403273455798626,
0.04505125805735588,
-0.016802653670310974,
-0.01657373458147049,
0.00443721329793334,
0.0380... |
95302e08096693b443512904aaf7d6cf6925b64c | subsection | 6 | 19 | SED modelling | For the host galaxy emission, we applied the spectral energy distribution (SED) fitting method detailed in , , , , , , which is based on 35 000 templates from the library of plus some templates from and , all of which were developed using Grasiladlibitum.oats.inaf.it/silva/grasil/grasil.html. . They are based on numeri... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 297,
"openalex_id": "",
"raw": "Michałowski M.J., Hjorth J., Castro Cerón J.M., Watson D., 2008, , 672, 817",
"source_ref_id": "a361aeff80f765dfd5050dbbca95b3015d189b18",
"start": 0
},
{
"arxiv_id": "",
... | 10.1051/0004-6361/201732356 | 1808.00977 | Relativistic supernova 2009bb exploded close to an atomic gas cloud | [
"Michał J. Michałowski",
"G. Gentile",
"T. Kruhler",
"H. Kuncarayakti",
"P. Kamphuis",
"J. Hjorth",
"S. Berta",
"V. D'Elia",
"J. Elliott",
"L. Galbany",
"J. Greiner",
"L. K. Hunt",
"M. P. Koprowski",
"E. Le Floc'h",
"A. Nicuesa Guelbenzu",
"E. Palazzi",
"J. Rasmussen",
"A. Rossi",
... | [
"astro-ph.GA",
"astro-ph.HE"
] | 2,018 | en | Physics | [
-0.06917091459035873,
-0.005093952175229788,
-0.00762375770136714,
-0.017262201756238937,
-0.01246205810457468,
-0.06721727550029755,
0.012759682722389698,
0.005387760698795319,
0.03168552741408348,
0.02344362810254097,
-0.02185629867017269,
0.014812526293098927,
-0.02187156118452549,
0.00... |
1ade57c60b894b51745f7a1d38220a7d3a97337f | subsection | 7 | 19 | Integrated stellar properties | The best-fit SED models are presented in Fig. REF compared with the host galaxies of GRB 980425 and 111005A . The derived galaxy properties are listed in Tables REF and REF . Our derived SFR is consistent with that reported in .In terms of stellar mass, NGC 3278 is a typical galaxy with \mbox{$M_*$}\sim 3\times 10^{10}... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 111,
"openalex_id": "",
"raw": "Michałowski M.J., Hunt L.K., Palazzi E., et al., 2014b, , 562, A70",
"source_ref_id": "005c24dd9f6844bb99ca580d7c175c09ca609cb4",
"start": 0
},
{
"arxiv_id": "",
"doi... | 10.1051/0004-6361/201732356 | 1808.00977 | Relativistic supernova 2009bb exploded close to an atomic gas cloud | [
"Michał J. Michałowski",
"G. Gentile",
"T. Kruhler",
"H. Kuncarayakti",
"P. Kamphuis",
"J. Hjorth",
"S. Berta",
"V. D'Elia",
"J. Elliott",
"L. Galbany",
"J. Greiner",
"L. K. Hunt",
"M. P. Koprowski",
"E. Le Floc'h",
"A. Nicuesa Guelbenzu",
"E. Palazzi",
"J. Rasmussen",
"A. Rossi",
... | [
"astro-ph.GA",
"astro-ph.HE"
] | 2,018 | en | Physics | [
-0.07256489992141724,
0.008872264064848423,
-0.021314796060323715,
-0.09203353524208069,
-0.006324253976345062,
0.007724133785814047,
-0.017164742574095726,
-0.006755279842764139,
0.008857007138431072,
0.024259502068161964,
-0.021345309913158417,
0.024579910561442375,
-0.005099835805594921,
... |
3be9e306cc6da5864abe94cac9ae1ac308a90abe | subsection | 8 | 19 | Gas properties | The Hi fluxes at each frequency element were determined by aperture photometry with the aperture radius of 80^{\prime \prime } for the entire galaxy and of 30^{\prime \prime } for the Hi peak.
When we, instead, fit a two-dimensional (2-D) Gaussian with the size of the beam at the position of the Hi peak, we obtained th... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 1063,
"openalex_id": "",
"raw": "Solomon P.M., Downes D., Radford S.J.E., Barrett J.W., 1997, , 478, 144",
"source_ref_id": "30aa25498939aa23d9c7caa37a6f9f27db363d08",
"start": 918
},
{
"arxiv_id": "",
... | 10.1051/0004-6361/201732356 | 1808.00977 | Relativistic supernova 2009bb exploded close to an atomic gas cloud | [
"Michał J. Michałowski",
"G. Gentile",
"T. Kruhler",
"H. Kuncarayakti",
"P. Kamphuis",
"J. Hjorth",
"S. Berta",
"V. D'Elia",
"J. Elliott",
"L. Galbany",
"J. Greiner",
"L. K. Hunt",
"M. P. Koprowski",
"E. Le Floc'h",
"A. Nicuesa Guelbenzu",
"E. Palazzi",
"J. Rasmussen",
"A. Rossi",
... | [
"astro-ph.GA",
"astro-ph.HE"
] | 2,018 | en | Physics | [
-0.0164633896201849,
-0.026579448953270912,
-0.03494083508849144,
0.011039167642593384,
-0.004802457522600889,
-0.00482153007760644,
-0.002097975928336382,
-0.006087944842875004,
0.040311653167009354,
0.04568247124552727,
0.003097375389188528,
0.005527213215827942,
0.042722418904304504,
0.... |
7c6bde68084edc9f4359f47b54e41ba9ac3236a3 | subsection | 9 | 19 | Gas properties | This is larger than the optical extent of the galaxy (diameter of \sim 60"\times 40"), so our observations are unlikely to resolve out a lot of Hi emission. Even if the atomic gas disk is a few times larger than the optical disk (which is not uncommon) and we do resolve out some of the extended emission, then our concl... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 588,
"openalex_id": "",
"raw": "Arabsalmani M., Roychowdhury S., Zwaan M.A., Kanekar N., Michałowski M.J., 2015, , 454, L51",
"source_ref_id": "a733958d37196a17278fe3caeb4b729d3cdcc4b4",
"start": 449
},
{
... | 10.1051/0004-6361/201732356 | 1808.00977 | Relativistic supernova 2009bb exploded close to an atomic gas cloud | [
"Michał J. Michałowski",
"G. Gentile",
"T. Kruhler",
"H. Kuncarayakti",
"P. Kamphuis",
"J. Hjorth",
"S. Berta",
"V. D'Elia",
"J. Elliott",
"L. Galbany",
"J. Greiner",
"L. K. Hunt",
"M. P. Koprowski",
"E. Le Floc'h",
"A. Nicuesa Guelbenzu",
"E. Palazzi",
"J. Rasmussen",
"A. Rossi",
... | [
"astro-ph.GA",
"astro-ph.HE"
] | 2,018 | en | Physics | [
-0.02177288755774498,
0.014433883130550385,
-0.052364785224199295,
-0.04769589751958847,
0.02175763063132763,
-0.006938486825674772,
-0.030622415244579315,
-0.011550158262252808,
0.01649368740618229,
0.03793090209364891,
-0.011656963266432285,
-0.004733733832836151,
0.007949316874146461,
0... |
a7180e32c715af69f5875c477e1fb15b8801aaa6 | subsection | 10 | 19 | Gas properties | This is one of the highest numbers among local spirals with \sim (48\pm 7)\,\mbox{$L_\odot $}/(\mbox{K\,km\,s$^{-1}$\,pc$^2$}) derived by .
Similarly, the relation between SFR, CO luminosity, and metallicity presented in , \log (\mbox{SFR}/\mbox{$L^{\prime }$}_{\rm CO}) =-2.25\times [12+\log (\mbox{O}/\mbox{H})]+11.31 ... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 139,
"openalex_id": "",
"raw": "Daddi E., Bournaud F., Walter F., et al., 2010, , 713, 686",
"source_ref_id": "65b71dbd73535a8d4b4dc7ffeb364bbb7ed1ebbb",
"start": 0
},
{
"arxiv_id": "",
"doi": "",
... | 10.1051/0004-6361/201732356 | 1808.00977 | Relativistic supernova 2009bb exploded close to an atomic gas cloud | [
"Michał J. Michałowski",
"G. Gentile",
"T. Kruhler",
"H. Kuncarayakti",
"P. Kamphuis",
"J. Hjorth",
"S. Berta",
"V. D'Elia",
"J. Elliott",
"L. Galbany",
"J. Greiner",
"L. K. Hunt",
"M. P. Koprowski",
"E. Le Floc'h",
"A. Nicuesa Guelbenzu",
"E. Palazzi",
"J. Rasmussen",
"A. Rossi",
... | [
"astro-ph.GA",
"astro-ph.HE"
] | 2,018 | en | Physics | [
-0.027783095836639404,
0.03089553490281105,
-0.0405227355659008,
-0.03002588264644146,
-0.02340432070195675,
0.004607630427926779,
-0.012732011266052723,
0.011664018034934998,
-0.015325711108744144,
0.027630524709820747,
0.004279603715986013,
0.03856983408331871,
-0.024853741750121117,
0.0... |
a1b4688722204e9a154ecb7baf5a77a75e53b7c8 | subsection | 11 | 19 | Resolved ISM and stellar properties | Figure REF shows the 1.4 Ghz continuum image from . The emission is lopsided and the peak of the emission is close to the position of SN 2009bb.Based on the MUSE observations, the distribution of H\alpha flux, equivalent width (EW), SFR, and the velocity field is shown in Fig. REF and the distribution of dust extinctio... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 52,
"openalex_id": "",
"raw": "Condon J.J., Helou G., Sanders D.B., Soifer B.T., 1996, , 103, 81",
"source_ref_id": "18eee2f863543f4f01f14aaedbddfc8670b1c327",
"start": 0
},
{
"arxiv_id": "",
"doi":... | 10.1051/0004-6361/201732356 | 1808.00977 | Relativistic supernova 2009bb exploded close to an atomic gas cloud | [
"Michał J. Michałowski",
"G. Gentile",
"T. Kruhler",
"H. Kuncarayakti",
"P. Kamphuis",
"J. Hjorth",
"S. Berta",
"V. D'Elia",
"J. Elliott",
"L. Galbany",
"J. Greiner",
"L. K. Hunt",
"M. P. Koprowski",
"E. Le Floc'h",
"A. Nicuesa Guelbenzu",
"E. Palazzi",
"J. Rasmussen",
"A. Rossi",
... | [
"astro-ph.GA",
"astro-ph.HE"
] | 2,018 | en | Physics | [
-0.04883655905723572,
-0.006821857299655676,
-0.053048714995384216,
-0.009874141775071621,
-0.01031672302633524,
0.004185446072369814,
-0.01150711439549923,
0.037939902395009995,
0.03845879063010216,
0.03720735386013985,
-0.01135450042784214,
0.0175201166421175,
0.013094303198158741,
0.036... |
84310869f7b1371d31443ebac4e01481178c6bc6 | subsection | 12 | 19 | Discussion | In summary, NGC 3278 has an enhanced SFR given its stellar mass (close to the starburst regime above the main sequence, Sect. REF ), low atomic and molecular gas masses given its SFR (Sect. REF ), and the SN region is one of the most star-forming regions (Figs. REF and REF ). The atomic gas distribution is not centred ... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 594,
"openalex_id": "",
"raw": "Michałowski M.J., Gentile G., Hjorth J., et al., 2015, , 582, A78",
"source_ref_id": "31e6bb3a8b3241516164e35c0ec5e945dac1ed78",
"start": 452
},
{
"arxiv_id": "",
"do... | 10.1051/0004-6361/201732356 | 1808.00977 | Relativistic supernova 2009bb exploded close to an atomic gas cloud | [
"Michał J. Michałowski",
"G. Gentile",
"T. Kruhler",
"H. Kuncarayakti",
"P. Kamphuis",
"J. Hjorth",
"S. Berta",
"V. D'Elia",
"J. Elliott",
"L. Galbany",
"J. Greiner",
"L. K. Hunt",
"M. P. Koprowski",
"E. Le Floc'h",
"A. Nicuesa Guelbenzu",
"E. Palazzi",
"J. Rasmussen",
"A. Rossi",
... | [
"astro-ph.GA",
"astro-ph.HE"
] | 2,018 | en | Physics | [
-0.01881599985063076,
0.01667955331504345,
-0.047551222145557404,
-0.03238244354724884,
0.006672583986073732,
0.022783689200878143,
-0.03235192224383354,
0.022936291992664337,
0.02432498335838318,
0.03290129452943802,
-0.021089790388941765,
0.005005391780287027,
-0.03378639370203018,
0.034... |
92ca8d2a1d7e50ea18dab7eea83204e297019a99 | subsection | 13 | 19 | Discussion | However, there is a growing sample of GRBs in solar or super-solar environments
, , , , , , , , , , which can be explained by recent overcoming of the observational bias against dust, resulting in the discovery of massive and metal-rich hosts , , , .
This metallicity information may mean that relativistic explosions si... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 250,
"openalex_id": "",
"raw": "Prochaska J.X., Sheffer Y., Perley D.A., et al., 2009, , 691, L27",
"source_ref_id": "e6e7ff6284e2c88e2d74f0729858569fb77ec6d0",
"start": 0
},
{
"arxiv_id": "",
"doi"... | 10.1051/0004-6361/201732356 | 1808.00977 | Relativistic supernova 2009bb exploded close to an atomic gas cloud | [
"Michał J. Michałowski",
"G. Gentile",
"T. Kruhler",
"H. Kuncarayakti",
"P. Kamphuis",
"J. Hjorth",
"S. Berta",
"V. D'Elia",
"J. Elliott",
"L. Galbany",
"J. Greiner",
"L. K. Hunt",
"M. P. Koprowski",
"E. Le Floc'h",
"A. Nicuesa Guelbenzu",
"E. Palazzi",
"J. Rasmussen",
"A. Rossi",
... | [
"astro-ph.GA",
"astro-ph.HE"
] | 2,018 | en | Physics | [
-0.03536815568804741,
0.024336587637662888,
-0.07574095577001572,
-0.02442813664674759,
0.00017892445612233132,
0.00046584728988818824,
-0.031095903366804123,
0.02638116665184498,
0.003789717797189951,
0.009177716448903084,
-0.025252070277929306,
0.004337100312113762,
-0.00651137251406908,
... |
7caa7043aea74975d94130e5c04d43c5e4c96dff | subsection | 14 | 19 | Discussion | However the existence of the galaxy group in the vicinity of NGC 3278 indicates that indeed there should be a significant supply of ambient intergalactic gas available for inflow onto this galaxy.The caveat of this work is that SN 2009bb was discovered in a galaxy-targeted survey. Such surveys were shown to result on a... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 388,
"openalex_id": "",
"raw": "Sanders N.E., Soderberg A.M., Levesque E.M., et al., 2012, , 758, 132",
"source_ref_id": "172be602c5dcb49e6e559045f467e9f0ab0bddae",
"start": 282
},
{
"arxiv_id": "",
... | 10.1051/0004-6361/201732356 | 1808.00977 | Relativistic supernova 2009bb exploded close to an atomic gas cloud | [
"Michał J. Michałowski",
"G. Gentile",
"T. Kruhler",
"H. Kuncarayakti",
"P. Kamphuis",
"J. Hjorth",
"S. Berta",
"V. D'Elia",
"J. Elliott",
"L. Galbany",
"J. Greiner",
"L. K. Hunt",
"M. P. Koprowski",
"E. Le Floc'h",
"A. Nicuesa Guelbenzu",
"E. Palazzi",
"J. Rasmussen",
"A. Rossi",
... | [
"astro-ph.GA",
"astro-ph.HE"
] | 2,018 | en | Physics | [
-0.043766528367996216,
0.0466354638338089,
-0.063849076628685,
0.0006962509942241013,
-0.014436240307986736,
-0.024446994066238403,
-0.014909309335052967,
-0.0032657033298164606,
-0.03570909425616264,
0.02279888279736042,
0.005634864326566458,
0.020158851519227028,
-0.02624770998954773,
0.... |
8cd51a3d68dc5c455802f333c86034bb55f6172c | subsection | 15 | 19 | Conclusions | We obtained 21 cm hydrogen line (Hi) and optical integral field unit spectroscopy observations of NGC 3278, the host galaxy of the relativistic SN 2009bb.
This is the first time the atomic gas properties of a relativistic SN host have been provided and the first time resolved 21 cm-hydrogen-line (Hi) information is ana... | {
"cite_spans": []
} | 10.1051/0004-6361/201732356 | 1808.00977 | Relativistic supernova 2009bb exploded close to an atomic gas cloud | [
"Michał J. Michałowski",
"G. Gentile",
"T. Kruhler",
"H. Kuncarayakti",
"P. Kamphuis",
"J. Hjorth",
"S. Berta",
"V. D'Elia",
"J. Elliott",
"L. Galbany",
"J. Greiner",
"L. K. Hunt",
"M. P. Koprowski",
"E. Le Floc'h",
"A. Nicuesa Guelbenzu",
"E. Palazzi",
"J. Rasmussen",
"A. Rossi",
... | [
"astro-ph.GA",
"astro-ph.HE"
] | 2,018 | en | Physics | [
-0.01487177424132824,
0.021533168852329254,
-0.042455900460481644,
-0.04630165547132492,
0.002878592349588871,
0.0017693138215690851,
-0.030537115409970284,
-0.0026687546633183956,
0.02400543913245201,
0.027088146656751633,
-0.022754043340682983,
-0.0010463272919878364,
0.0004709427012130618... |
7b8b162dced2560d937b470a79e77dbb2e3f4b1e | subsection | 16 | 19 | Conclusions | Based on observations collected at the European Organisation for Astronomical Research in the Southern Hemisphere under ESO programme(s) 095.D-0172(A). This publication makes use of data products from the Wide-field Infrared Survey Explorer, which is a joint project of the University of California, Los Angeles, and the... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 1002,
"openalex_id": "",
"raw": "Joye W.A., Mandel E., 2003, In: H. E. Payne, R. I. Jedrzejewski, & R. N. Hook (ed.) Astronomical Data Analysis Software and Systems XII, vol. 295 of Astronomical Society of the Pacific Conference S... | 10.1051/0004-6361/201732356 | 1808.00977 | Relativistic supernova 2009bb exploded close to an atomic gas cloud | [
"Michał J. Michałowski",
"G. Gentile",
"T. Kruhler",
"H. Kuncarayakti",
"P. Kamphuis",
"J. Hjorth",
"S. Berta",
"V. D'Elia",
"J. Elliott",
"L. Galbany",
"J. Greiner",
"L. K. Hunt",
"M. P. Koprowski",
"E. Le Floc'h",
"A. Nicuesa Guelbenzu",
"E. Palazzi",
"J. Rasmussen",
"A. Rossi",
... | [
"astro-ph.GA",
"astro-ph.HE"
] | 2,018 | en | Physics | [
-0.07159637659788132,
-0.0040589589625597,
-0.033661894500255585,
0.011047692969441414,
-0.0029793675057590008,
-0.043244700878858566,
0.01950131542980671,
-0.01615954004228115,
0.00816369615495205,
0.013100061565637589,
-0.03707996383309364,
0.011131619103252888,
-0.013985097408294678,
-0... |
46dedc4a9da4277e10a47e3188e8a825fc5f9cf3 | subsection | 17 | 19 | Long tables and additional figures | ccrcrrrrccccccc
Properties of star-forming regions derived from the MUSE data.RA Dec 1cx 1cy 1cdist_{\rm centre} 1cdist_{\rm centre}^{\rm deproj.} 1cH\alpha 1cH\alpha EW SFR \mbox{$M_*$} sSFR E(B-V) 3c12+\log (\mbox{O}/\mbox{H})(deg) (deg) 1c(pix) 1c(pix) 1c() 1c() 1c(Å) (Gyr^{-1}) (mag) D16 03N2 N2(1) (2) 1c(3) 1c(4) ... | {
"cite_spans": []
} | 10.1051/0004-6361/201732356 | 1808.00977 | Relativistic supernova 2009bb exploded close to an atomic gas cloud | [
"Michał J. Michałowski",
"G. Gentile",
"T. Kruhler",
"H. Kuncarayakti",
"P. Kamphuis",
"J. Hjorth",
"S. Berta",
"V. D'Elia",
"J. Elliott",
"L. Galbany",
"J. Greiner",
"L. K. Hunt",
"M. P. Koprowski",
"E. Le Floc'h",
"A. Nicuesa Guelbenzu",
"E. Palazzi",
"J. Rasmussen",
"A. Rossi",
... | [
"astro-ph.GA",
"astro-ph.HE"
] | 2,018 | en | Physics | [
-0.03827117756009102,
0.047976307570934296,
-0.0391562357544899,
-0.021104080602526665,
-0.012474754825234413,
-0.02034110017120838,
-0.04138414189219475,
0.006157264579087496,
0.035799115896224976,
0.02130245603621006,
-0.012436605989933014,
0.0130317322909832,
-0.02256900630891323,
0.002... |
449bb6fd1afd1b533392e187510f507c88cd7efc | subsection | 18 | 19 | Long tables and additional figures | The last row shows the sum of the individual regions for extensive properties (H\alpha flux and SFR) and the average for the intensive properties (equivalent width, extinction, and metallicities). (1) Right Ascension. (2) Declination. (3), (4) MUSE pixel position. (5) Distance from the galaxy centre. (6) Deprojected di... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 726,
"openalex_id": "",
"raw": "Dopita M.A., Kewley L.J., Sutherland R.S., Nicholls D.C., 2016, , 361, 61",
"source_ref_id": "82ec1c57ad4d9aa13ddd220fee20f5bd8ef5d59b",
"start": 665
},
{
"arxiv_id": "",
... | 10.1051/0004-6361/201732356 | 1808.00977 | Relativistic supernova 2009bb exploded close to an atomic gas cloud | [
"Michał J. Michałowski",
"G. Gentile",
"T. Kruhler",
"H. Kuncarayakti",
"P. Kamphuis",
"J. Hjorth",
"S. Berta",
"V. D'Elia",
"J. Elliott",
"L. Galbany",
"J. Greiner",
"L. K. Hunt",
"M. P. Koprowski",
"E. Le Floc'h",
"A. Nicuesa Guelbenzu",
"E. Palazzi",
"J. Rasmussen",
"A. Rossi",
... | [
"astro-ph.GA",
"astro-ph.HE"
] | 2,018 | en | Physics | [
-0.02505769208073616,
-0.03335938602685928,
-0.03845638409256935,
-0.007119009271264076,
-0.041264310479164124,
-0.016618652269244194,
-0.01342921331524849,
0.009965087287127972,
0.03711346164345741,
0.014711093157529831,
-0.03137552738189697,
0.019960694015026093,
0.00433397339656949,
0.0... |
2c519eca4b7b0bd10d116eb23b6046ea734b5e9b | abstract | 0 | 16 | Abstract | The rapid growth of brain-inspired computing coupled with the inefficiencies
in the CMOS implementations of neuromrphic systems has led to intense
exploration of efficient hardware implementations of the functional units of
the brain, namely, neurons and synapses. However, efforts have largely been
invested in implemen... | {
"cite_spans": []
} | 10.1038/s41598-018-31365-x | 1804.00267 | Toward Fast Neural Computing using All-Photonic Phase Change Spiking
Neurons | [
"Indranil Chakraborty",
"Gobinda Saha",
"Abhronil Sengupta",
"Kaushik Roy"
] | [
"cs.ET"
] | 2,018 | en | Computer Science | [
-0.01957711949944496,
-0.012817444279789925,
0.0008955044322647154,
0.017227254807949066,
-0.0006728204316459596,
-0.05654934048652649,
0.023391835391521454,
-0.0009188695694319904,
0.047302473336458206,
0.0505983866751194,
0.006225615739822388,
-0.016265947371721268,
0.003633516374975443,
... |
182b0a501cdb0ffceb00d3f8996196e660ae02e2 | subsection | 1 | 16 | Introduction | The recent advances in the field of neuromorphic computing largely rest on our understanding
of the human brain as researchers strive to comprehend the intricacies of its complex functionalities and emulate its unparalleled energy efficiency. Despite the obvious elusivenss of the brain, neuroscientific experiments have... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1113/jphysiol.1952.sp004764",
"end": 1619,
"openalex_id": "https://openalex.org/W1985940938",
"raw": "Hodgkin, A. L. & Huxley, A. F. A quantitative description of membrane current and its application to conduction and excitation in nerve... | 10.1038/s41598-018-31365-x | 1804.00267 | Toward Fast Neural Computing using All-Photonic Phase Change Spiking
Neurons | [
"Indranil Chakraborty",
"Gobinda Saha",
"Abhronil Sengupta",
"Kaushik Roy"
] | [
"cs.ET"
] | 2,018 | en | Computer Science | [
0.005703864153474569,
0.012498902156949043,
-0.05680209398269653,
0.0015928851207718253,
-0.0016243612626567483,
-0.05967119336128235,
0.030644439160823822,
0.015329849906265736,
0.04816426709294319,
0.051063891500234604,
0.007905288599431515,
0.003742803120985627,
-0.020358407869935036,
0... |
3c23dcb7ea58614300ce1d1d2639f5304bf4be1c | subsection | 2 | 16 | GST embedded Ring Resonator as a Integrate-Fire Neuron | The basic working principle of a ring resonator is necessary to be illustrated at first. A ring resonator is a structure with two rectangular waveguides and a ring waveguide (as shown in Fig. REF (a)). Wave entering through the `INPUT' port gets partially coupled to the ring waveguide and interferes constructively insi... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1063/1.4758996",
"end": 1763,
"openalex_id": "https://openalex.org/W3100469322",
"raw": "Pernice, W. H. & Bhaskaran, H. Photonic non-volatile memories using phase change materials. Applied Physics Letters 101, 171101 (2012).",
"sou... | 10.1038/s41598-018-31365-x | 1804.00267 | Toward Fast Neural Computing using All-Photonic Phase Change Spiking
Neurons | [
"Indranil Chakraborty",
"Gobinda Saha",
"Abhronil Sengupta",
"Kaushik Roy"
] | [
"cs.ET"
] | 2,018 | en | Computer Science | [
-0.01194505300372839,
0.017681119963526726,
-0.04790225625038147,
0.0018459149869158864,
0.019206669181585312,
-0.04131188243627548,
-0.03295186907052994,
0.020121999084949493,
-0.007818441838026047,
0.03107544407248497,
-0.011601804755628109,
0.02233404479920864,
0.00018831001943908632,
0... |
a8e2672d33ebe35dd75ca448cb1a56e347de67df | subsection | 3 | 16 | GST embedded Ring Resonator as a Integrate-Fire Neuron | \alpha and \theta can be expressed as:\alpha &= exp(-\frac{2\pi }{\lambda }[\kappa _{eff,wg}(2\pi R-L_{GST})+\kappa _{eff,GST}L_{GST}])\approx exp(-\frac{2\pi }{\lambda }\kappa _{eff,GST}L_{GST})&&\\
\theta &= \frac{2\pi }{\lambda }[n_{eff,wg}(2\pi R-L_{GST})+n_{eff,GST}L_{GST}].Here \kappa _{eff,GST} (\kappa _{eff,wg}... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1038/srep08660",
"end": 1073,
"openalex_id": "https://openalex.org/W2023046714",
"raw": "Chen, Y. et al. Engineering the phase front of light with phase-change material based planar lenses. Scientific Reports 5 (2015). URL https://doi.or... | 10.1038/s41598-018-31365-x | 1804.00267 | Toward Fast Neural Computing using All-Photonic Phase Change Spiking
Neurons | [
"Indranil Chakraborty",
"Gobinda Saha",
"Abhronil Sengupta",
"Kaushik Roy"
] | [
"cs.ET"
] | 2,018 | en | Computer Science | [
-0.015931054949760437,
-0.0035612164065241814,
-0.02987835742533207,
-0.003956059459596872,
0.021332964301109314,
-0.0614352747797966,
0.0017729784594848752,
0.023530350998044014,
0.012261114083230495,
0.020386867225170135,
0.014893400482833385,
0.05450740456581116,
-0.029679981991648674,
... |
f5287b2c83662f2fd6d1c0048b4aac0ecab59297 | subsection | 4 | 16 | GST embedded Ring Resonator as a Integrate-Fire Neuron | During the `write' phase, an off-resonance pulse is input which writes into the GST element, thereby reducing (increasing) its degree of crystallization p (amorphization (1-p)). During the `read' phase, as p reduces, `THROUGH' port transmission T_t decreases and `DROP' port transmission (T_d) increases. Thus, with inco... | {
"cite_spans": []
} | 10.1038/s41598-018-31365-x | 1804.00267 | Toward Fast Neural Computing using All-Photonic Phase Change Spiking
Neurons | [
"Indranil Chakraborty",
"Gobinda Saha",
"Abhronil Sengupta",
"Kaushik Roy"
] | [
"cs.ET"
] | 2,018 | en | Computer Science | [
-0.012652515433728695,
0.0024038252886384726,
-0.0226341150701046,
-0.010279214940965176,
0.016010239720344543,
-0.03946852311491966,
-0.0024477047845721245,
0.012263325043022633,
0.026205511763691902,
0.03669076785445213,
0.016391798853874207,
0.023397233337163925,
0.0035294261761009693,
... |
fb62e2a8ad47a057a30dde55e7604d60ceee8e48 | subsection | 5 | 16 | GST embedded Ring Resonator as a Integrate-Fire Neuron | However, when the membrane potential integrates, on incidence of several `write' pulse, enough to the cross the threshold, P_{amp} is ensured to be high enough to amorphize the GST on the rectangular waveguide and a spike is transmitted. Once the neuron fires, a `RESET' pulse is passed to reset the states of the device... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1063/1.2359354",
"end": 795,
"openalex_id": "https://openalex.org/W1913679265",
"raw": "Lyeo, H.-K. et al. Thermal conductivity of phase-change material Ge2Sb2Te5. Applied Physics Letters 89, 151904 (2006).",
"source_ref_id": "fb5c... | 10.1038/s41598-018-31365-x | 1804.00267 | Toward Fast Neural Computing using All-Photonic Phase Change Spiking
Neurons | [
"Indranil Chakraborty",
"Gobinda Saha",
"Abhronil Sengupta",
"Kaushik Roy"
] | [
"cs.ET"
] | 2,018 | en | Computer Science | [
-0.024170054122805595,
-0.015731897205114365,
0.0031871970277279615,
-0.013008189387619495,
-0.0214539747685194,
-0.06811560690402985,
-0.00645831786096096,
-0.0027370601892471313,
0.02618422545492649,
0.011657779105007648,
0.0038128108717501163,
0.03970358520746231,
-0.008346603251993656,
... |
1a413da549b2eaff9b7684b7e5bba504bc8fab8e | subsection | 6 | 16 | Results | The `write' operation of the spiking neuron is investigated using the modal profiles of the incident EM waves and the resulting temperature profiles in the GST-Si-SiO2 stack. The `read' operation, on the other hand, is explored from the point of view of the entire GST-ring resonator system.
The modal profile of input E... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 395,
"openalex_id": "",
"raw": "Comsol. Multiphysics Reference Guide for COMSOL 4.2 (2011). URL www.comsol.com.",
"source_ref_id": "adbf74620eb5e9cea7c8514258ee53df10d06557",
"start": 292
},
{
"arxiv_id":... | 10.1038/s41598-018-31365-x | 1804.00267 | Toward Fast Neural Computing using All-Photonic Phase Change Spiking
Neurons | [
"Indranil Chakraborty",
"Gobinda Saha",
"Abhronil Sengupta",
"Kaushik Roy"
] | [
"cs.ET"
] | 2,018 | en | Computer Science | [
-0.023274365812540054,
-0.05585847795009613,
-0.006913631223142147,
0.008592437952756882,
0.011560873128473759,
-0.04758653789758682,
0.017429066821932793,
-0.002413284732028842,
0.019932014867663383,
0.034736037254333496,
0.015086367726325989,
0.0004425944935064763,
-0.0022663890849798918,
... |
2577d6a965625595f3a21f84b867e502ae71efba | subsection | 7 | 16 | Phase change dynamics of GST | The electromagnetic power absorption and subsequent temperature rise in GST is analyzed in detail using Finite Element Method (FEM) simulations in COMSOL Multiphysics. Firstly, to validate our simulation framework we simulated a GST embedded Si3N4-SiO2 ridge-waveguide system and compared its transient response of tempe... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1038/nphoton.2015.182",
"end": 390,
"openalex_id": "https://openalex.org/W2200176946",
"raw": "Rios, C. et al. Integrated all-photonic non-volatile multi-level memory. Nature Photonics 9, 725–732 (2015). URL https://doi.org/10.1038%2Fnph... | 10.1038/s41598-018-31365-x | 1804.00267 | Toward Fast Neural Computing using All-Photonic Phase Change Spiking
Neurons | [
"Indranil Chakraborty",
"Gobinda Saha",
"Abhronil Sengupta",
"Kaushik Roy"
] | [
"cs.ET"
] | 2,018 | en | Computer Science | [
-0.009889045730233192,
-0.0046621966175735,
-0.046545661985874176,
-0.017137959599494934,
0.011529590003192425,
-0.0976085439324379,
0.009492263197898865,
-0.0015489786164835095,
-0.0012094242265447974,
0.020098568871617317,
0.03394018113613129,
0.039128877222537994,
-0.014261285774409771,
... |
e3edbf1cab24d5999e8077b92eedb46fcca0b26c | subsection | 8 | 16 | Phase change dynamics of GST | Thus, we choose a input power range (26mW to 12mW) for the operation of the proposed all-photonic spiking neuron. | {
"cite_spans": []
} | 10.1038/s41598-018-31365-x | 1804.00267 | Toward Fast Neural Computing using All-Photonic Phase Change Spiking
Neurons | [
"Indranil Chakraborty",
"Gobinda Saha",
"Abhronil Sengupta",
"Kaushik Roy"
] | [
"cs.ET"
] | 2,018 | en | Computer Science | [
-0.008215409703552723,
-0.005747735500335693,
-0.02636254020035267,
0.006132951937615871,
-0.01868872158229351,
-0.09959181398153305,
0.0072046928107738495,
-0.01024447102099657,
0.04476139694452286,
0.018078478053212166,
0.025889599695801735,
0.03212934359908104,
-0.022197624668478966,
-0... |
15430a08f252bc36a77dc2e58443282c4a8402b5 | subsection | 9 | 16 | Optical response of ring resonator | The `read' operation of the spiking neuron concerns with the optical response of the ring resonator or more precisely, the transmission characteristics at the `THROUGH' and `DROP' ports of the device. FDTD simulations were performed in Lumerical. Inc on a ring resonator with Si waveguides and SiO2 substrate with a patc... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 1847,
"openalex_id": "",
"raw": "Stegmaier, M., Rios, C., Bhaskaran, H., Wright, C. D. & Pernice, W. H. P. Nonvolatile all-optical 1\\times 2 switch for chipscale photonic networks. Advanced Optical Materials 5, 1600346 (2016). UR... | 10.1038/s41598-018-31365-x | 1804.00267 | Toward Fast Neural Computing using All-Photonic Phase Change Spiking
Neurons | [
"Indranil Chakraborty",
"Gobinda Saha",
"Abhronil Sengupta",
"Kaushik Roy"
] | [
"cs.ET"
] | 2,018 | en | Computer Science | [
-0.028998298570513725,
-0.03397379443049431,
-0.02947142906486988,
-0.023122327402234077,
0.0006233680178411305,
-0.033027537167072296,
-0.036873627454042435,
0.0026327401865273714,
0.022313427180051804,
0.03021927922964096,
0.008501079864799976,
0.01346894633024931,
-0.012911873869597912,
... |
1d8abaf2d9aaae07bbdaad1dd04b75eace8b25ee | subsection | 10 | 16 | Spiking Neural network inferencing framework | A neural network is comprised of multiple layers of neurons connected through synapses. The operation of any layer in a neural network involves computing the dot-product of the inputs and weights of the synapses, which gets transferred through the neuron to the next layer. To that effect, the synaptic network can be re... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1126/sciadv.1700160",
"end": 674,
"openalex_id": "https://openalex.org/W2758404936",
"raw": "Cheng, Z., Ríos, C., Pernice, W. H., Wright, C. D. & Bhaskaran, H. On-chip photonic synapse. Science advances 3, e1700160 (2017).",
"sourc... | 10.1038/s41598-018-31365-x | 1804.00267 | Toward Fast Neural Computing using All-Photonic Phase Change Spiking
Neurons | [
"Indranil Chakraborty",
"Gobinda Saha",
"Abhronil Sengupta",
"Kaushik Roy"
] | [
"cs.ET"
] | 2,018 | en | Computer Science | [
0.023300614207983017,
-0.0377814806997776,
-0.03961256891489029,
-0.007873685099184513,
-0.009285150095820427,
-0.04547205567359924,
0.00473031448200345,
0.00540552893653512,
0.006836067419499159,
0.023605795577168465,
0.00043464533518999815,
0.029846759513020515,
-0.027634192258119583,
0.... |
736ef721b42bdc0dea6a640436ad2986b785cd7f | subsection | 11 | 16 | Spiking Neural network inferencing framework | Such a dot-product engine receives an N-dimensional input vector and provides an M-dimensional output vector which can be mathematically represented as:\begin{bmatrix}O_1\\O_2\\\vdots \\O_M\end{bmatrix} = \begin{bmatrix}I_1&I_2&\dots &I_N\end{bmatrix}\begin{bmatrix}w_{11} & w_{12} & \dots & w_{1M}\\w_{21} & w_{22}& \do... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 1648,
"openalex_id": "https://openalex.org/W2187281534",
"raw": "Palm, R. B. Prediction as a candidate for learning deep hierarchical models of data. Technical University of Denmark 5 (2012).",
"source_ref_id": "7e6b9b742cba... | 10.1038/s41598-018-31365-x | 1804.00267 | Toward Fast Neural Computing using All-Photonic Phase Change Spiking
Neurons | [
"Indranil Chakraborty",
"Gobinda Saha",
"Abhronil Sengupta",
"Kaushik Roy"
] | [
"cs.ET"
] | 2,018 | en | Computer Science | [
0.005730280186980963,
-0.03485475480556488,
-0.003971518948674202,
-0.0016862741904333234,
-0.007981189526617527,
-0.015069644898176193,
0.006333066150546074,
0.023928306996822357,
0.019136542454361916,
0.04062318429350853,
0.015542717650532722,
0.027880750596523285,
0.0030368196312338114,
... |
c33a69314d055dd5a2aa8bad7755555e50385802 | subsection | 12 | 16 | Spiking Neural network inferencing framework | This device to system level analysis helps us validate the operation of the proposed integrate-and-fire neuron. The accuracy of recognition was calculated to be 98.06% after 25 time-steps on the testing set. The accuracy suffers a 0.24% degradation with respect to the testing accuracy (98.3%) of a SNN based on an ideal... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 595,
"openalex_id": "",
"raw": "Chakraborty, I., Roy, D. & Roy, K. Technology aware training in memristive neuromorphic systems based on non-ideal synaptic crossbars. arXiv preprint arXiv:1711.08889 (2017).",
"source_ref_id"... | 10.1038/s41598-018-31365-x | 1804.00267 | Toward Fast Neural Computing using All-Photonic Phase Change Spiking
Neurons | [
"Indranil Chakraborty",
"Gobinda Saha",
"Abhronil Sengupta",
"Kaushik Roy"
] | [
"cs.ET"
] | 2,018 | en | Computer Science | [
-0.01948796771466732,
-0.008698622696101665,
-0.023593107238411903,
-0.010178915224969387,
-0.017183596268296242,
-0.05182547867298126,
0.022448550909757614,
-0.01288006640970707,
0.015550696291029453,
0.03809081017971039,
0.020495176315307617,
0.008484972640872002,
0.009103032760322094,
0... |
409f395e798e90c16681cfee4d4ef27d2370ff11 | subsection | 13 | 16 | Discussion | Neuromorphic engineering has evolved heavily from its dawn as researchers have explored various kinds of technologies to mimic the functionality of the brain on an energy-efficient hardware platform. In the electrical domain, such technologies have been demonstrated to possess limitations such as speed, energy, process... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1109/ted.2012.2227969",
"end": 645,
"openalex_id": "https://openalex.org/W2093320793",
"raw": "Rajendran, B. et al. Specifications of nanoscale devices and circuits for neuromorphic computational systems. IEEE Transactions on Electron De... | 10.1038/s41598-018-31365-x | 1804.00267 | Toward Fast Neural Computing using All-Photonic Phase Change Spiking
Neurons | [
"Indranil Chakraborty",
"Gobinda Saha",
"Abhronil Sengupta",
"Kaushik Roy"
] | [
"cs.ET"
] | 2,018 | en | Computer Science | [
0.0043405210599303246,
0.018307996913790703,
-0.014142928645014763,
0.0012539071030914783,
-0.002408646047115326,
-0.0887937918305397,
0.026928013190627098,
0.008642900735139847,
0.04802798107266426,
0.0261194109916687,
0.03432749584317207,
0.0004233724612277001,
-0.012800341472029686,
0.0... |
0de025aac17e39d731c9b10d788fad86ac42f9b6 | subsection | 14 | 16 | Author contributions statement | I.C. and K.R. conceived the study. I.C. conceived the necessary simulations, I.C. and G.S. conducted the simulations, I.C., G.S and A.S analyzed the results. All authors reviewed the manuscript. | {
"cite_spans": []
} | 10.1038/s41598-018-31365-x | 1804.00267 | Toward Fast Neural Computing using All-Photonic Phase Change Spiking
Neurons | [
"Indranil Chakraborty",
"Gobinda Saha",
"Abhronil Sengupta",
"Kaushik Roy"
] | [
"cs.ET"
] | 2,018 | en | Computer Science | [
-0.035150427371263504,
0.03277044743299484,
-0.027690114453434944,
-0.034723252058029175,
-0.017041243612766266,
-0.004710370674729347,
0.03606580197811127,
-0.006243624724447727,
0.03521145135164261,
0.0037682964466512203,
-0.015363055281341076,
-0.03411300107836723,
-0.013860313221812248,
... |
a66da9bf4f059a237870d8d9def4d1ba6521837c | subsection | 15 | 16 | Additional information | The authors declare no competing interests. | {
"cite_spans": []
} | 10.1038/s41598-018-31365-x | 1804.00267 | Toward Fast Neural Computing using All-Photonic Phase Change Spiking
Neurons | [
"Indranil Chakraborty",
"Gobinda Saha",
"Abhronil Sengupta",
"Kaushik Roy"
] | [
"cs.ET"
] | 2,018 | en | Computer Science | [
-0.024132870137691498,
-0.02434643544256687,
-0.044238511472940445,
-0.021798908710479736,
-0.018290337175130844,
-0.011563031934201717,
0.0348721519112587,
-0.046221617609262466,
0.07181893289089203,
-0.023843033239245415,
0.02138703316450119,
-0.01787845976650715,
-0.028144845739006996,
... |
cb744d847778ad4401cb96bd021f233d7641fde1 | abstract | 0 | 510 | Abstract | Secure compilers generate compiled code that withstands many target-level
attacks such as alteration of control flow, data leaks or memory corruption.
Many existing secure compilers are proven to be fully abstract, meaning that
they reflect and preserve observational equivalence. Fully abstract compilation
is a strong ... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.026872768998146057,
0.026643870398402214,
-0.02458377741277218,
0.041232381016016006,
0.011277101933956146,
-0.0668385773897171,
0.024736376479268074,
-0.01404678262770176,
0.031069256365299225,
0.040957704186439514,
-0.02771206758916378,
-0.0007672893116250634,
-0.03213745355606079,
0.... | |
155c446931da4a70aa858016f9e5fdd59ace3191 | subsection | 1 | 510 | Introduction | Low-level adversaries, such as those written in C or assembly can
attack co-linked code written in a high-level language in ways that
may not be feasible in the high-level language itself. For example,
such an adversary may manipulate or hijack control flow, cause buffer
overflows, or directly access private memory, al... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/1609956.1609960",
"end": 535,
"openalex_id": "https://openalex.org/W2159059513",
"raw": "Martín Abadi, Mihai Budiu, Úlfar Erlingsson, and Jay Ligatti. Control-flow integrity principles, implementations, and applications. ACM Trans. ... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.03924647718667984,
0.03146431967616081,
-0.030930250883102417,
0.04592997208237648,
0.0218663290143013,
-0.0545056015253067,
0.02502496913075447,
-0.0044632949866354465,
0.010238874703645706,
0.027039173990488052,
-0.0271459873765707,
-0.011047608219087124,
-0.022125734016299248,
-0.009... | |
b4d79c12831deb02373a923f41a4ea73a6724a23 | subsection | 2 | 510 | Introduction | Before explaining \mathbf {\mathit {RSC}}, we explain robust safety as a language property. | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.00511467969045043,
0.03075673244893551,
-0.006251275539398193,
-0.021099485456943512,
-0.02419651672244072,
-0.024379592388868332,
0.01806347817182541,
0.004748528357595205,
0.01824655383825302,
0.028193671256303787,
-0.02511189505457878,
0.00032419670606032014,
-0.022472552955150604,
0... | |
a85b1d15bee5d23db2d06285ea20a2dc49762bf1 | subsection | 3 | 510 | Robust Safety as a Language Property | Informally, a program property is a safety property if it encodes that “bad” sequences of events do not happen when the program executes , .
A program is robustly safe if it has relevant (specified) safety properties despite active attacks from adversaries , , .
As the name suggests, robust safety relies on the notions... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/353323.353382",
"end": 140,
"openalex_id": "https://openalex.org/W2036910349",
"raw": "Fred B. Schneider. Enforceable security policies. ACM Trans. Inf. Syst. Secur., 3(1):30–50, 2000.",
"source_ref_id": "e5f03163c6092878b28d7... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
0.015749616548419,
0.023563379421830177,
-0.020053289830684662,
0.010919428430497646,
-0.017291003838181496,
-0.051613569259643555,
0.03503984212875366,
0.028996385633945465,
0.02637145109474659,
0.005719155538827181,
-0.056283511221408844,
0.01169775240123272,
-0.038610976189374924,
-0.02... | |
2e13e667d88330903b2440b5d3c273b3759bd929 | subsection | 4 | 510 | Body | As mentioned, safety asserts that “no bad sequence of events happens”, so we can specify a safety property by the set of finite observations which characterise all bad sequences of events.
A whole program has a safety property if its behaviours exclude these bad observations.
Many security properties can be encoded as ... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.008131357841193676,
0.021754814311861992,
-0.05006963387131691,
0.0059574018232524395,
0.0006464658072218299,
-0.0424417182803154,
0.023371931165456772,
-0.0007375240093097091,
-0.008352567441761494,
0.033044129610061646,
-0.022166721522808075,
0.010106987319886684,
-0.004195353481918573,... | |
ec81e4a904820f7f178ad5fde7f329e9d3f0b94d | subsection | 5 | 510 | Body | A bad observation is one where the input is \text{\texttt {n}} (for some \text{\texttt {n}}) but the output is different from the \text{\texttt {n}}th Fibonacci number, e.g., input \text{\texttt {4}} and output \text{\texttt {5}} as well as input \text{\texttt {3}} and output \text{\texttt {6}} are bad observations.The... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.3233/jcs-1996-42-304",
"end": 971,
"openalex_id": "https://openalex.org/W2150174204",
"raw": "Dennis Volpano, Cynthia Irvine, and Geoffrey Smith. A sound type system for secure flow analysis. Journal of Computer Security, 4:167–187, 1996... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.027047019451856613,
-0.0009887112537398934,
-0.026101212948560715,
0.0356050468981266,
0.011418327689170837,
-0.04561229050159454,
0.030418362468481064,
-0.00957247894257307,
-0.02424011006951332,
0.04506311193108559,
-0.060440097004175186,
-0.0059799388982355595,
0.010831012390553951,
... | |
eec3c4ffa501068276a8e3f735135b942bb4da7d | subsection | 6 | 510 | Body | We believe that (with due effort) the ideas here will generalize to languages with larger gaps and more features.If the source language has a verification system that enforces robust safety, proving that a compiler attains \mathbf {\mathit {RSC}} may be simpler than that of sec:rsc-instance in some cases, as a backtran... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/2487726.2488368",
"end": 1915,
"openalex_id": "https://openalex.org/W2036329595",
"raw": "Frank McKeen, Ilya Alexandrovich, Alex Berenzon, Carlos V. Rozas, Hisham Shafi, Vedvyas Shanbhogue, and Uday R. Savagaonkar. Innovative instru... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.03352956473827362,
0.008062045089900494,
-0.001384353032335639,
-0.00013276250683702528,
-0.005125538446009159,
-0.03352956473827362,
-0.0018906143959611654,
0.01825973205268383,
0.0009009735658764839,
0.023141195997595787,
0.010479896329343319,
-0.01949535310268402,
0.002410223474726081,... | |
07cb9bcfabd2dd2b0285c6f2a808bd6bbf18da01 | subsection | 7 | 510 | Body | For simplicity, \mathit {{\color {CarnationPink}{L^{I}}}} supports only one
enclave. Generalizing this to many enclaves is straightforward, but not necessary for our purposes.To model the enclave, \mathit {{\color {CarnationPink}{L^{I}}}} components carry additional information
\mathit {{\color {CarnationPink}{\overlin... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04726984724402428,
0.0015382154379040003,
-0.0121073666960001,
0.001839564531110227,
-0.013358538039028645,
-0.054990485310554504,
-0.01998821832239628,
0.020903708413243294,
-0.03591775894165039,
0.02613726444542408,
-0.028929512947797775,
-0.0005450031603686512,
-0.009299861267209053,
... | |
b3a5ce3da3c777870c999d0a1d918bc42f785afa | subsection | 8 | 510 | Body | Omitted rules are as in \mathbf {{\color {RedOrange}{L^{P}}}} (fig:lp-sem) and \mathsf {{\color {RoyalBlue}{L^{\tau }}}} (fig:la-sem).]Attackers cannot have \mathsf {{\color {RoyalBlue}{\mathsf {{\color {RoyalBlue}{new}}}_{\tau }~t}}} terms where \mathsf {{\color {RoyalBlue}{\tau }}} is different from \mathsf {{\color ... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.024084800854325294,
0.03055625595152378,
-0.055373672395944595,
0.007868006825447083,
0.003968345001339912,
-0.011752406135201454,
0.008715095929801464,
0.03754664584994316,
-0.002749223494902253,
0.04151499271392822,
-0.007471172139048576,
0.006795790512114763,
-0.017079144716262817,
0... | |
b19a1f97d7f2d77c6842db5a9e6de2da71eafd93 | subsection | 9 | 510 | Body | To avoid giving the false impression that \mathbf {\mathit {RSC}} is only
useful for this kind of a target, we show here how to attain \mathbf {\mathit {RSC}} when the protection mechanism in the target is completely
different. We consider a new target language, \mathit {{\color {CarnationPink}{L^{I}}}}, which does not... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/2487726.2488368",
"end": 535,
"openalex_id": "https://openalex.org/W2036329595",
"raw": "Frank McKeen, Ilya Alexandrovich, Alex Berenzon, Carlos V. Rozas, Hisham Shafi, Vedvyas Shanbhogue, and Uday R. Savagaonkar. Innovative instruc... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.02663363143801689,
0.023689594119787216,
-0.014003249816596508,
-0.014186298474669456,
-0.01671847701072693,
-0.055951982736587524,
-0.007672804873436689,
-0.0007612741901539266,
0.0011898186057806015,
0.025977706536650658,
0.0005267426022328436,
-0.015574420802295208,
-0.0368233621120452... | |
9ea7b70a30e0ad1f2ebcb9484076bde308e81b51 | subsection | 10 | 510 | Body | By convention, non-negative
locations are outside the enclave (accessible from any function),
while negative locations are inside the enclave (accessible only from
functions in \mathit {{\color {CarnationPink}{\overline{E}}}}). The semantics are almost those of \mathbf {{\color {RedOrange}{L^{\pi }}}}, but
the expressi... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.049588195979595184,
-0.03103458322584629,
-0.01931650936603546,
0.012442823499441147,
-0.019347025081515312,
-0.05987202748656273,
-0.010947547852993011,
0.03671052306890488,
-0.011473946273326874,
0.04574320465326309,
-0.028288159519433975,
-0.01882825791835785,
0.0054051135666668415,
... | |
f864f50ea101d57ea72fbea02c49f85283ee553f | subsection | 11 | 510 | Robust Safety Preservation as a Compiler Property | A compiler attains robustly safe compilation or \mathbf {\mathit {RSC}} if it maps any source component that has a safety property robustly to a compiled component that has the same safety property robustly.
Thus, safety has to hold robustly in the target language, which often does not have the powerful abstractions (e... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/2784731.2784764",
"end": 749,
"openalex_id": "https://openalex.org/W2165594098",
"raw": "Georg Neis, Chung-Kil Hur, Jan-Oliver Kaiser, Craig McLaughlin, Derek Dreyer, and Viktor Vafeiadis. Pilsner: A compositionally verified compile... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.004925749264657497,
0.01663537323474884,
-0.037147246301174164,
0.01578071154654026,
0.01971825771033764,
-0.023686328902840614,
0.00517375348135829,
-0.018161553889513016,
0.003479692619293928,
0.045205481350421906,
-0.02006928063929081,
0.015009989961981773,
-0.005574376322329044,
-0.... | |
730ba6999961277cf5143918c0802e74b8e2e288 | subsection | 12 | 510 | Robust Safety Preservation as a Compiler Property | The second contribution of our paper is two proof techniques to establish \mathbf {\mathit {RSC}}.The first technique is an adaption of trace-based backtranslation, an existing technique for proving \mathbf {\mathit {FAC}} , , .
To illustrate this technique, we build a compiler from an untyped source language to an unt... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 228,
"openalex_id": "",
"raw": "Marco Patrignani, Dominique Devriese, and Frank Piessens. On Modular and Fully Abstract Compilation. In Proceedings of the 29th IEEE Computer Security Foundations Symposium, CSF 2016, 2016.",
... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.03466493636369705,
0.012282250449061394,
-0.015196423977613449,
0.016706911846995354,
0.015234568156301975,
-0.02241319976747036,
0.031369324773550034,
0.014242833480238914,
0.014738700352609158,
0.03823518007993698,
-0.022581031545996666,
-0.01690525934100151,
0.014158917590975761,
0.0... | |
1d94414b4113c378d778539c84561b6e6527931e | subsection | 13 | 510 | Robustly Safe Compilation | This section first discusses robust safety as a language (not a compiler) property (sec:rs) and then presents \mathbf {\mathit {RSC}} as a compiler property along with an informal discussion of techniques to prove it (sec:rsc-theory).Robustly-safe compilation ensures that robust safety properties and their meanings are... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.027808889746665955,
0.012928158976137638,
-0.013690882362425327,
0.02410205453634262,
-0.021905411034822464,
-0.02408679947257042,
0.010830669663846493,
0.006639505736529827,
0.018000269308686256,
0.004324640613049269,
-0.02664954960346222,
0.01563582569360733,
-0.007169598247855902,
-0... | |
432a89e694c3bbb9b3fac598e586e4d37c6acf56 | subsection | 14 | 510 | Robustly Safe Compilation | Next, we require a relation \mathsf {{\color {RoyalBlue}{M}}}\operatorname{{\color {black}{\approx }}}\mathbf {{\color {RedOrange}{M}}} between source and target monitors, which means that the source monitor \mathsf {{\color {RoyalBlue}{M}}} and the target monitor \mathbf {{\color {RedOrange}{M}}} code the same safety ... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.48550/arxiv.1710.07309",
"end": 754,
"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.060193631798028946,
0.0056164441630244255,
-0.036598458886146545,
-0.011881526559591293,
-0.004315352067351341,
-0.0021271519362926483,
-0.0382467657327652,
-0.0051662130281329155,
0.044565264135599136,
0.006585585884749889,
-0.005898792762309313,
-0.0017303379718214273,
0.000598082609940... | |
a04e4d7749499e660c45522f8e09ea8977938696 | subsection | 15 | 510 | Robustly Safe Compilation | \begin{}[Robustly Safe 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 {RoyalBlue}{C}}},\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.0680038183927536,
0.03329989314079285,
-0.020999383181333542,
0.014582057483494282,
-0.003111372934654355,
-0.011308534070849419,
0.005230769515037537,
-0.0013811367098242044,
0.02319699339568615,
0.013078831136226654,
-0.00882096216082573,
0.012254727073013783,
0.01361297257244587,
-0.... | |
65d0bdd61053b0cc7ff5504c509a2582085e18fc | subsection | 16 | 510 | Safety and Robust Safety | To explain robust safety, we first describe a general
imperative programming model that we use. Programmers write
components on which they want to enforce safety properties
robustly. A component is a list of function definitions that can be
linked with other components (the context) in order to obtain a runnable
whole ... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1007/s10817-009-9155-4",
"end": 1200,
"openalex_id": "https://openalex.org/W2148662736",
"raw": "Xavier Leroy. A formally verified compiler back-end. J. Autom. Reasoning, 43(4):363–446, 2009.",
"source_ref_id": "12ee2abc59335508506... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
0.007818746380507946,
0.0006154878647066653,
-0.031274985522031784,
0.015805309638381004,
0.013021073304116726,
-0.042228858917951584,
0.018047954887151718,
0.0039017449598759413,
-0.0054693082347512245,
0.030603716149926186,
-0.010702147148549557,
0.016110431402921677,
0.007826373912394047,... | |
6d5ca72c1f452303171d31cb363073500a0cbf02 | subsection | 17 | 510 | Safety and Robust Safety | For a sequence of actions \overline{\alpha }, {{\color {black}{\mathtt {relevant}(}}\overline{\alpha }{{\color {black}{)}}}} is the list of heaps \overline{H} mentioned in the actions of \overline{\alpha }.Next, we need a representation of safety properties. Generally,
properties are sets of traces, but safety properti... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/353323.353382",
"end": 394,
"openalex_id": "https://openalex.org/W2036910349",
"raw": "Fred B. Schneider. Enforceable security policies. ACM Trans. Inf. Syst. Secur., 3(1):30–50, 2000.",
"source_ref_id": "e5f03163c6092878b28d7... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.0263337604701519,
-0.0349997952580452,
-0.017606696113944054,
0.020688632503151894,
0.007258566562086344,
-0.027905240654945374,
0.007956579327583313,
0.057519279420375824,
0.03268071636557579,
0.00842192117124796,
-0.00008069576870184392,
0.016813326627016068,
0.011290255934000015,
-0.... | |
5bc604edf2c979a858e0a84f9edd75dc2c03e1e8 | subsection | 18 | 510 | Safety and Robust Safety | We assume determinism of the transition relation: for any \mathit {{\color {black}{\sigma _s}}} and (restricted heap) \mathit {{\color {black}{H}}}, there is at most one \mathit {{\color {black}{\sigma _f}}} such that (\mathit {{\color {black}{\sigma _s}}},\mathit {{\color {black}{H}}},\mathit {{\color {black}{\sigma _... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.004406704567372799,
-0.03967941552400589,
-0.018649326637387276,
0.03998464345932007,
-0.005280414596199989,
-0.009828286245465279,
-0.01770312525331974,
0.04270115867257118,
0.014711907133460045,
0.017519988119602203,
-0.011903825215995312,
0.0004723853780888021,
-0.007394106592983007,
... | |
fee8092a99664f454b80845b4ce614f41ba6f544 | subsection | 19 | 510 | Safety and Robust Safety | Note that we overload the \rightsquigarrow notation here to also denote an auxiliary relation, the monitor small-step semantics (tr:ms-t-s-b and tr:ms-t-s).\begin{array}{c}\textsf {\scriptsize ({Valid trace})} \\ {
\mathit {{\color {black}{M;{{\color {black}{\mathtt {relevant}(}}\mathit {{\color {black}{\overline{\alph... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.019107922911643982,
0.01745963655412197,
-0.03281312808394432,
0.01808537356555462,
0.010774915106594563,
-0.037025414407253265,
-0.0022816569544374943,
0.011667737737298012,
0.04181765764951706,
0.0218550693243742,
0.011522749438881874,
0.016940729692578316,
0.00956159271299839,
-0.003... | |
7452508ea1dc2d69749e1983bcd36a3df4314847 | subsection | 20 | 510 | Safety and Robust Safety | For instance, in ex:correct, the safety-relevant locations could be the I/O buffers from which the program performs inputs and outputs, and the safety property can constrain the input and output buffers at corresponding call and return actions involving the Fibonacci function.Definition 1 (Safety, attacker and robust 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.024038812145590782,
0.02078785002231598,
-0.05488480627536774,
0.038981031626462936,
-0.025519298389554024,
-0.032540157437324524,
0.031319137662649155,
0.03208227455615997,
0.021367833018302917,
0.015361946076154709,
-0.04523875564336777,
0.013835672289133072,
0.015445890836417675,
-0.... | |
eaed0728c5df911b74bed25164dc1cc9b601d516 | subsection | 21 | 510 | Safety and Robust Safety | \text{ if }
M\mathop {\raisebox {1mm}{\frown }}C
\text{ and }
\mathit {{\color {black}{C}}}\vdash \mathit {{\color {black}{A}}}: \mathit {{\color {black}{atk}}}
\text{ then }
\mathit {{\color {black}{M}}}\vdash \mathit {{\color {black}{A\left[C\right]}}} : \mathit {{\color {black}{safe}}}A whole program \mathit {{\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.0206693597137928,
0.012210938148200512,
-0.036579426378011703,
0.014987192116677761,
0.025794750079512596,
-0.0707181915640831,
0.019769364967942238,
0.018945641815662384,
0.0003856437106151134,
0.007013090420514345,
-0.0023853660095483065,
-0.007501223124563694,
-0.010075358673930168,
-... | |
4135a5746b0e3f368b9242b151646c855a13a546 | subsection | 22 | 510 | Remark #2: Compiling Monitors | In our development, we assume that a source and a target monitor are related and do not actually compile a source monitor to obtain a related target monitor.
While such compilation is feasible, it is at odds with our view of monitors as specifications of safety properties.
Compiling monitors and, in particular, compili... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05305783450603485,
-0.00015136090223677456,
-0.04021289572119713,
0.04472845792770386,
-0.021616719663143158,
-0.039541665464639664,
-0.03957217559218407,
-0.0065864636562764645,
0.044392842799425125,
0.011662655510008335,
0.01459929533302784,
-0.00596099765971303,
-0.0033332768362015486,... | |
8d2ece713cfb63e93f52aa7f8366db3d904c63bf | subsection | 23 | 510 | Proving | Proving that a compiler attains \mathbf {\mathit {RSC}} can be done either by proving that a compiler satisfies def:rsc or by proving something equivalent.
To this end, def:rsc-eq below presents an alternative, equivalent formulation of \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.033348407596349716,
0.01083899475634098,
-0.011586511507630348,
0.035331614315509796,
-0.015789387747645378,
0.010922899469733238,
0.010198266245424747,
0.006155572831630707,
0.02056434191763401,
0.03942007198929787,
0.002065206179395318,
-0.03325687348842621,
-0.016292816027998924,
0.0... | |
1b34410a6cd5e7bb0071ab32d90ff0f1c5b2595e | subsection | 24 | 510 | Proving | We call this characterisation property-free as it does not mention monitors explicitly (it mentions the {{\color {black}{\mathtt {relevant}(}}\cdot {{\color {black}{)}}}} function for reasons we explain below).Definition 2 (Property-Free \mathbf {\mathit {RSC}})\vdash {\color {black}{\left.\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.09441045671701431,
0.03533526510000229,
-0.027981380000710487,
0.013113411143422127,
-0.0074187275022268295,
-0.020963149145245552,
0.004447421990334988,
0.04458102211356163,
0.06627650558948517,
0.013868633657693863,
-0.008231163956224918,
0.004127024672925472,
0.01823214255273342,
0.0... | |
98fc52da34746f2a8f0369ebfeb73c8b1737ef4e | subsection | 25 | 510 | Proving | In other words, target contexts cannot induce more (bad) behaviours in the compiled code than source contexts can in the source code.
}}\mathbf {\mathit {PF\text{-}RSC}} and \mathbf {\mathit {RSC}} should, in general, be equivalent (thm:rsc-prf-eq).Proposition 1 (\mathbf {\mathit {PF\text{-}RSC}} and \mathbf {\mathit {... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/2951913.2951941",
"end": 2095,
"openalex_id": "https://openalex.org/W2514838807",
"raw": "Max S. New, William J. Bowman, and Amal Ahmed. Fully abstract compilation via universal embedding. In Proceedings of the 21st ACM SIGPLAN Inte... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.043406229466199875,
0.02104683220386505,
-0.014041395857930183,
-0.004456616938114166,
-0.013140914961695671,
-0.009745034389197826,
-0.0010655054356902838,
0.02066527120769024,
0.022954629734158516,
0.03125736862421036,
-0.043803051114082336,
0.011927555315196514,
-0.004624503199011087,
... | |
4e0a07885ac1ab9664c73ec1106905fee3e048c2 | subsection | 26 | 510 | Proving | In fact \mathbf {\mathit {PF\text{-}RSC}}, leads directly to a backtranslation-based proof technique since it can be rewritten (eliding irrelevant details) as:If \exists \mathbf {{\color {RedOrange}{A}}},{{\color {RedOrange}{\overline{\alpha }}}}.\ \mathbf {{\color {RedOrange}{\mathbf {{\color {RedOrange}{\Omega _0}}}\... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04010620713233948,
0.030781667679548264,
-0.030415400862693787,
0.013155080378055573,
0.009721329435706139,
-0.01767236925661564,
0.006459266413003206,
0.03577205166220665,
0.03387967497110367,
0.011957082897424698,
-0.05164361000061035,
0.005951834376901388,
-0.0027374622877687216,
0.0... | |
e7ac10d9cfdf9d79fd40ced509d022dcdbea9092 | subsection | 27 | 510 | Proving | However, backtranslation for \mathbf {\mathit {RSC}} (as we show in {sec:compup-proof}) is not as complex as backtranslation for \mathbf {\mathit {FAC}} ({sec:facomp-instance}).
}}}A simpler proof strategy is also viable for \mathbf {\mathit {RSC}} when we compile only those source programs that have been verified to b... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1007/s10817-009-9155-4",
"end": 1624,
"openalex_id": "https://openalex.org/W2148662736",
"raw": "Xavier Leroy. A formally verified compiler back-end. J. Autom. Reasoning, 43(4):363–446, 2009.",
"source_ref_id": "12ee2abc59335508506... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05730127915740013,
0.007925456389784813,
-0.04033668339252472,
0.026697881519794464,
0.004874270409345627,
-0.04707980528473854,
0.01641538366675377,
0.029459204524755478,
0.00893234834074974,
0.042350467294454575,
-0.02881845459342003,
-0.010846967808902264,
0.018810564652085304,
0.017... | |
3d858ce8bc8bc142d52dbea8081894906de1a6cd | subsection | 28 | 510 | Proving | CCC requires that the behaviours produced by a compiled component linked against a target context that is related (in behaviour) to a source context can also be produced by the source component linked against the related source context.
In contrast, \mathbf {\mathit {PF\text{-}RSC}} allows picking any source context to... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/2676726.2676985",
"end": 1442,
"openalex_id": "https://openalex.org/W2294599249",
"raw": "Gordon Stewart, Lennart Beringer, Santiago Cuellar, and Andrew W. Appel. Compositional compcert. In Proceedings of the 42Nd Annual ACM SIGPLAN... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.045456234365701675,
0.012416568584740162,
-0.029638076201081276,
0.03465656563639641,
0.026221230626106262,
-0.030004166066646576,
0.00798534881323576,
-0.00794721394777298,
-0.03270408511161804,
0.046768058091402054,
-0.02422298677265644,
-0.0206078439950943,
0.01137168612331152,
0.009... | |
77707d9079403b9e0b3d7caa5a8d06598aae4ff4 | subsection | 29 | 510 | Proving | However, they differ substantially in one key point: the heap model.
This affords the target-level adversary attacks like guessing private locations and writing to them that do not obviously exist in the source (and makes our proofs nontrivial).
We believe that (with due effort) the ideas here will generalize to langua... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1007/978-3-662-03811-6",
"end": 647,
"openalex_id": "https://openalex.org/W1553894716",
"raw": "Flemming Nielson, Hanne R. Nielson, and Chris Hankin. Principles of Program Analysis. Springer-Verlag New York, USA, 1999.",
"source_re... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.013561961241066456,
0.0010936142643913627,
-0.03536178544163704,
0.009389637038111687,
0.004961785860359669,
-0.04295892268419266,
0.017009658738970757,
0.023477906361222267,
0.0018907036865130067,
-0.011372825130820274,
-0.010922794230282307,
-0.012143217958509922,
-0.0004900764906778932... | |
b58160cf3e29c3ba7655926c662025c36d5fab43 | subsection | 30 | 510 | Proving | 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\... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.0490412563085556,
0.015960533171892166,
-0.02685520052909851,
-0.016296222805976868,
-0.016372516751289368,
-0.025863388553261757,
-0.02151467651128769,
0.01893596723675728,
0.015838464722037315,
0.015350188128650188,
0.007259296253323555,
0.009162810631096363,
0.03878745436668396,
0.02... | |
5fa399da554a1600ae5cf83182e47464e02649e4 | subsection | 31 | 510 | Proving | 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 ... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.06081477552652359,
0.036555998027324677,
-0.03982101380825043,
0.014173840172588825,
0.007372990716248751,
-0.03838684782385826,
-0.0022733069490641356,
0.021405702456831932,
-0.0125337028875947,
0.023495925590395927,
-0.024716492742300034,
0.01373138464987278,
0.01560037862509489,
0.03... | |
db089d01e7b053c361b7604acf60a200c5c88f38 | subsection | 32 | 510 | Proving | \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": 1349,
"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.06737639755010605,
0.021024608984589577,
-0.03048415668308735,
0.03857054561376572,
0.00839153490960598,
-0.011542174965143204,
0.010268187150359154,
0.012411843053996563,
0.007842270657420158,
-0.0036712964065372944,
0.006183035206049681,
-0.005679543130099773,
0.00978758092969656,
0.0... | |
201d3ba02686059e3fff50f291659ddbe52a02cc | subsection | 33 | 510 | Proving | To support hidden local state, a location can be “hidden” explicitly via the statement \mathbf {{\color {RedOrange}{\mathbf {{\color {RedOrange}{let}}}~x=\mathbf {{\color {RedOrange}{\mathbf {{\color {RedOrange}{hide}}}~e}}}~\mathbf {{\color {RedOrange}{in}}}~s}}}, which allocates a new capability \mathbf {{\color {Red... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.17863/cam.15863",
"end": 472,
"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.029999058693647385,
0.050934311002492905,
0.008506854064762592,
-0.000018894848835770972,
0.02313253842294216,
-0.026947272941470146,
-0.0005674415151588619,
0.007221288979053497,
0.025238271802663803,
0.0011739840265363455,
-0.026932012289762497,
-0.008079604245722294,
0.0181581284850835... | |
4e033132e3f4bca5b0db388455400c7d632b9e0f | subsection | 34 | 510 | Proving | Omitted rules are the same as in \mathsf {{\color {RoyalBlue}{L^{U}}}} (fig:lu-sem).]A second difference between \mathbf {{\color {RedOrange}{L^{P}}}} and \mathsf {{\color {RoyalBlue}{L^{U}}}} is that \mathbf {{\color {RedOrange}{L^{P}}}} has no booleans, while \mathsf {{\color {RoyalBlue}{L^{U}}}} has them.
This makes... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.06119520589709282,
-0.011208947747945786,
-0.02165486291050911,
-0.009202172048389912,
0.0036530180368572474,
-0.018160173669457436,
0.021349649876356125,
0.0070923869498074055,
0.009797337464988232,
0.019533632323145866,
0.006966486573219299,
-0.02064765989780426,
0.00873672217130661,
... | |
fc7001e98886359cd13b2d1a6d22af20a26ee6cd | subsection | 35 | 510 | Proving | \mathbf {{\color {RedOrange}{M\mathop {\raisebox {1mm}{\frown }}C}}}\mathrel {\overset{\mbox{[}0pt]{\mbox{\normalfont \tiny \sffamily def}}}{=}}&\ (\mathbf {{\color {RedOrange}{M}}} = \mathbf {{\color {RedOrange}{({{\color {RedOrange}{\left\lbrace \sigma \right\rbrace }}},\rightsquigarrow ,{{\color {RedOrange}{\sigma }... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04943283274769783,
0.03307727724313736,
-0.018827196210622787,
-0.009695853106677532,
0.008383747190237045,
-0.013998339883983135,
0.011740297079086304,
-0.0013111524749547243,
0.030620893463492393,
0.012358208186924458,
-0.023236481472849846,
0.004043117165565491,
0.020490214228630066,
... | |
81d16110d0b8ff95cad32827c85773fe028f99bd | subsection | 36 | 510 | Proving | Then, we prove that {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathbf {{\color {RedOrange}{L^{P}}}}}}} attains \mathbf {\mathit {RSC}}.
[Figure: {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/2429069.2429114",
"end": 2115,
"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 JavaS... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.043485745787620544,
0.017928333953022957,
-0.038877781480550766,
0.004207436461001635,
-0.006160480435937643,
-0.0002620111627038568,
-0.0012559369206428528,
-0.012710044160485268,
0.02809026464819908,
0.026671256870031357,
-0.007903724908828735,
-0.0017937869997695088,
0.0256031863391399... | |
df2fc8d8fd361683006566ce551ee67b45bfe0f4 | subsection | 37 | 510 | Proving | Proof of \mathbf {\mathit {RSC}}
{\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 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.05255661904811859,
0.02400451898574829,
-0.021807029843330383,
0.006668769754469395,
-0.008316886611282825,
0.009591124951839447,
0.00048523119767196476,
0.00738219078630209,
0.03068854846060276,
0.02714814990758896,
-0.022417442873120308,
-0.0023062191903591156,
-0.00481845298781991,
0... | |
c6955f7aa83a72f266fbdd27c73224c5d192322d | subsection | 38 | 510 | Proving | On values, \operatorname{{\color {black}{\approx _{\beta }}}} is defined as follows:
\mathsf {{\color {RoyalBlue}{{true}}}} \operatorname{{\color {black}{\approx _{\beta }}}}\mathbf {{\color {RedOrange}{0}}};
\mathsf {{\color {RoyalBlue}{{false}}}} \operatorname{{\color {black}{\approx _{\beta }}}}\mathbf {{\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.0513378269970417,
0.014238463714718819,
-0.03180381655693054,
-0.0018217755714431405,
-0.0085613913834095,
0.00882845837622881,
-0.011354144662618637,
0.05338279530405998,
0.028827929869294167,
0.0022700659465044737,
-0.037419844418764114,
0.004131901543587446,
0.007775452919304371,
0.0... | |
017c3759b1a715f860544dc0033594ae7f3639db | subsection | 39 | 510 | Proving | The action relation \mathsf {{\color {RoyalBlue}{\alpha }}}\operatorname{{\color {black}{\approx _{\beta }}}}{{\color {RedOrange}{\alpha }}} is defined following the intuition of sec:rsc-theory.
[Figure: Heap, state and action relations.]With this relation we define a backwards simulation lemma (thm:back-sim) that is 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.061384983360767365,
0.009226062335073948,
-0.03427913412451744,
0.01304926909506321,
-0.014972319826483727,
0.010256268084049225,
0.015857532620429993,
0.05143396183848381,
0.024892816320061684,
0.023015553131699562,
-0.018589485436677933,
-0.007249594200402498,
-0.026907440274953842,
0... | |
ca7e3da3de5fbe0bc525cf73581b0e688c2eadee | subsection | 40 | 510 | Proving | 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.04363550618290901,
0.005668038967996836,
-0.00903224479407072,
0.0410723015666008,
-0.013998453505337238,
0.006434711627662182,
-0.0036521852016448975,
0.03701389580965042,
0.05913679301738739,
-0.004134693183004856,
0.027935879305005074,
-0.015638599172234535,
-0.005832053255289793,
0.... | |
b4173a1e9b859e2047bf9c9d11c11a2d90a88ef4 | subsection | 41 | 510 | Proving | 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.08787593990564346,
0.012578769586980343,
-0.006281756330281496,
-0.005473176017403603,
-0.01667506992816925,
-0.005640994291752577,
0.00539689464494586,
0.012998315505683422,
0.055136047303676605,
0.012952547520399094,
0.021709628403186798,
-0.010259821079671383,
0.007342065218836069,
0... | |
ff8e078f8dd55678ef2050b9daad226d30b2f0d3 | subsection | 42 | 510 | Proving | In words, \mathcal {R} is a bisimulation only if \mathsf {{\color {RoyalBlue}{M}}} \mathcal {R} \mathbf {{\color {RedOrange}{M}}} implies that \mathsf {{\color {RoyalBlue}{M}}} and \mathbf {{\color {RedOrange}{M}}} simulate each other on heaps related by any \beta that relates \mathsf {{\color {RoyalBlue}{\ell _{root}}... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.07347100973129272,
0.019496668130159378,
-0.004389801062643528,
0.0045537990517914295,
-0.01951192319393158,
0.0014483293052762747,
-0.004862725269049406,
0.0558050163090229,
0.014752172864973545,
0.018291475251317024,
-0.034111540764570236,
0.0012366577284410596,
0.008558396250009537,
... | |
a9398ea04e63491119814fcdec2a32560cc93e1b | subsection | 43 | 510 | Proving | Intuitively, {\color {black}{\left\langle \!\left\langle {\cdot } \right\rangle \!\right\rangle ^{\mathbf {{\color {RedOrange}{L^{P}}}}}_{\mathsf {{\color {RoyalBlue}{L^{U}}}}}}} takes a target trace {{\color {RedOrange}{\overline{\alpha }}}} and builds a set of source contexts such that one of them when linked with th... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1145/2699503",
"end": 550,
"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.061980556696653366,
0.012931689620018005,
-0.03970295563340187,
0.022002944722771645,
0.022277601063251495,
-0.019256392493844032,
0.007255478762090206,
0.02790803648531437,
0.0019969732966274023,
0.040740545839071274,
-0.017455874010920525,
0.0005879341042600572,
0.029754329472780228,
... | |
5cd1d88224683e795ca45ee3edcc98f95fdcdf36 | subsection | 44 | 510 | Proving | Adding element \mathsf {{\color {RoyalBlue}{v}}} to list \mathsf {{\color {RoyalBlue}{L}}} is denoted as \mathsf {{\color {RoyalBlue}{L::v}}} and it amounts to turning \mathsf {{\color {RoyalBlue}{L}}} into \mathsf {{\color {RoyalBlue}{\left\langle v,L\right\rangle }}}.
Given an element \mathsf {{\color {RoyalBlue}{\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.0362752303481102,
0.014560431241989136,
-0.02210378833115101,
0.02195124328136444,
0.0068454621359705925,
0.015056203119456768,
0.036061666905879974,
0.03474977985024452,
0.003744982648640871,
0.02642081491649151,
-0.022317351773381233,
-0.001248963177204132,
0.007749292068183422,
0.037... | |
9f6d929bba526512f5382187285945f99a9b5bbb | subsection | 45 | 510 | Proving | \mathbf {{\color {RedOrange}{\mathtt {call}~ f~ 2~ ( {\color {black}{\underbrace{\mathbf {{\color {RedOrange}{1\mapsto 55:\bot }}}}_{\node (h4){};}}}, 2\mapsto \left\langle 3,k\right\rangle :\bot , {\color {black}{\underbrace{\mathbf {{\color {RedOrange}{3\mapsto 15:k}}}}_{\node (h5){};}}} ){?}}}} \right.
;
align=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.05047047138214111,
-0.013647472485899925,
-0.034603092819452286,
-0.013479644432663918,
0.0014522847486659884,
0.02465546689927578,
0.017301546409726143,
0.03820376843214035,
0.020200394093990326,
0.03013276495039463,
-0.03622034564614296,
0.013502529822289944,
0.010718110017478466,
0.0... | |
7baf30348bd64df713f56361b2bd56cb4636853c | subsection | 46 | 510 | Proving | Locations are looked up in this list based on their second field \mathsf {{\color {RoyalBlue}{n}}}, which is their target-level address.
Since we have access to the whole trace, we know how many locations we will add to \mathsf {{\color {RoyalBlue}{L}}} so we know its length.
In order to backtranslate the first call, w... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.04649391770362854,
-0.010098088532686234,
0.009609963744878769,
0.025794362649321556,
0.002617952413856983,
-0.016611509025096893,
0.015864066779613495,
0.024482525885105133,
-0.009220988489687443,
0.032826416194438934,
-0.032063718885183334,
0.017541997134685516,
0.005781231913715601,
... | |
f1f0b9b17d04b0ff02bbab7d73ab897afa53ab8c | subsection | 47 | 510 | Proving | Theorem 2 ({\color {black}{\left\langle \!\left\langle {\cdot } \right\rangle \!\right\rangle ^{\mathbf {{\color {RedOrange}{L^{P}}}}}_{\mathsf {{\color {RoyalBlue}{L^{U}}}}}}} is correct)
\text{if }
&
\mathbf {{\color {RedOrange}{A\left[{\color {black}{\left.\mathsf {{\color {RoyalBlue}{C}}} \right.^{\mathsf {{\color... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.05674808844923973,
0.033926814794540405,
-0.038625311106443405,
0.003645912278443575,
-0.007730401586741209,
-0.0010602129623293877,
-0.04112711176276207,
0.01826007105410099,
0.02398064360022545,
0.0001389622630085796,
-0.009282584302127361,
-0.013981081545352936,
0.0025704444851726294,
... | |
071948a41257f2cedd185a6603b073d4c3a35507 | subsection | 48 | 510 | Proving | Theorem 3 (\mathbf {\mathit {PF\text{-}RSC}} and \mathbf {\mathit {RSC}} are equivalent for {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.^{\mathsf {{\color {RoyalBlue}{L^{U}}}}}_{\mathbf {{\color {RedOrange}{L^{P}}}}}}})
\vdash {\color {black}{\left.\mathsf {{\color {RoyalBlue}{\cdot }}} \right.... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.0312371626496315,
0.042636364698410034,
-0.03650185465812683,
-0.008240384981036186,
-0.010781170800328255,
0.014443564228713512,
-0.0037615832407027483,
0.011200820095837116,
0.03802785277366638,
0.02461433596909046,
-0.0027811299078166485,
0.011048220098018646,
-0.007393456529825926,
... | |
8f59aa3d4dc7d89bf50dba4e5266973d2c5112ed | subsection | 49 | 510 | Proving | 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 {{\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.03670264780521393,
0.030204175040125847,
-0.031790655106306076,
0.015147851780056953,
-0.012836774811148643,
-0.005342935677617788,
0.009236680343747139,
0.006326859351247549,
0.021661579608917236,
-0.00044858158798888326,
-0.009320581331849098,
-0.004740377422422171,
-0.00058968691155314... | |
8f5f15849f0987fde464e6c6721ad1a0db8f1939 | subsection | 50 | 510 | Proving | Our source language, \mathsf {{\color {RoyalBlue}{L^{\tau }}}}, is similar to \mathsf {{\color {RoyalBlue}{L^{U}}}} but it has a type system that accepts only source programs whose traces the source monitor never rejects.
Our target language is mostly unchanged. Our compiler {\color {black}{\left.\mathsf {{\color {Roya... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "10.1016/0304-3975(92)90185-i",
"end": 1281,
"openalex_id": "https://openalex.org/W2055378322",
"raw": "Gérard Berry and Gérard Boudol. The chemical abstract machine. Theor. Comput. Sci., 96(1):217–248, 1992.",
"source_ref_id": "ae35d9... | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.03594699129462242,
-0.0019129260908812284,
-0.032498765736818314,
0.0011233434779569507,
0.018065040931105614,
-0.008277267217636108,
0.012778270058333874,
0.03872387856245041,
-0.01182466745376587,
0.01856854371726513,
-0.017378447577357292,
0.03045424073934555,
0.002450757659971714,
-... | |
dc2893c6e429d1b62a4b406b4abd63599d7409b9 | subsection | 51 | 510 | Proving | Every type that is not a subtype of \mathsf {{\color {RoyalBlue}{UN}}} is implicitly trusted and cannot be passed to the context.
Untrusted locations are explicitly marked \mathsf {{\color {RoyalBlue}{UN}}} at their allocation points in the program.
Other types are deemed shareable via subtyping.
Intuitively, a type is... | {
"cite_spans": [
{
"arxiv_id": "",
"doi": "",
"end": 1290,
"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.029777023941278458,
0.004033100325614214,
-0.0526554249227047,
0.013400423340499401,
-0.004639782011508942,
0.013926978223025799,
0.023092074319720268,
0.02216106466948986,
0.004998449701815844,
0.003832780523225665,
-0.012644932605326176,
0.003178403479978442,
0.03189850226044655,
0.00... | |
8e437d084758196fd95cc7811393f5a52347f58b | subsection | 52 | 510 | Proving | Monitors \mathsf {{\color {RoyalBlue}{M}}} check at runtime that the set of trusted heap locations \mathsf {{\color {RoyalBlue}{\Delta }}} have values of their intended static types.
Accordingly, the description of the monitor includes a list of trusted locations and their expected types (in the form of an environment ... | {
"cite_spans": []
} | 1804.00489 | Robustly Safe Compilation or, Efficient, Provably Secure Compilation | [
"Marco Patrignani",
"Deepak Garg"
] | [
"cs.PL"
] | 2,018 | en | Computer Science | [
-0.0348757728934288,
-0.00124243029858917,
-0.034204497933387756,
0.019817858934402466,
0.003909412305802107,
-0.009413101710379124,
0.003550890600308776,
0.03600473329424858,
0.008024783805012703,
-0.005656252149492502,
0.014615480788052082,
-0.0008100111735984683,
0.025004982948303223,
0... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.