Combining symbolic execution and model checking to reduce dynamic program analysis overhead
Abstract
This paper addresses the problem of reducing the runtime monitoring overhead for programs where ¯ne-grained monitoring of events is required. To this end we complement model checking techniques with symbolic reasoning methods and show that, under certain circumstances, code fragments do not a®ect the validity of underlying properties. We consider safety properties given as regular expressions on events generated by the program. Further, we show how our framework can be extended to consider programs with cycles. We sample our presentation with the aid of the Java PathFinder model checker [13].
Keywords: model checking, Java PathFinder, symbolic reasoning, instrumentation, monitoring, invariant strengthening.
How to Cite
Downloads
Downloads
Published
Issue
Section
License
The publication of an article in the Colombian Journal of Computing, requires authorization by the author, through the letter of assignment, which authorizes the Editor of this Journal for partial or total reproduction, for academic purposes, not commercial or lucrative, according to the Open Access philosophy on Web sites and on the Internet, such as networks, bibliographic databases, indexes, directories or any other means of electronic reproduction, always referring to the author(s) and the journal, as stipulated in Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Altmetric
| Article metrics | |
|---|---|
| Abstract views | 482 |
| Galley views | 230 |
| PDF Views | 230 |
| HTML views | 0 |
| Other views | 0 |


