Abstractions and pattern databases: The quest for succinctness and accuracy

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

Volumn 6605 LNCS, Issue , 2011, Pages 276-290

  Kupferschmid, Sebastian ^a   Wehrle, Martin ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENT SYSTEMS; DISTANCE ESTIMATORS; ERROR DISTANCE; ERROR-STATE; INDUSTRIAL PROBLEM; PATTERN DATABASE; SEARCH ALGORITHMS; STATE OF THE ART; WELL-ESTABLISHED TECHNIQUES; WIDE SPREADS;

ABSTRACTING; ALGORITHMS; MODEL CHECKING;

DATABASE SYSTEMS;

EID: 79953181675     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19835-9_26     Document Type: Conference Paper

References (23)

1. Alur, R., Dill, D.L.:A theory of timed automata. Theor. Comput. Sci. 126(2), 183-235 (1994)
2. Culberson, J.C., Schaeffer, J.: Pattern databases. Comp. Int. 14(3), 318-334 (1998)
3. Dierks, H.: Time, Abstraction and Heuristics - Automatic Verification and Planning of Timed Systems using Abstraction and Heuristics. Habilitation Thesis, University of Oldenburg, Germany (2005)
4. Dräger, K., Finkbeiner, B., Podelski, A.: Directed model checking with distance-preserving abstractions. STTT 11(1), 27-37 (2009)
5. Edelkamp, S.: Planning with pattern databases. In: Proc. ECP, pp. 13-24 (2001)
6. Edelkamp, S., Leue, S., Lluch-Lafuente, A.: Directed explicit-state model checking in the validation of communication protocols. STTT 5(2), 247-267 (2004)
7. Edelkamp, S., Schuppan, V., Bošnački, 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)
8. Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Systems Science and Cybernetics 4(2), 100-107 (1968)
9. Hart, P.E., Nilsson, N.J., Raphael, B.: Correction to a formal basis for the heuristic determination of minimum cost paths. SIGART Newsletter 37, 28-29 (1972)
10. 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 (LNAI), vol. 4428, pp. 51-66. Springer, Heidelberg (2007)
11. Kozen, D.: Lower bounds for natural proof systems. In: Proc. FOCS, pp. 254-266. IEEE Computer Society, Los Alamitos (1977)
12. 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. (eds.) FM 1999. LNCS, vol. 1709, pp. 1186-1205. Springer, Heidelberg (1999)
13. 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)
14. 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)
15. 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)
16. 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)
17. Olderog, E.R., Dierks, H.: Moby/RT: A tool for specification and verification of real-time systems. J. UCS 9(2), 88-105 (2003)
18. Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison- Wesley, Reading (1984)
19. 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)
20. 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. 147-165. Springer, Heidelberg (2009)
21. 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)
22. Wehrle, M., Kupferschmid, S.: Context-enhanced directed model checking. In: van de Pol, J., Weber, M. (eds.) Model Checking Software. LNCS, vol. 6349, pp. 88-105. Springer, Heidelberg (2010)
23. 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)