Quantified event automata: Towards expressive and efficient runtime monitors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7436 LNCS, Issue , 2012, Pages 68-84

  Barringer, Howard ^a   Falcone, Yliès ^b   Havelund, Klaus ^c   Reger, Giles ^a   Rydeheard, David ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

^b UNIV GRENOBLE ALPES   (France)

^c CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL SYSTEM; DATA VALUES; RUN-TIME VERIFICATION; RUNTIME MONITORS;

ARTIFICIAL INTELLIGENCE;

SPECIFICATIONS;

EID: 84865957601     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-32759-9_9     Document Type: Conference Paper

References (15)

1. Allan, C., Avgustinov, P., Christensen, A.S., Hendren, L., Kuzins, S., Lhoták, O., de Moor, O., Sereni, D., Sittampalam, G., Tibble, J.: Adding trace matching with free variables to AspectJ. SIGPLAN Not. 40, 345-364 (2005)
2. Barringer, H., Goldberg, A., Havelund, K., Sen, K.: Rule-Based Runtime Verification. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 44-57. Springer, Heidelberg (2004)
3. Barringer, H., Groce, A., Havelund, K., Smith, M.: Formal analysis of log files. Journal of Aerospace Computing, Information, and Communication (2010)
4. Barringer, H., Havelund, K.: TRACECONTRACT:A Scala DSL for Trace Analysis. In: Butler, M., Schulte, W. (eds.) FM 2011. LNCS, vol. 6664, pp. 57-72. Springer, Heidelberg (2011)
5. Barringer, H., Rydeheard, D., Havelund, K.: Rule systems for run-time monitoring: from EAGLE to RuleR. J. Logic Computation 20(3), 675-706 (2010)
6. Bauer, A., Leucker, M., Schallhart, C.: The Good, the Bad, and the Ugly, But How Ugly Is Ugly? In: Sokolsky, O., Taşiran, S. (eds.) RV 2007. LNCS, vol. 4839, pp. 126-138. Springer, Heidelberg (2007)
7. Chen, F., Roşu, G.: Parametric Trace Slicing and Monitoring. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 246-261. Springer, Heidelberg (2009)
8. Falcone, Y., Fernandez, J.-C., Mounier, L.: What can you verify and enforce at runtime? STTT 14(3), 349-382 (2012)
9. Havelund, K., Goldberg, A.: Verify Your Runs. In: Meyer, B., Woodcock, J. (eds.) VSTTE 2005. LNCS, vol. 4171, pp. 374-383. Springer, Heidelberg (2008)
10. Leucker, M., Schallhart, C.: A brief account of runtime verification. Journal of Logic and Algebraic Programming 78(5), 293-303 (2008)
11. Meredith, P., Jin, D., Griffith, D., Chen, F., Ros̄u, G.: An overview of the MOP runtime verification framework. J. Software Tools for Technology Transfer, 1-41 (2011)
12. Runtime Verification, http://www.runtime-verification.org (2001-2011)
13. Stolz, V.: Temporal assertions with parametrized propositions*. J. Log. and Comput. 20, 743-757 (2010)
14. Stolz, V., Bodden, E.: Temporal assertions using AspectJ. In: Proc. of the 5th Int. Workshop on Runtime Verification (RV 2005). ENTCS, vol. 144(4), pp. 109-124. Elsevier (2006)
15. Stolz, V., Huch, F.: Runtime verification of concurrent Haskell programs. In: Proc. of the 4th Int. Workshop on Runtime Verification (RV 2004). ENTCS, vol. 113, pp. 201-216. Elsevier (2005)