Debugging of dependability models using interactive visualization of counterexamples

Proceedings - 5th International Conference on the Quantitative Evaluation of Systems, QEST 2008

Volumn , Issue , 2008, Pages 189-198

  Aljazzar, Husain ^a   Leue, Stefan ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MODEL CHECKING; MODEL STRUCTURES; STOCHASTIC CONTROL SYSTEMS; VISUALIZATION;

CASE STUDIES; DEPENDABILITY MODELS; EXECUTION PATHS; INTERACTIVE VISUALIZATIONS; PROTOTYPE TOOLS; STOCHASTIC SYSTEMS; VISUALIZATION METHODS;

STOCHASTIC MODELS;

EID: 56649116047     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2008.40     Document Type: Conference Paper

References (25)

1. H. Aljazzar, H. Hermanns, and S. Leue. Counterexamples for timed probabilistic reachability. In Proceedings of 3rd International Conference of Formal Modeling and Analysis of Timed Systems (FORMATS), volume 3829 of Lecture Notes in Computer Science, pages 177-195. Springer, 2005.
2. H. Aljazzar and S. Leue. Extended directed search for probabilistic timed reachability. In Proceedings of 4th International Conference of Formal Modeling and Analysis of Timed Systems (FORMATS), volume 4202 of Lecture Notes in Computer Science, pages 33-51. Springer, 2006.
3. H. Aljazzar and S. Leue. Counterexamples for model checking of markov decision processes. Technical Report soft-08-01, Chair for Software Engineering, University of Konstanz, Gemany, December 2007. submitted for publication.
4. H. Aljazzar and S. Leue. K*: A directed on-the-fly algorithm for finding the k shortest paths. Technical Report soft-08-03, Chair for Software Engineering, University of Konstanz, Gemany, March 2008. submitted for publication.
5. A. Altintop. Using color effectively in visualization, 2002.
6. R. Alur and T. A. Henzinger. Reactive modules. Formal Methods in System Design, 15(1):7-48, 1999.
7. A. Aziz, K. Sanwal, V. Singhal, and R. Brayton. Modelchecking continuous-time markov chains. ACM Trans. Comput. Logic, 1(1):162-170, 2000.
8. C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. Model-checking algorithms for continuous-time Markov chains. IEEE Transions on Software Engineering, 29(7), 2003.
9. C. Baier and J.-P. Katoen. Principles of Model Checking. The MIT Press, 2008.
10. G. D. Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall PTR, Upper Saddle River, NJ, USA, 1998.
11. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, 1999 (third printing 2001).
12. A. Groce, S. Chaki, D. Kroening, and O. Strichman. Error explanation with distance metrics. International Journal on Software Tools for Technology Transfer (STTT), 8(3), 2006.
13. A. Groce and W. Visser. What went wrong: Explaining counterexamples. In Workshop on Software Model Checking (SPIN), Lecture Notes in Computer Science 2648, pages 121-135. Springer, 2003.
14. J. F. Groote and F. van Ham. Interactive visualization of large state spaces. Int. J. Softw. Tools Technol. Transf., 8(1):77-91, 2006.
15. T. Han and J.-P. Katoen. Counterexamples in probabilistic model checking. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 13th International Conference, 2007.
16. T. Han and J.-P. Katoen. Providing evidence of likely being on time: Counterexample generation for ctmc model checking. In K. S. Namjoshi, T. Yoneda, T. Higashino, and Y. Okamura, editors, ATVA, volume 4762 of Lecture Notes in Computer Science, pages 331-346. Springer, 2007.
17. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Asp. Comput., 6(5):512-535, 1994.
18. B. R. Haverkort, H. Hermanns, and J.-P. Katoen. On the use of model checking techniques for dependability evaluation. In SRDS, pages 228-237, 2000.
19. A. Hinton, M. Kwiatkowska, G. Norman, and D. Parker. PRISM: A tool for automatic verification of probabilistic systems. In H. Hermanns and J. Palsberg, editors, Proc. 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'06), volume 3920 of LNCS, pages 441-444. Springer, 2006.
20. V. M. Jiménez and A. Marzal. Computing the k shortest paths: A new algorithm and an experimental comparison. In Algorithm Engineering, pages 15-29, 1999.
21. S. Mukherjea and J. T. Stasko. Applying algorithm animation techniques for program tracing, debugging, and understanding. In ICSE '93: Proceedings of the 15th international conference on Software Engineering, pages 456-465, Los Alamitos, CA, USA, 1993. IEEE Computer Society Press.
22. S. Mukherjea and J. T. Stasko. Toward visual debugging: integrating algorithm animation capabilities within a source-level debugger. ACM Trans. Comput.-Hum. Interact., 1(3):215-244, 1994.
23. J. Muppala, G. Ciardo, and K. Trivedi. Stochastic reward nets for reliability prediction. Communications in Reliability, Maintainability and Serviceability, 1(2):9-20, July 1994.
24. J. Pearl. Heuristics - Intelligent Search Strategies for Computer Problem Solving. Addision-Wesley, 1986.
25. yWorks GmbH. yfiles library for java, 2007. http://www.yworks.com/en/ products_yfiles_about.htm.