Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Georg Moser, Andreas Schnabl
Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity
RTA, 2011.

RTA 2011
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{RTA-2011-MoserS,
	author        = "Georg Moser and Andreas Schnabl",
	booktitle     = "{Proceedings of the 22nd International Conference on Rewriting Techniques and Applications}",
	doi           = "10.4230/LIPIcs.RTA.2011.235",
	editor        = "Manfred Schmidt-Schauß",
	isbn          = "978-3-939897-30-9",
	pages         = "235--250",
	publisher     = "{Schloss Dagstuhl — Leibniz-Zentrum für Informatik}",
	series        = "{Leibniz International Proceedings in Informatics}",
	title         = "{Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity}",
	volume        = 10,
	year          = 2011,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.