Transition-based directed model checking

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

Volumn 5505 LNCS, Issue , 2009, Pages 186-200

  Wehrle, Martin ^a   Kupferschmid, Sebastian ^a   Podelski, Andreas ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DISTANCE FUNCTIONS; EMPIRICAL EVALUATIONS; ERROR-STATE; MEMORY CONSUMPTION; SAFETY PROPERTY; STATE SPACE; STATE TRANSITIONS; SWEET SPOT; SYSTEM STATE; WELL-ESTABLISHED TECHNIQUES; FAST DETECTIONS;

ABSTRACTING; COMPUTER SOFTWARE; ECONOMIC AND SOCIAL EFFECTS; FUNCTION EVALUATION;

MODEL CHECKING;

EID: 70350627672     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00768-2_19     Document Type: Conference Paper

References (20)

1. Bonet, B., Geffner, H.: Planning as heuristic search. Artificial Intelligence 129(1-2), 5-33 (2001)
2. Dierks, H.: Comparing model-checking and logical reasoning for real-time systems. Formal Aspects of Computing 16(2), 104-120 (2004)
3. Dräger, K., Finkbeiner, B., Podelski, A.: Directed model checking with distance-preserving abstractions. In: Valmari, A. (ed.) SPIN 2006. LNCS, vol. 3925, pp. 19-34. Springer, Heidelberg (2006)
4. 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)
5. Edelkamp, S., Lluch-Lafuente, A., Leue, S.: Directed explicit model checking with HSFSPIN. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol. 2057, pp. 57-79. Springer, Heidelberg (2001)
6. Groce, A., Visser,W.: Heuristics for model checking Java programs. International Journal on Software Tools for Technology Transfer 6(4), 260-276 (2004)
7. Helmert, M.: The Fast Downward planning system. Journal of Artificial Intelligence Research 26, 191-246 (2006)
8. Hoffmann, J., Nebel, B.: The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14, 253-302 (2001)
9. 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 IV. LNCS, vol. 4428, pp. 51-66. Springer, Heidelberg (2007)
10. Krieg-Brückner, B., Peleska, J., Olderog, E.-R., Baer, A.: The UniF orMworkbench, 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)
11. Kupferschmid, S., Dräger, K., Hoffmann, J., Finkbeiner, B., Dierks, H., Podelski, A., Behrmann, G.: UPPAAL/DMC - abstraction-based heuristics for directed model checking. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 679-682. Springer, Heidelberg (2007)
12. 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)
13. 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)
14. 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)
15. Lamport, L.: A fast mutual exclusion algorithm. ACM Transactions on Computer Systems 5(1), 1-11 (1987)
16. Pearl, J.: Heuristics: Intelligent search strategies for computer problem solving. Addison- Wesley, Reading (1984)
17. 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)
18. Qian, K., Nymeyer, A., Susanto, S.: Abstraction-guided model checking using symbolic IDA* and heuristic synthesis. In: Wang, F. (ed.) FORTE 2005. LNCS, vol. 3731, pp. 275-289. Springer, Heidelberg (2005)
19. Seitz, C.L.: Ideas about arbiters. Lambda 1, 10-14 (1980)
20. Wehrle, M., Kupferschmid, S., Podelski, A.: Useless actions are useful. In: Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS 2008), pp. 388-395. AAAI Press, Menlo Park (2008)