-
Notifications
You must be signed in to change notification settings - Fork 0
/
index.json
216 lines (216 loc) · 12.7 KB
/
index.json
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
[
{
"authors": [
"Bhargav Nagaraja Bhatt",
"Carlo A. Furia"
],
"categories": null,
"content": "#More detail can easily be written here using Markdown and $\\rm \\LaTeX$ math code.\n",
"date": 1583017200,
"expirydate": -62135596800,
"kind": "page",
"lang": "en",
"lastmod": 1583513746,
"objectID": "a2fc18c4a87ae2d229e58d927429f974",
"permalink": "https://bhargavbh.github.io/publication/plumbdroid/",
"publishdate": "2020-03-01T00:00:00+01:00",
"relpermalink": "/publication/plumbdroid/",
"section": "publication",
"summary": "Resource leaks—a program does not release resources it previously acquired—are a common kind of bug in Android applications. Even with the help of existing techniques to automatically detect leaks, writing a leak-free program remains tricky. One of the reasons is Android’s event-driven programming model, which complicates the understanding of an application’s overall control flow. In this paper, we present PlumbDroid: a technique to automatically detect and fix resource leaks in Android applications. PlumbDroid uses static analysis to find execution traces that may leak a resource. The information built for detection also undergirds automatically building a fix—consisting of release operations performed at appropriate locations—that removes the leak and does not otherwise affect the application’s usage of the resource. An empirical evaluation on resource leaks from the DroidLeaks curated collection demonstrates that PlumbDroid’s approach is scalable and produces correct fixes for a variety of resource leak bugs. This indicates it can provide valuable support to enhance the quality of Android applications in practice",
"tags": [],
"title": "Automatic Repair of Resource Leaks in Android Applications",
"type": "publication"
},
{
"authors": [],
"categories": null,
"content": "",
"date": 1575500400,
"expirydate": -62135596800,
"kind": "page",
"lang": "en",
"lastmod": 1583513746,
"objectID": "f2e3ab4cd260224ee5a6013cbf75833d",
"permalink": "https://bhargavbh.github.io/talk/si_seminar/",
"publishdate": "2019-12-05T00:00:00+01:00",
"relpermalink": "/talk/si_seminar/",
"section": "talk",
"summary": "",
"tags": [],
"title": "DroidPLUMB: Repairing Resource-Leak bugs with Static Analysis",
"type": "talk"
},
{
"authors": [
"David Basin",
"Bhargav Nagaraja Bhatt",
"Sr\u0026#273;an Krsti\u0026#263;",
"Dmitriy Traytel"
],
"categories": null,
"content": "#More detail can easily be written here using Markdown and $\\rm \\LaTeX$ math code.\n",
"date": 1549062000,
"expirydate": -62135596800,
"kind": "page",
"lang": "en",
"lastmod": 1583513746,
"objectID": "6debca99a8776c64de7ae658523549f4",
"permalink": "https://bhargavbh.github.io/publication/fmsd19/",
"publishdate": "2019-02-02T00:00:00+01:00",
"relpermalink": "/publication/fmsd19/",
"section": "publication",
"summary": "A monitoring algorithm is trace-length independent if its space consumption does not depend on the number of events processed. The analysis of many monitoring algorithms has aimed at establishing their trace-length independence. But a trace-length independent monitor's space consumption can depend on characteristics of the trace other than its size. We put forward the stronger notion of event-rate independence, where the monitor's space usage does not depend on the event rate, i.e., the number of events in a fixed time unit. This property is critical for monitoring voluminous streams of events with a high arrival rate. We propose a new algorithm for metric temporal logic (MTL) that is almost event-rate independent, where *almost* denotes a logarithmic dependence on the event rate: the algorithm must store the event rate as a number. Afterwards, we investigate more expressive logics. In particular, we extend linear dynamic logic with past operators and metric features. The resulting metric dynamic logic (MDL) offers the quantitative temporal conveniences of MTL while increasing its expressiveness. We show how to modify our MTL algorithm in a modular way, yielding an almost event-rate independent monitor for MDL. Finally, we compare our algorithms with traditional monitoring approaches, providing empirical evidence that almost event-rate independence matters in practice.",
"tags": [],
"title": "Almost Event-Rate Independent Monitoring",
"type": "publication"
},
{
"authors": [
"David Basin",
"Bhargav Nagaraja Bhatt",
"Dmitriy Traytel"
],
"categories": null,
"content": "#More detail can easily be written here using Markdown and $\\rm \\LaTeX$ math code.\n",
"date": 1522533600,
"expirydate": -62135596800,
"kind": "page",
"lang": "en",
"lastmod": 1540900271,
"objectID": "865f3c4cb894316d99e5fad27358fd8b",
"permalink": "https://bhargavbh.github.io/publication/atva18/",
"publishdate": "2018-04-01T00:00:00+02:00",
"relpermalink": "/publication/atva18/",
"section": "publication",
"summary": "Counterexamples produced by model checkers can be hard to grasp. Often it is not even evident why a trace violates a specification. We show how to provide easy-to-check evidence for the violation of a linear temporal logic (LTL) formula on a lasso word, based on a novel sound and complete proof system for LTL on lasso words. Valid proof trees in our proof system follow the syntactic structure of the formula and provide insight on why each Boolean or temporal operator is violated or satisfied. We introduce the notion of optimal proofs with respect to a user-specified preference order and identify sufficient conditions for efficiently computing optimal proofs. We design and evaluate an algorithm that performs this computation, demonstrating that it can produce optimal proofs for complex formulas in under a second.",
"tags": [
"Distinguished Paper Award"
],
"title": "Optimal Proofs for Linear Temporal Logic on Lasso Words",
"type": "publication"
},
{
"authors": [
"Andreas Lochbihler",
"S Reza Sefidgar",
"Bhargav Nagaraja Bhatt"
],
"categories": null,
"content": "#More detail can easily be written here using Markdown and $\\rm \\LaTeX$ math code.\n",
"date": 1498860000,
"expirydate": -62135596800,
"kind": "page",
"lang": "en",
"lastmod": 1540841573,
"objectID": "1627d5860f7d7e91e4e4a134bf4512d8",
"permalink": "https://bhargavbh.github.io/publication/afp17/",
"publishdate": "2017-07-01T00:00:00+02:00",
"relpermalink": "/publication/afp17/",
"section": "publication",
"summary": "In this AFP entry, we show how to specify game-based cryptographic security notions and formally prove secure several cryptographic constructions from the literature using the CryptHOL framework. Among others, we formalise the notions of a random oracle, a pseudo-random function, an unpredictable function, and of encryption schemes that are indistinguishable under chosen plaintext and/or ciphertext attacks. We prove the random-permutation/random-function switching lemma, security of the Elgamal and hashed Elgamal public-key encryption scheme and correctness and security of several constructions with pseudo-random functions. Our proofs follow the game-hopping style advocated by Shoup and Bellare and Rogaway, from which most of the examples have been taken. We generalise some of their results such that they can be reused in other proofs. Thanks to CryptHOL's integration with Isabelle's parametricity infrastructure, many simple hops are easily justified using the theory of representation independence.",
"tags": [],
"title": "Game-based cryptography in HOL",
"type": "publication"
},
{
"authors": [
"David Basin",
"Bhargav Nagaraja Bhatt",
"Dmitriy Traytel"
],
"categories": null,
"content": "#More detail can easily be written here using Markdown and $\\rm \\LaTeX$ math code.\n",
"date": 1490997600,
"expirydate": -62135596800,
"kind": "page",
"lang": "en",
"lastmod": 1540861447,
"objectID": "7293238dda9b4d67625800b132f7dbe7",
"permalink": "https://bhargavbh.github.io/publication/tacas17/",
"publishdate": "2017-04-01T00:00:00+02:00",
"relpermalink": "/publication/tacas17/",
"section": "publication",
"summary": "A monitoring algorithm is trace-length independent if its space consumption does not depend on the number of events processed. The analysis of many monitoring algorithms has aimed at establishing trace-length independence. But a trace-length independent monitor’s space consumption can depend on characteristics of the trace other than its size. We put forward the stronger notion of event-rate independence, where the monitor’s space usage does not depend on the event rate. This property is critical for monitoring voluminous streams of events arriving at a varying rate. Some previously proposed algorithms for past-only temporal logics satisfy this new property. However, when dealing with future operators, the traditional approach of using a queue to wait for future obligations to be resolved is not event-rate independent. We propose a new algorithm that supports metric past and bounded future operators and is almost event-rate independent, where “almost” denotes a logarithmic dependence on the event rate: the algorithm must store the event rate as a number. We compare our algorithm with traditional ones, providing evidence that almost event-rate independence matters in practice.",
"tags": [],
"title": "Almost Event-Rate Independent Monitoring of Metric Temporal Logic",
"type": "publication"
},
{
"authors": [],
"categories": null,
"content": "",
"date": 1490997600,
"expirydate": -62135596800,
"kind": "page",
"lang": "en",
"lastmod": 1540840110,
"objectID": "de7c4b92ec6e57979b3a5d90366e0960",
"permalink": "https://bhargavbh.github.io/talk/tacas17/",
"publishdate": "2017-04-01T00:00:00+02:00",
"relpermalink": "/talk/tacas17/",
"section": "talk",
"summary": "",
"tags": [],
"title": "Almost Event-Rate Independent Monitoring of Metric Temporal Logic",
"type": "talk"
},
{
"authors": [],
"categories": null,
"content": "Click on the Slides button above to view the built-in slides feature.\n Slides can be added in a few ways:\n Create slides using Academic\u0026rsquo;s Slides feature and link using url_slides parameter in the front matter of the talk file Upload an existing slide deck to static/ and link using url_slides parameter in the front matter of the talk file Embed your slides (e.g. Google Slides) or presentation video on this page using shortcodes. Further talk details can easily be added to this page using Markdown and $\\rm \\LaTeX$ math code.\n",
"date": 1490997600,
"expirydate": -62135596800,
"kind": "page",
"lang": "en",
"lastmod": 1540839111,
"objectID": "f5ea226b0f35b26314745dd04f7b1f4c",
"permalink": "https://bhargavbh.github.io/talk/clc14/",
"publishdate": "2017-04-01T00:00:00+02:00",
"relpermalink": "/talk/clc14/",
"section": "talk",
"summary": "Click on the Slides button above to view the built-in slides feature.\n Slides can be added in a few ways:\n Create slides using Academic\u0026rsquo;s Slides feature and link using url_slides parameter in the front matter of the talk file Upload an existing slide deck to static/ and link using url_slides parameter in the front matter of the talk file Embed your slides (e.g. Google Slides) or presentation video on this page using shortcodes.",
"tags": [],
"title": "Logics for Dependence and Independence",
"type": "talk"
},
{
"authors": [],
"categories": null,
"content": "",
"date": 1490997600,
"expirydate": -62135596800,
"kind": "page",
"lang": "en",
"lastmod": 1540839111,
"objectID": "288ddfbce6bcd56efdf9d53118d7c0c1",
"permalink": "https://bhargavbh.github.io/talk/msr15/",
"publishdate": "2017-04-01T00:00:00+02:00",
"relpermalink": "/talk/msr15/",
"section": "talk",
"summary": "",
"tags": [],
"title": "TruMP: Trusted Multi Party Computation on SGX Enclaves",
"type": "talk"
},
{
"authors": [
"Bhargav Bhatt"
],
"categories": null,
"content": "",
"date": 1480546800,
"expirydate": -62135596800,
"kind": "page",
"lang": "en",
"lastmod": 1540840110,
"objectID": "4568ae16cc64b4bdf8210b946cf58c4e",
"permalink": "https://bhargavbh.github.io/talk/srw16/",
"publishdate": "2016-12-01T00:00:00+01:00",
"relpermalink": "/talk/srw16/",
"section": "talk",
"summary": "",
"tags": [],
"title": "Event-Rate Independence in Runtime Monitoring",
"type": "talk"
}
]