Name
Abstract | ||
|---|---|---|
Runtime Enforcement (RE) is a monitoring technique to ensure that a system obeys a set of formal requirements (properties). RE employs an enforcer (a safety wrapper for the system) which modifies the (untrustworthy) output by performing actions such as delaying (by storing/buffering) and suppressing events, when needed. In this paper, to handle practical applications with memory constraints, we propose a new RE paradigm where the memory of the enforcer is bounded/finite. Besides the property to be enforced, the user specifies a bound on the enforcer memory. Bounding the memory poses various challenges such as how to handle the situation when the memory is full, how to optimally discard events from the buffer to accommodate new events and let the enforcer continue operating. We define the bounded-memory RE problem and develop a framework for any regular property. The proposed framework is implemented and its performance evaluated via some examples from application scenarios indicates that the enforcer has reasonable execution time overhead. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1007/978-3-031-15077-7_7 | Model Checking Software |
Keywords | DocType | ISSN |
Formal methods, Runtime enforcement, Automata | Conference | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shankar Saumya | 1 | 0 | 0.34 |
| Antoine Rollet | 2 | 62 | 9.53 |
| Pinisetty Srinivas | 3 | 0 | 0.34 |
| Falcone Yliès | 4 | 0 | 0.34 |