Reachability, confluence, and termination analysis with state-compatible automata. Felgenhauer, B. & Thiemann, R. Inf. Comput., 253:467-483, 2017.
Reachability, confluence, and termination analysis with state-compatible automata. [link]Link  Reachability, confluence, and termination analysis with state-compatible automata. [link]Paper  bibtex   
@article{journals/iandc/FelgenhauerT17,
  added-at = {2020-02-04T00:00:00.000+0100},
  author = {Felgenhauer, Bertram and Thiemann, René},
  biburl = {https://www.bibsonomy.org/bibtex/237453c6b1feecd4207a284cd0b1bc353/dblp},
  ee = {https://doi.org/10.1016/j.ic.2016.06.011},
  interhash = {72fe6390cb55507d38803a60fa6ba8eb},
  intrahash = {37453c6b1feecd4207a284cd0b1bc353},
  journal = {Inf. Comput.},
  keywords = {dblp},
  pages = {467-483},
  timestamp = {2020-02-05T11:44:38.000+0100},
  title = {Reachability, confluence, and termination analysis with state-compatible automata.},
  url = {http://dblp.uni-trier.de/db/journals/iandc/iandc253.html#FelgenhauerT17},
  volume = 253,
  year = 2017
}

Downloads: 0