Information Technology Reference
In-Depth Information
7. Bauer, A., K uster, J.-C., Vegliach, G.: From propositional to first-order monitoring. Comput-
ing Research Repository (CoRR) abs/1303.3645. ACM (March 2013)
8. Bauer, A., Leucker, M., Schallhart, C.: Runtime verification for LTL and TLTL. ACM Trans-
actions on Software Engineering and Methodology 20(4), 14 (2011)
9. 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)
10. Chomicki, J.: Efficient checking of temporal integrity constraints using bounded history en-
coding. ACM Trans. Database Syst. 20(2), 149-186 (1995)
11. Chomicki, J., Niwinski, D.: On the feasibility of checking temporal integrity constraints. J.
Comput. Syst. Sci. 51(3), 523-535 (1995)
12. Dong, W., Leucker, M., Schallhart, C.: Impartial anticipation in runtime-verification. In:
Cha, S(S.), Choi, J.-Y., Kim, M., Lee, I., Viswanathan, M. (eds.) ATVA 2008. LNCS,
vol. 5311, pp. 386-396. Springer, Heidelberg (2008)
13. Dwyer, M., Avrunin, G., Corbett, J.: Patterns in property specifications for finite-state verifi-
cation. In: Proc. 21st Intl. Conf. on Softw. Eng. (ICSE), pp. 411-420. IEEE (1999)
14. Eisner, C., Fisman, D., Havlicek, J., Lustig, Y., McIsaac, A., Van Campenhout, D.: Reasoning
with temporal logic on truncated paths. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003.
LNCS, vol. 2725, pp. 27-39. Springer, Heidelberg (2003)
15. Genon, A., Massart, T., Meuter, C.: Monitoring distributed controllers: When an efficient
LTL algorithm on sequences is needed to model-check traces. In: Misra, J., Nipkow, T.,
Sekerinski, E. (eds.) FM 2006. LNCS, vol. 4085, pp. 557-572. Springer, Heidelberg (2006)
16. Halle, S., Villemaire, R.: Runtime monitoring of message-based workflows with data. In:
Proc. 12th Enterprise Distr. Object Comp. Conf. (EDOC), pp. 63-72. IEEE (2008)
17. Havelund, K., Rosu, G.: Efficient monitoring of safety properties. Software Tools for Tech-
nology Transfer 6(2), 158-173 (2004)
18. Jin, D., Meredith, P.O., Lee, C., Rosu, G.: JavaMOP: Efficient parametric runtime monitoring
framework. In: Proc. 34th Intl. Conf. on Softw. Eng. (ICSE), pp. 1427-1430. IEEE (2012)
19. Kuhtz, L., Finkbeiner, B.: Efficient parallel path checking for linear-time temporal logic with
past and bounds. Logical Methods in Computer Science 8(4) (2012)
20. Libkin, L.: Elements of Finite Model Theory. Springer (2004)
21. Markey, N., Schnoebelen, P.: Model checking a path. In: Amadio, R.M., Lugiez, D. (eds.)
CONCUR 2003. LNCS, vol. 2761, pp. 251-265. Springer, Heidelberg (2003)
22. Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. J.
ACM 32(3), 733-749 (1985)
23. Sistla, A.P., Wolfson, O.: Temporal triggers in active databases. IEEE Trans. Knowl. Data
Eng. 7(3), 471-486 (1995)
24. Stolz, V.: Temporal assertions with parametrized propositions. J. Log. Comp. 20(3), 743-757
(2010)
 
Search WWH ::




Custom Search