Abstract
We extend our previous approach to runtime verification of a single finite path against a formula in Next-free Linear-Time Logic (LTL) with free variables and quantification. The existing approach is extended from event-based to set-based states, and the design-space of quantification is discussed. By introducing a binary operator that binds values based on the current state, we can dispense with the static analysis of a formula. The binding semantics of propositions containing quantified variables is simplified by a pure top-down evaluation. The alternating binding automaton corresponding to a formula is evaluated in a breadth-first manner, allowing us to instantly detect refuted formulae during execution.
Extended version published in [14]. Partially supported by the projects HighQSoftD and HTTSS funded by the Macao Science and Technology Development Fund.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allan, C., Avgustinov, P., Simon, A.S., Hendren, L., Kuzins, S., Lhoták, O., de Moor, O., Sereni, D., Sittamplan, G., Tibble, J.: Adding Trace Matching with Free Variables to AspectJ. In: OOPSLA 2005 (2005)
Barrigner, H., Rydeheard, D., Havelund, K.: Rule systems for run-time monitoring: from EAGLE to RULER. In: Sokolsky, O., Tasiran, S. (eds.) RV 2007. LNCS, vol. 4128, pp. 188–201. Springer, Heidelberg (2007)
Barringer, H., Goldberg, A., Havelund, K., Sen, K.: Rule-based runtime verification. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, Springer, Heidelberg (2004)
Bensalem, S., Havelund, K.: Dynamic deadlock analysis of multi-threaded programs. In: Ur, S., Bin, E., Wolfsthal, Y. (eds.) Hardware and Software, Verification and Testing. LNCS, vol. 3875, Springer, Heidelberg (2006)
Bodden, E., Hendren, L., Lhoták, O.: A staged static program analysis to improve the performance of runtime monitoring. In: Ernst, E. (ed.) ECOOP 2007. LNCS, vol. 4609, Springer, Heidelberg (2007)
Bodden, E., Stolz, V.: Tracechecks: Defining semantic interfaces with temporal logic. In: Löwe, W., Südholt, M. (eds.) SC 2006. LNCS, vol. 4089, Springer, Heidelberg (2006)
Douence, R., Fradet, P., Südholt, M.: Composition, reuse and interaction analysis of stateful aspects. In: Murphy, G.C., Lieberherr, K.J. (eds.) Proc. of the 3rd Intl. Conf. on Aspect-oriented software development (AOSD 2004). ACM (2004)
Finkbeiner, B., Sankaranarayanan, S., Sipma, H.: Collecting statistics over runtime executions. In: Havelund, K., Roşu, G. (eds.) Semantics of Concurrent Computation. ENTCS, vol. 70, Elsevier, Amsterdam (2002)
Havelund, K.: Using Runtime Analysis to Guide Model Checking of Java Programs. In: Havelund, K., Penix, J., Visser, W. (eds.) SPIN Model Checking and Software Verification. LNCS, vol. 1885, Springer, Heidelberg (2000)
Laddad, R.: AspectJ in Action: Practical Aspect-Oriented Programming. Manning Publications Co. (2003)
Martin, M., Livshits, B., Lam, M.S.: Finding application errors and security flaws using PQL: a program query language. In: OOPSLA 2005 (2005)
Sterling, L., Shapiro, E.: The Art of Prolog. MIT Press, Cambridge (1986)
Stolz, V., Huch, F.: Runtime Verification of Concurrent Haskell Programms. In: Havelund, K., Roşu, G. (eds.) Stochastic Automata: Stability, Nondeterminism and Prediction, vol. 113, Elsevier, Amsterdam (2005)
Stolz, V.: Temporal assertions for sequential and concurrent programs. Technical Report AIB-2007-15, RWTH Aachen University, August 2007. PhD thesis(2007), http://aib.informatik.rwth-aachen.de/2007/2007-15.pdf
Stolz, V., Bodden, E.: Temporal Assertions using AspectJ. In: Barringer, H., Finkbeiner, B., Gurevich, Y., Sipma, H. (eds.) ISSAC 1982 and EUROCAM 1982. ENTCS, vol. 144, Elsevier, Amsterdam (2005)
Vardi, M.Y.: An automata-theoretic approach to linear temporal logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency: Structure versus Automata. LNCS, vol. 1043, Springer, Heidelberg (1996)
Walker, R.J., Viggers, K.: Implementing protocols via declarative event patterns. In: Taylor, R.N., Dwyer, M.B. (eds.) Proc. of the 12th ACM SIGSOFT Intl. Symp. on Foundations of Software Engineering, ACM Press, New York (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stolz, V. (2007). Temporal Assertions with Parametrised Propositions. In: Sokolsky, O., Taşıran, S. (eds) Runtime Verification. RV 2007. Lecture Notes in Computer Science, vol 4839. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77395-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-77395-5_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77394-8
Online ISBN: 978-3-540-77395-5
eBook Packages: Computer ScienceComputer Science (R0)