Context-enhanced directed model checking

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

Volumn 6349 LNCS, Issue , 2010, Pages 88-105

  Wehrle, Martin ^a   Kupferschmid, Sebastian ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BASIC IDEA; CONCURRENT SYSTEMS; ERROR-STATE; NON-TRIVIAL; NOVEL TECHNIQUES; SEARCH METHOD; SEARCH TECHNIQUE; STANDARD MODEL; STATE EXPLOSION PROBLEMS; STATE SPACE; WELL-ESTABLISHED TECHNIQUES; CASE-STUDIES;

MODEL CHECKING;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 78149373614     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16164-3_7     Document Type: Conference Paper

References (24)

1. Edelkamp, S., Schuppan, V., Bosnacki, D., Wijs, A., Fehnker, A., Aljazzar, H.: Survey on directed model checking. In: Peled, D.A., Wooldridge, M.J. (eds.) MoChArt 2008. LNCS, vol. 5348, pp. 65-89. Springer, Heidelberg (2009)
2. Kupferschmid, S., Hoffmann, J., Dierks, H., Behrmann, G.: Adapting an AI planning heuristic for directed model checking. In: Valmari, A. (ed.) SPIN 2006. LNCS, vol. 3925, pp. 35-52. Springer, Heidelberg (2006)
3. Dräger, K., Finkbeiner, B., Podelski, A.: Directed model checking with distance-preserving abstractions. International Journal on Software Tools for Technology Transfer 11(1), 27-37 (2009)
4. Hoffmann, J., Smaus, J.G., Rybalchenko, A., Kupferschmid, S., Podelski, A.: Using predicate abstraction to generate heuristic functions in Uppaal. In: Edelkamp, S., Lomuscio, A. (eds.) MoChArt 2007. LNCS (LNAI), vol. 4428, pp. 51-66. Springer, Heidelberg (2007)
5. Smaus, J.G., Hoffmann, J.: Relaxation refinement: A new method to generate heuristic functions. In: Peled, D.A., Wooldridge, M.J. (eds.) MoChArt 2008. LNCS, vol. 5348, pp. 146-164. Springer, Heidelberg (2009)
6. Edelkamp, S., Leue, S., Lluch-Lafuente, A.: Directed explicit-state model checking in the validation of communication protocols. International Journal on Software Tools for Technology Transfer 5(2), 247-267 (2004)
7. Qian, K., Nymeyer, A.: Guided invariant model checking based on abstraction and symbolic pattern databases. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 497-511. Springer, Heidelberg (2004)
8. Kupferschmid, S., Hoffmann, J., Larsen, K.G.: Fast directed model checking via russian doll abstraction. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 203-217. Springer, Heidelberg (2008)
9. Wehrle, M., Helmert, M.: The causal graph revisited for directed model checking. In: Palsberg, J., Su, Z. (eds.) SAS 2009. LNCS, vol. 5673, pp. 86-101. Springer, Heidelberg (2009)
10. Hoffmann, J., Nebel, B.: The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14, 253-302 (2001)
11. Helmert, M.: The Fast Downward planning system. Journal of Artificial Intelligence Research 26, 191-246 (2006)
12. Wehrle, M., Kupferschmid, S., Podelski, A.: Useless actions are useful. In: Rintanen, J., Nebel, B., Beck, J.C., Hansen, E. (eds.) Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS 2008), pp. 388-395. AAAI Press, Menlo Park (2008)
13. Wehrle, M., Kupferschmid, S., Podelski, A.: Transition-based directed model checking. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 186-200. Springer, Heidelberg (2009)
14. Musuvathi, M., Qadeer, S.: Iterative context bounding for systematic testing of multithreaded programs. In: Ferrante, J., McKinley, K.S. (eds.) Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation (PLDI 2007), pp. 446-455. ACM Press, New York (2007)
15. Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison- Wesley, Reading (1984)
16. Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4(2), 100-107 (1968)
17. Godefroid, P.: Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State-Explosion Problem. LNCS, vol. 1032. Springer, Heidelberg (1996)
18. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (2000)
19. Edelkamp, S., Leue, S., Lluch-Lafuente, A.: Partial-order reduction and trail improvement in directed model checking. International Journal on Software Tools for Technology Transfer 6(4), 277-301 (2004)
20. Kupferschmid, S., Wehrle, M., Nebel, B., Podelski, A.: Faster than Uppaal? In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 552-555. Springer, Heidelberg (2008)
21. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183-235 (1994)
22. Dierks, H.: Comparing model-checking and logical reasoning for real-time systems. Formal Aspects of Computing 16(2), 104-120 (2004)
23. Krieg-Brückner, B., Peleska, J., Olderog, E.-R., Baer, A.: The UniForM workbench, a universal development environment for formal methods. In:Woodcock, J.C.P., Davies, J.,Wing, J.M. (eds.) FM 1999. LNCS, vol. 1709, pp. 1186-1205. Springer, Heidelberg (1999)
24. Lamport, L.: A fast mutual exclusion algorithm. ACM Transactions on Computer Systems 5(1), 1-11 (1987)