.png){kind=icon}
.png){kind=icon}
Return
Relaxed Effective Callback Freedom: A Parametric Correctness Condition for Sequential Modules With Callbacks
.png){kind=icon}
PRE
AI
DOI：10.1109/TDSC.2022.3178836.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Callbacks are an essential mechanism for event-driven programming. Unfortunately, callbacks make reasoning challenging because they introduce behaviors where calls to the module are interleaved. We present a parametric method that, from a particular invariant of the program, allows reducing the problem of verifying the invariant in the presence of callbacks, to the callback-free setting. Intuitively, we allow callbacks to introduce behaviors that cannot be produced by callback free executions, as long as they do not affect correctness. A chief insight is that the user is aware of the potential effect of the callbacks on the program state. To this end, we present a parametric verification technique which accepts this insight as a relation between callback and callback free executions. We implemented our approach and applied it successfully to a large set of real-world programs.
Keywords:
Contracts
Cognition
Codes
Programming
Static analysis
Smart contracts
Safety
Smart contract verification
Event-driven programming
Unbounded re-entrancy
Callbacks
Journal
IF:
7.5
Papers:
2.4K
Citations:
9.6K