A comparison of compilation techniques for trace monitors with free variables

Authors:
Pavel Avgustinov;Julian Tibble;Oege de Moor
Affiliations:
University of Oxford, Oxford, United Kingdom;University of Oxford, Oxford, United Kingdom;University of Oxford, Oxford, United Kingdom
Venue:
Companion to the 22nd ACM SIGPLAN conference on Object-oriented programming systems and applications companion
Year:
2007

Citing 6
Cited 0

Event-based runtime verification of java programs

WODA '05 Proceedings of the third international workshop on Dynamic analysis
Adding trace matching with free variables to AspectJ

OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Finding application errors and security flaws using PQL: a program query language

OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Relational queries over program traces

OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Making trace monitors feasible

Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems and applications
Java-MOP: a monitoring oriented programming environment for java

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A variety of different designs and optimisation strategies for trace monitoring have been proposed recently. Here, we examine trade-offs in simplicity of implementation and expressiveness of supported patterns, briefly discuss the underlying data structures of two mainstream implementations, and provide a short evaluation of the effectiveness ofmemory optimisations.