Impartial anticipation in runtime-verification

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

Volumn 5311 LNCS, Issue , 2008, Pages 386-396

  Dong, Wei ^a   Leucker, Martin ^b   Schallhart, Christian ^c  

^a NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^c DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; SEMANTICS;

AUTOMATA-THEORETIC APPROACH; CONCEPTUAL FRAMEWORKS; CORRECTNESS PROPERTIES; LINEAR TIME; LINEAR TIME LOGIC; LOGICAL SPECIFICATIONS; RUN-TIME VERIFICATION; THREE-VALUED;

TEMPORAL LOGIC;

EID: 56749144284     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88387-6_33     Document Type: Conference Paper

References (14)

1. Bauer, A., Leucker, M., Schallhart, C.: The good, the bad, and the ugly-but how ugly is ugly? In: Sokolsky, O., Taşaran, S. (eds.) RV 2007. LNCS, vol. 4839, pp. 126-138. Springer, Heidelberg (2007)
2. Pnueli, A.: The temporal logic of programs. In: Proceedings of the 18th IEEE Symposium on the Foundations of Computer Science (FOCS), pp. 46-57 (1977)
3. Bauer, A., Leucker, M., Schallhart, C.: Monitoring of real-time properties. In: ArunKumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337. Springer, Heidelberg (2006)
4. Bauer, A., Leucker, M., Schallhart, C.: Runtime verification for LTL and TLTL. Technical Report TUM-I0724, TU München (2007)
5. Demri, S.: LTL over integer periodicity constraints. Theoretical Computer Science 360(1-3), 96-123 (2006)
6. Emerson, E.A., Clarke, E.M.: Characterizing correctness properties of parallel programs using fixpoints. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 169-181. Springer, Heidelberg (1980)
7. Vardi, M.Y.: A temporal fixpoint calculus. In: POPL, pp. 250-259 (1988)
8. Büchi, J.: Weak second order logic and finite automata. Z. Math. Logik, Grundlag. Math. 5, 62-66 (1960)
9. Leucker, M., Sánchez, C.: Regular linear temporal logic. In: Jones, C.B., Liu, Z., Woodcock, J. (eds.) ICTAC 2007. LNCS, vol. 4711, pp. 291-305. Springer, Heidelberg (2007)
10. Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Logic in Computer Science (LICS), pp. 332-345 (1986)
11. Raskin, J.F., Schobbens, P.Y.: State clock logic: A decidable real-time logic. In: Maler, O. (ed.) HART 1997. LNCS, vol. 1201, pp. 33-47. Springer, Heidelberg (1997)
12. Laroussinie, F., Markey, N., Schnoebelen, P.: Temporal logic with forgettable past. In: LICS (2002)
13. Barringer, H., Kuiper, R., Pnueli, A.: A really abstract concurrent model and its temporal logic. In: POPL, pp. 173-183 (1986)
14. Lange, M.: Weak automata for the linear time μ-calculus. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 267-281. Springer, Heidelberg (2005)