Ordered Counter-Abstraction - Refinable Subword Relations for Parameterized Verification

Pierre Ganty, Ahmed Rezine. Ordered Counter-Abstraction - Refinable Subword Relations for Parameterized Verification. In Adrian Horia Dediu, Carlos Martín-Vide, José Luis Sierra-Rodríguez, Bianca Truthe, editors, Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Madrid, Spain, March 10-14, 2014. Proceedings. Volume 8370 of Lecture Notes in Computer Science, pages 396-408, Springer, 2014. [doi]

@inproceedings{GantyR14,
  title = {Ordered Counter-Abstraction - Refinable Subword Relations for Parameterized Verification},
  author = {Pierre Ganty and Ahmed Rezine},
  year = {2014},
  doi = {10.1007/978-3-319-04921-2_32},
  url = {http://dx.doi.org/10.1007/978-3-319-04921-2_32},
  researchr = {https://researchr.org/publication/GantyR14},
  cites = {0},
  citedby = {0},
  pages = {396-408},
  booktitle = {Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Madrid, Spain, March 10-14, 2014. Proceedings},
  editor = {Adrian Horia Dediu and Carlos Martín-Vide and José Luis Sierra-Rodríguez and Bianca Truthe},
  volume = {8370},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-04920-5},
}