Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
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

Martin Korp, Aart Middeldorp
Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
LATA, 2008.

LATA 2008
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{LATA-2008-KorpM,
	author        = "Martin Korp and Aart Middeldorp",
	booktitle     = "{Revised Papers of the Second International Conference on Language and Automata Theory and Applications}",
	doi           = "10.1007/978-3-540-88282-4_30",
	isbn          = "978-3-540-88281-7",
	pages         = "321--332",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems}",
	volume        = 5196,
	year          = 2008,
}

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.