Relaxation refinement: A new method to generate heuristic functions

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

Volumn 5348 LNAI, Issue , 2009, Pages 147-165

  Smaus, Jan Georg ^a   Hoffmann, Jörg ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b SAP RESEARCH   (Germany)

Author keywords

Abstraction refinement; Directed model checking; Predicate abstraction; Timed automata

Indexed keywords

ABSTRACTION REFINEMENT; DIRECTED MODEL CHECKING; HEURISTIC FUNCTIONS; HEURISTIC SOLUTIONS; PREDICATE ABSTRACTION; TIMED AUTOMATA;

ABSTRACTING; ARTIFICIAL INTELLIGENCE; HEURISTIC ALGORITHMS; HEURISTIC METHODS; ROBOTS; TRANSLATION (LANGUAGES);

MODEL CHECKING;

EID: 63449135274     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00431-5_10     Document Type: Conference Paper

References (25)

1. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183-235 (1994)
2. Ball, T., Podelski, A., Rajamani, S.K.: Completeness of abstraction refinement for software model checking. In: Katoen, J.-R, Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280. Springer, Heidelberg (2002)
3. Ball, T., Podelski, A., Rajamani, S.K.: Boolean and Cartesian abstraction for model checking C programs. International Journal on Software Tools for Technology Transfer 5(1), 49-58 (2003)
4. Behrmann, G., David, A., Larsen, K.G.: A tutorial on Uppaal. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 200-236. Springer, Heidelberg (2004)
5. Bengtsson, J., Yi, W.: Timed automata: Semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol. 3098, pp. 87-124. Springer, Heidelberg (2004)
6. Clarke, E., Gupta, A., Strichman, O.: SAT-based counterexample-guided abstraction refinement. IEEE Transactions on Computer Aided Design 23(7), 1113-1123 (2004)
7. Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proceedings of the 4th ACM Symposium on Principles of Programming Languages, pp. 238-252 (1977)
8. Culberson, J.C., Schaeffer, J.: Pattern databases. Computational Intelligence 14(3), 318-334 (1998)
9. Dierks, H.: Comparing model checking and logical reasoning for real-time systems. Formal Aspects of Computing 16(2), 104-120 (2004)
10. 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)
11. 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 5(2-3), 247-267 (2004)
12. Edelkamp, S., Lluch-Lafuente, A.: Abstraction in directed model checking. In: Proceedings of the ICAPS Workshop on Connecting Planning Theory with Practice, pp. 7-13 (2004)
13. Filliâtre, J.-C., Owre, S., Rueß, H., Shankar, N.: ICS: Integrated canonizer and solver. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 246-249. Springer, Heidelberg (2001)
14. Graf, S., Saïdi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 72-83. Springer, Heidelberg (1997)
15. Hoffmann, J., Koehler, J.: A new method to index and query sets. In: Dean, T. (ed.) Proceedings of the 16th International Joint Conference on Artificial Intelligence, pp. 462-467. Morgan Kaufmann, San Francisco (1999)
16. 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)
17. Korf, R.E.: Finding optimal solutions to Rubik's Cube using pattern databases. In: Proceedings of the 14th National Conference on Artificial Intelligence and 9th Innovative Applications of Artificial Intelligence Conference, pp. 700-705. MIT Press, Cambridge (1997)
18. 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)
19. 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)
20. 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)
21. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference, pp. 530-535. ACM Press, New York (2001)
22. Pearl, J.: Heuristic. Addison-Wesley, Reading (1985)
23. Podelski, A., Rybalchenko, A.: ARMC: The logical choice for software model checking with abstraction refinement. In: Hanus, M. (ed.) PADL 2007. LNCS, vol. 4354, pp. 245-259. Springer, Heidelberg (2007)
24. Qian, K., Nymeyer, A.: Abstraction-based model checking using heuristical refinement. In: Wang, F. (ed.) ATVA 2004. LNCS, vol. 3299, pp. 165-178. Springer, Heidelberg (2004)
25. 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)