Efficient monitoring of ω-languages

Lecture Notes in Computer Science

Volumn 3576, Issue , 2005, Pages 364-378

  D'Amorim, Marcelo ^a   Roşu, Grigore ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE AUTOMATA; STATISTICAL METHODS; TREES (MATHEMATICS);

BINARY TRANSITION TREE; BÜCHI AUTOMATA; FINITE STATE MACHINES; Ω-REGULAR LANGUAGES;

FORMAL LANGUAGES;

EID: 26444539487     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11513988_36     Document Type: Conference Paper

References (33)

1. MOP website, LTL plugin. http://fsl.cs.uiuc.edu/mop/repository.jsp?ltype= LTL.
2. C. Artho, D. Drusinsky, A. Goldberg, K. Havelund, M. Lowry, C. Pǎsǎreanu, G. Roşu, W. Visser, and R. Washington. Automated Testing using Symbolic Execution and Temporal Monitoring. Theoretical Computer Sci., to appear, 2005.
3. H. Barringer, A. Goldberg, K. Havelund, and K. Sen. Rule-Based Runtime Verification. In Proceedings of VMCAI'04, volume 2937 of LNCS, pages 44-57, 2004.
4. I. Beer, S. Ben-David, and A. Landver. On-the-Fly Model Checking of RCTL Formulas. In Proceedings of CAV '98, pages 184-194, London, UK, 1998. Springer.
5. J. R. Büchi. On a Decision Method in Restricted Second Order Arithmetic. Logic, Methodology and Philosophy of Sciences. Stanford University Press, 1962.
6. F. Chen, M. d'Amorim, and G. Roşu. A Formal Monitoring-Based Framework for Software Development and Analysis. In Proceedings of ICFEM'04, volume 3308 of LNCS, pages 357-372, 2004.
7. F. Chen and G. Roşu. Towards Monitoring-Oriented Programming: A Paradigm Combining Specification and Implementation. In Proceedings of RV'03, volume 89 of ENTCS, pages 106-125, 2003.
8. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, Cambridge, Massachusetts, 1999.
9. M. d'Amorim and G. Roşu. Efficient monitoring of ω-languages. Technical Report UIUCDCS-R-2005-2530, University of Illinois Urbana-Champaign, March 2005.
10. S. Dudani, J. Geada, G. Jakacki, and D. Vainer. Dynamic Assertions Using TXP. ENTCS, 55(2), 2001.
11. K. Etessami and G. Holzmann. Optimizing Büchi Automata. In Proc. of Int. Conf. on Concurrency Theory, volume 1877 of LNCS, pages 153-167. Springer, 2000.
12. J. Ezick. An Optimizing Compiler for Batches of Temporal Logic Formulas. In Proceedings of ISSTA '04, pages 183-194. ACM Press, 2004.
13. P. Gastin and D. Oddoux. LTL with Past and Two-Way Very-Weak Alternating Automata. In Proceedings of MFCS'03, number 2747 in LNCS, pages 439-448. Springer, 2003.
14. M. Geilen. On the Construction of Monitors for Temporal Logic Properties. In Proceedings of RV'01, volume 55 of ENTCS. Elsevier Science, 2001.
15. R. Gerth, D. Peled, M. Y. Vardi, and P. Wolper. Simple on-the-fly Automatic Verification of Linear Temporal Logic. In Proceedings of the 15th IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV, pages 3-18. Chapman & Hall, Ltd., 1996.
16. K. Havelund and G. Roşu. Monitoring Java Programs with Java PathExplorer. In Proceedings of RV'01, volume 55 of ENTCS. Elsevier Science, 2001.
17. K. Havelund and G. Roşu. Workshops on Runtime Verification (RV'01, RV'02, RV'04), volume 55, 70(4), to appear of ENTCS. Elsevier, 2001, 2002, 2004.
18. K. Havelund and G. Roşu. Synthesizing Monitors for Safety Properties. In Proceedings of TACAS'02, volume 2280 of LNCS, pages 342-356. Springer, 2002.
19. G. Holzmann. The Model Checker SPIN. IEEE Transactions on Software Engineering, 23(5):279-295, 1997.
20. Y. Kesten, Z. Manna, H. McGuire, and A. Pnueli. A Decision Algorithm for Full Prepositional Temporal Logic. In Proceedings of CAV'93, volume 697 of LNCS, pages 97-109. Springer, 1993.
21. M. Kim, S. Kannan, I. Lee, and O. Sokolsky. Java-MaC: a Run-time Assurance Tool for Java. In Proceedings of RV'01, volume 55 of ENTCS. Elsevier Sci., 2001.
22. O. Kupferman and M. Y. Vardi. Model Checking of Safety Properties. In Proceedings of CAV '99, volume 1633 of LNCS, pages 172-183. Springer, 1999.
23. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer, New York, 1995.
24. N. Markey. Temporal Logic with Past is Exponentially more Succinct. EATCS Bulletin, 79:122-128, 2003.
25. B. Moret. Decision Trees and Diagrams. ACM Comp. Surv., 14(4):593-623, 1982.
26. D. Oddoux and P. Gastin. LTL2BA. http://www.liafa.jussieu.fr/~oddoux/ ltl2ba/.
27. G. Roşu and K. Havelund. Rewriting-Based Techniques for Runtime Verification. Journal of Automated Software Engineering, 12(2):151-197, 2005.
28. J. Ruf, D. Hoffmann, T. Kropf, and W. Rosenstiel. Simulation-Guided Property Checking Based on Multi-Valued AR-Automata. In Proceedings of DATE'01, pages 742-749, London, UK, 2001. IEEE Computer Society.
29. K. Sen, G. Roşu, and G. Agha. Online Efficient Predictive Safety Analysis of Multithreaded Programs. In Proceedings of TACAS'04, volume 2988 of LNCS, pages 123-138. Springer, 2002.
30. A. P. Sistla and E. M. Clarke. The Complexity of Propositional Linear Temporal Logics. Journal of the ACM, 32(3):733-749, 1985.
31. O. Sokolsky and M. Viswanathan. Workshop on Runtime Verification (RV'03), volume 89 of ENTCS. Elsevier, 2003.
32. P. Thati and G. Roşu. Monitoring Algorithms for Metric Temporal Logic. In Proceedings of RV'04, volume (to appear) of ENTCS. Elsevier Science, 2004.
33. P. Wolper. Constructing Automata from Temporal Logic Formulas: a Tutorial, volume 2090 of LNCS, pages 261-277. Springer, 2002.