@InProceedings{	  pretschner:classical:2001,
  abstract	= { Test case generation for concurrent reactive systems on
		  the grounds of symbolic execution basically amounts to
		  searching their state space. As in the case of model
		  checkers, different search strategies (depth-first,
		  breadth-first, best-first, tabu) together with different
		  strategies for storing visited states have a significant
		  impact on the performance of the generation algorithm. We
		  present experimental data for the performance of different
		  search strategies and discuss the results, taking into
		  account counter examples as generated by model checkers. },
  author	= {A. Pretschner},
  booktitle	= {Proc. Formal Approaches to Testing of Software},
  language	= {USenglish},
  month		= {August},
  pages		= {47--60},
  title		= { Classical search strategies for test case generation with
		  Constraint Logic Programming},
  year		= 2001,
  user		= {pretscha}
}