Adding trace matching with free variables to AspectJ
By Chris Allan, Pavel Avgustinov, Aske Simon Christensen, Laurie J. Hendren, Sascha Kuzins, Ondřej Lhoták, O. Moor, D. Sereni, Ganesh Sittampalam, J. Tibble. Conference on Object-Oriented Programming Systems, Languages, and Applications, 2005
475 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications, Information Systems
View Paper: https://www.semanticscholar.org/paper/fbc8e5095ac38242784d6a000840e31ea3dd88de
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Christian Kästner
- Sven Apel
- Gunter Saake
- Don S. Batory
- Grigore Roşu
- Feng Chen
- Thomas Thüm
- Krzysztof Czarnecki
In Computer Networks and Communications
In Information Systems
- Christian Kästner
- Sven Apel
- Gunter Saake
- Don S. Batory
- Grigore Roşu
- Thomas Thüm
- Krzysztof Czarnecki
- Ina Schaefer
Citations in the corpus
- Feature-Oriented Software Product Lines (2013, background): “Finally, a basic dynamic crosscutting concern addresses only simple events; advanced dynamic crosscutting concerns can specify composite events and event patterns, for example, trace matches are executed when events fire in a specific pattern, thus, involving the history of computation (Allan et al.”
- Mop: an efficient and generic runtime verification framework (2007, methodology): “In particular, the safe enumerator example in Figure 4, the examples supported by other runtime verification systems such as Tracematches [2], PQL [38] and PTQL [27], as well as most of the examples in Sections 6 were previously not possible to define in MOP using formal specifications.”
- Finding application errors and security flaws using PQL: a program query language (2005, unknown): “[2] extend this further by permi tting PQL-like free variables in the patterns.”