Certifying Confluence Proofs via Relative Termination and Rule Labeling. Nagele, J., Felgenhauer, B., & Zankl, H. Logical Methods in Computer Science, 2017.
Certifying Confluence Proofs via Relative Termination and Rule Labeling. [link]Link  Certifying Confluence Proofs via Relative Termination and Rule Labeling. [link]Paper  bibtex   
@article{journals/lmcs/NageleFZ17,
  added-at = {2020-01-14T00:00:00.000+0100},
  author = {Nagele, Julian and Felgenhauer, Bertram and Zankl, Harald},
  biburl = {https://www.bibsonomy.org/bibtex/232a32bbdfa527260e15ea832450c0330/dblp},
  ee = {https://doi.org/10.23638/LMCS-13(2:4)2017},
  interhash = {a8d667e998fbdc9603c5237bb330765c},
  intrahash = {32a32bbdfa527260e15ea832450c0330},
  journal = {Logical Methods in Computer Science},
  keywords = {dblp},
  number = 2,
  timestamp = {2020-01-15T11:39:24.000+0100},
  title = {Certifying Confluence Proofs via Relative Termination and Rule Labeling.},
  url = {http://dblp.uni-trier.de/db/journals/lmcs/lmcs13.html#NageleFZ17},
  volume = 13,
  year = 2017
}
Downloads: 0