Some complexity results for stateful network verification

Kalev Alpernas, Aurojit Panda, Alexander Rabinovich, Mooly Sagiv, Scott Shenker, Sharon Shoham, Yaron Velner. Some complexity results for stateful network verification. Formal Methods in System Design, 54(2):191-231, 2019. [doi]

@article{AlpernasPRSSSV19,
  title = {Some complexity results for stateful network verification},
  author = {Kalev Alpernas and Aurojit Panda and Alexander Rabinovich and Mooly Sagiv and Scott Shenker and Sharon Shoham and Yaron Velner},
  year = {2019},
  doi = {10.1007/s10703-018-00330-9},
  url = {https://doi.org/10.1007/s10703-018-00330-9},
  researchr = {https://researchr.org/publication/AlpernasPRSSSV19},
  cites = {0},
  citedby = {0},
  journal = {Formal Methods in System Design},
  volume = {54},
  number = {2},
  pages = {191-231},
}