On the Complexity of Termination Inference for Processes

Romain Demangeon, Daniel Hirschkoff, Naoki Kobayashi, Davide Sangiorgi. On the Complexity of Termination Inference for Processes. In Gilles Barthe, Cédric Fournet, editors, Trustworthy Global Computing, Third Symposium, TGC 2007, Sophia-Antipolis, France, November 5-6, 2007, Revised Selected Papers. Volume 4912 of Lecture Notes in Computer Science, pages 140-155, Springer, 2007. [doi]

@inproceedings{DemangeonHKS07,
  title = {On the Complexity of Termination Inference for Processes},
  author = {Romain Demangeon and Daniel Hirschkoff and Naoki Kobayashi and Davide Sangiorgi},
  year = {2007},
  doi = {10.1007/978-3-540-78663-4_11},
  url = {http://dx.doi.org/10.1007/978-3-540-78663-4_11},
  tags = {termination},
  researchr = {https://researchr.org/publication/DemangeonHKS07},
  cites = {0},
  citedby = {0},
  pages = {140-155},
  booktitle = {Trustworthy Global Computing, Third Symposium, TGC 2007, Sophia-Antipolis, France, November 5-6, 2007, Revised Selected Papers},
  editor = {Gilles Barthe and Cédric Fournet},
  volume = {4912},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-78662-7},
}