Optimized Instrumentation of Runtime Verification

Article Preview

Abstract:

Runtime verification checks whether one system execution conforms to a group of specific requirements. One of the many problems concerned is how to lower the costly instrumentation overhead, because the performance is as important as correctness. The solutions to cope with the problem include static checking, and hardware based instrumentation. What makes a difference to our approach is that it takes into account the modular structure of the observed run, and our approach makes a tradeoff between observability and cost by means of simulated annealing algorithm. The paper gives a definition of instrumentation observability in detail. The simulated annealing approach works out an optimized instructive instrumentation solution containing part of all the observing points. An experiment is conducted on the LwIP protocol stack to prove the effect of our observing strategy.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

3769-3773

Citation:

Online since:

August 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Wallace D R, Fujii R U. Software verification and validation: an overview[J]. IEEE Software, 1989, 6(3): 10-17.

Google Scholar

[2] Visser W, Havelund K, Brat G, et al. Model checking programs[J]. Automated Software Engineering, 2003, 10(2): 203-232.

DOI: 10.1023/a:1022920129859

Google Scholar

[3] Baier C, Katoen J P. Principles of model checking[M]. Cambridge: MIT press, (2008).

Google Scholar

[4] Havelund K, Goldberg A. Verify your runs[M]/Verified Software: Theories, Tools, Experiments. Springer Berlin Heidelberg, 2008: 374-383.

DOI: 10.1007/978-3-540-69149-5_40

Google Scholar

[5] Havelund K. Implementing Runtime Monitors⋆[J].

Google Scholar

[6] Busetti F. Simulated annealing overview[J]. World Wide Web URL www. geocities. com/ francorbusetti/saweb. pdf, (2003).

Google Scholar

[7] Alur R, Dill D L. A theory of timed automata[J]. Theoretical computer science, 1994, 126 (2): 183-235.

DOI: 10.1016/0304-3975(94)90010-8

Google Scholar

[8] Papadimitriou C H, Steiglitz K. Combinatorial optimization: algorithms and complexity[M]. Courier Dover Publications, (1998).

Google Scholar

[9] Rutenbar R A. Simulated annealing algorithms: An overview[J]. Circuits and Devices Magazine, IEEE, 1989, 5(1): 19-26.

DOI: 10.1109/101.17235

Google Scholar

[10] Dunkels A. Design and Implementation of the lwIP TCP/IP Stack[J]. Swedish Institute of Computer Science, 2001, 2: 77.

Google Scholar