@Incollection{ArmandoCompagna-sat03,
  author    =  {A.~Armando and L.~Compagna},
  title     =  {{A}bstraction-driven {SAT}-based {A}nalysis of
                {S}ecurity {P}rotocols}, 
  booktitle =  {Theory and Applications of Satisfiability Testing},
  series    =  {LNCS 2919},
  publisher =  {Springer-Verlag}, 
  year      =  2004,
  editor    =  {Enrico Giunchiglia and
                Armando Tacchella},
  pages     =  "257--271",
  isbn      =  {3-540-20851-8}, 
  note      =  {Selected Revised Papers. Presented to SAT 2003, S.~Margherita Ligure, Italy. Available at
                \url{www.avispa-project.org}},
  abstract = "In previous work we proposed an approach to the automatic            
	      translation of protocol insecurity problems into propositional logic 
	      with the ultimate goal of building an automatic model-checker for    
	      security protocols based on state-of-the-art SAT solvers.  In this   
	      paper we present an improved procedure based on an                   
	      abstraction/refinement strategy which, by interleaving the encoding  
	      and solving phases, leads to a significant improvement of the        
	      overall performance of our model-checker."
}