@Proceedings{lynch:LIPIcs.RTA.2010,
title = {{LIPIcs, Volume 6, RTA'10, Complete Volume}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2013},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010},
URN = {urn:nbn:de:0030-drops-41003},
doi = {10.4230/LIPIcs.RTA.2010},
annote = {Keywords: Programming Techniques, Software Engineering, Programming Languages, Computation by Abstract Devices, Analysis of Algorithms and Problem Complexity Logics and Meanings of Programs, Mathematical Logic and Formal Languages, Symbolic and Algebraic Manipulation, Artificial Intelligence.}
}
@InProceedings{lynch:LIPIcs.RTA.2010.i,
author = {Lynch, Christopher},
title = {{Frontmatter (Titlepage, Table of Contents, Author List, PC List, Reviewer List)}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {i--xii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.i},
URN = {urn:nbn:de:0030-drops-26684},
doi = {10.4230/LIPIcs.RTA.2010.i},
annote = {Keywords: Table of Contents, Author List, PC List, Reviewer List}
}
@InProceedings{lynch:LIPIcs.RTA.2010.XIII,
author = {Lynch, Christopher},
title = {{Preface}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {13--14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.XIII},
URN = {urn:nbn:de:0030-drops-26675},
doi = {10.4230/LIPIcs.RTA.2010.XIII},
annote = {Keywords: Preface}
}
@InProceedings{bojanczyk:LIPIcs.RTA.2010.1,
author = {Bojanczyk, Mikolaj},
title = {{Automata for Data Words and Data Trees}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {1--4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.1},
URN = {urn:nbn:de:0030-drops-26397},
doi = {10.4230/LIPIcs.RTA.2010.1},
annote = {Keywords: Automata, Data Word, Data Tree}
}
@InProceedings{vanoostrom:LIPIcs.RTA.2010.5,
author = {van Oostrom, Vincent},
title = {{Realising Optimal Sharing}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {5--6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.5},
URN = {urn:nbn:de:0030-drops-26403},
doi = {10.4230/LIPIcs.RTA.2010.5},
annote = {Keywords: Optimal Sharing}
}
@InProceedings{aoto:LIPIcs.RTA.2010.7,
author = {Aoto, Takahito},
title = {{Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {7--16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.7},
URN = {urn:nbn:de:0030-drops-26418},
doi = {10.4230/LIPIcs.RTA.2010.7},
annote = {Keywords: Confluence, Decreasing Diagrams, Automation, Term Rewriting Systems}
}
@InProceedings{appel_et_al:LIPIcs.RTA.2010.17,
author = {Appel, Claus and van Oostrom, Vincent and Simonsen, Jakob Grue},
title = {{Higher-Order (Non-)Modularity}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {17--32},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.17},
URN = {urn:nbn:de:0030-drops-26427},
doi = {10.4230/LIPIcs.RTA.2010.17},
annote = {Keywords: Higher-order rewriting, modularity, termination, normalization}
}
@InProceedings{avanzini_et_al:LIPIcs.RTA.2010.33,
author = {Avanzini, Martin and Moser, Georg},
title = {{Closing the Gap Between Runtime Complexity and Polytime Computability}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {33--48},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.33},
URN = {urn:nbn:de:0030-drops-26436},
doi = {10.4230/LIPIcs.RTA.2010.33},
annote = {Keywords: Term rewriting, graph rewriting, complexity analysis, polytime computability}
}
@InProceedings{bahr:LIPIcs.RTA.2010.49,
author = {Bahr, Patrick},
title = {{Abstract Models of Transfinite Reductions}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {49--66},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.49},
URN = {urn:nbn:de:0030-drops-26445},
doi = {10.4230/LIPIcs.RTA.2010.49},
annote = {Keywords: Infinitary rewriting, metric, partial order, abstract reduction system, axiomatic, term rewriting, graph rewriting}
}
@InProceedings{bahr:LIPIcs.RTA.2010.67,
author = {Bahr, Patrick},
title = {{Partial Order Infinitary Term Rewriting and B\"{o}hm Trees}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {67--84},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.67},
URN = {urn:nbn:de:0030-drops-26455},
doi = {10.4230/LIPIcs.RTA.2010.67},
annote = {Keywords: Infinitary term rewriting, B\"{o}hm trees, partial order, confluence, normalisation}
}
@InProceedings{endrullis_et_al:LIPIcs.RTA.2010.85,
author = {Endrullis, Joerg and Grabmayer, Clemens and Hendriks, Dimitri and Klop, Jan Willem and van Oostrom, Vincent},
title = {{Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {85--102},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.85},
URN = {urn:nbn:de:0030-drops-26469},
doi = {10.4230/LIPIcs.RTA.2010.85},
annote = {Keywords: Weakly orthogonal term rewrite systems, unique normal form property, infinitary rewriting, infinitary lambda-beta-eta-calculus,}
}
@InProceedings{fujita_et_al:LIPIcs.RTA.2010.103,
author = {Fujita, Ken-Etsu and Schubert, Aleksy},
title = {{The Undecidability of Type Related Problems in Type-free Style System F}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {103--118},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.103},
URN = {urn:nbn:de:0030-drops-26475},
doi = {10.4230/LIPIcs.RTA.2010.103},
annote = {Keywords: Lambda calculus and related systems, type checking, typability, partial type inference, 2nd order unification, undecidability, Curry style type system}
}
@InProceedings{gmeiner_et_al:LIPIcs.RTA.2010.119,
author = {Gmeiner, Karl and Gramlich, Bernhard and Schernhammer, Felix},
title = {{On (Un)Soundness of Unravelings}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {119--134},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.119},
URN = {urn:nbn:de:0030-drops-26485},
doi = {10.4230/LIPIcs.RTA.2010.119},
annote = {Keywords: Conditional rewriting, transformation into unconditional systems, unsoundness, unraveling}
}
@InProceedings{guglielmi_et_al:LIPIcs.RTA.2010.135,
author = {Guglielmi, Alessio and Gundersen, Tom and Parigot, Michel},
title = {{A Proof Calculus Which Reduces Syntactic Bureaucracy}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {135--150},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.135},
URN = {urn:nbn:de:0030-drops-26490},
doi = {10.4230/LIPIcs.RTA.2010.135},
annote = {Keywords: Logic, Proof theory, Deep Inference, Flow graphs, Proof Systems, Open Deduction, Rewriting, Confluence, Termination}
}
@InProceedings{hills_et_al:LIPIcs.RTA.2010.151,
author = {Hills, Mark and Rosu, Grigore},
title = {{A Rewriting Logic Semantics Approach to Modular Program Analysis}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {151--160},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.151},
URN = {urn:nbn:de:0030-drops-26506},
doi = {10.4230/LIPIcs.RTA.2010.151},
annote = {Keywords: K, rewriting logic semantics, program analysis}
}
@InProceedings{kahrs:LIPIcs.RTA.2010.161,
author = {Kahrs, Stefan},
title = {{Infinitary Rewriting: Foundations Revisited}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {161--176},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.161},
URN = {urn:nbn:de:0030-drops-26510},
doi = {10.4230/LIPIcs.RTA.2010.161},
annote = {Keywords: Infinitary rewriting,equivalence}
}
@InProceedings{koller_et_al:LIPIcs.RTA.2010.177,
author = {Koller, Alexander and Thater, Stefan},
title = {{Underspecified computation of normal forms}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {177--192},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.177},
URN = {urn:nbn:de:0030-drops-26521},
doi = {10.4230/LIPIcs.RTA.2010.177},
annote = {Keywords: Rewrite systems tree automata normal forms computational linguistics}
}
@InProceedings{kutsia_et_al:LIPIcs.RTA.2010.193,
author = {Kutsia, Temur and Marin, Mircea},
title = {{Order-Sorted Unification with Regular Expression Sorts}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {193--208},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.193},
URN = {urn:nbn:de:0030-drops-26537},
doi = {10.4230/LIPIcs.RTA.2010.193},
annote = {Keywords: Unification, sorts, regular expression}
}
@InProceedings{levy_et_al:LIPIcs.RTA.2010.209,
author = {Levy, Jordi and Villaret, Mateu},
title = {{An Efficient Nominal Unification Algorithm}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {209--226},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.209},
URN = {urn:nbn:de:0030-drops-26544},
doi = {10.4230/LIPIcs.RTA.2010.209},
annote = {Keywords: Nominal logic, unification}
}
@InProceedings{mimram:LIPIcs.RTA.2010.227,
author = {Mimram, Samuel},
title = {{Computing Critical Pairs in 2-Dimensional Rewriting Systems}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {227--242},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.227},
URN = {urn:nbn:de:0030-drops-26552},
doi = {10.4230/LIPIcs.RTA.2010.227},
annote = {Keywords: Rewriting system, polygraph, presentation of a category, critical pair, unification, confluence, compact 2-category, context}
}
@InProceedings{neurauter_et_al:LIPIcs.RTA.2010.243,
author = {Neurauter, Friedrich and Middeldorp, Aart},
title = {{Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {243--258},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.243},
URN = {urn:nbn:de:0030-drops-26565},
doi = {10.4230/LIPIcs.RTA.2010.243},
annote = {Keywords: Term rewriting, termination, polynomial interpretations}
}
@InProceedings{otto_et_al:LIPIcs.RTA.2010.259,
author = {Otto, Carsten and Brockschmidt, Marc and von Essen, Christian and Giesl, J\"{u}rgen},
title = {{Automated Termination Analysis of Java Bytecode by Term Rewriting}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {259--276},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.259},
URN = {urn:nbn:de:0030-drops-26570},
doi = {10.4230/LIPIcs.RTA.2010.259},
annote = {Keywords: Java Bytecode, termination, term rewriting}
}
@InProceedings{riesco_et_al:LIPIcs.RTA.2010.277,
author = {Riesco, Adrian and Verdejo, Alberto and Marti-Oliet, Narciso},
title = {{Declarative Debugging of Missing Answers for Maude}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {277--294},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.277},
URN = {urn:nbn:de:0030-drops-26589},
doi = {10.4230/LIPIcs.RTA.2010.277},
annote = {Keywords: Declarative debugging, Maude, Missing answers, Rewriting}
}
@InProceedings{schmidtschauss_et_al:LIPIcs.RTA.2010.295,
author = {Schmidt-Schauss, Manfred and Sabel, David and Machkasova, Elena},
title = {{Simulation in the Call-by-Need Lambda-Calculus with letrec}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {295--310},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.295},
URN = {urn:nbn:de:0030-drops-26593},
doi = {10.4230/LIPIcs.RTA.2010.295},
annote = {Keywords: Lambda calculus, semantics, contextual equivalence, bisimulation,call-by-need}
}
@InProceedings{simonsen:LIPIcs.RTA.2010.311,
author = {Simonsen, Jakob Grue},
title = {{Weak Convergence and Uniform Normalization in Infinitary Rewriting}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {311--324},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.311},
URN = {urn:nbn:de:0030-drops-26609},
doi = {10.4230/LIPIcs.RTA.2010.311},
annote = {Keywords: Infinitary rewriting, weak convergence, uniform normalization}
}
@InProceedings{sternagel_et_al:LIPIcs.RTA.2010.325,
author = {Sternagel, Christian and Thiemann, Ren\'{e}},
title = {{Certified Subterm Criterion and Certified Usable Rules}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {325--340},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.325},
URN = {urn:nbn:de:0030-drops-26611},
doi = {10.4230/LIPIcs.RTA.2010.325},
annote = {Keywords: Term Rewriting, Certification, Termination, Theorem Proving}
}
@InProceedings{durand_et_al:LIPIcs.RTA.2010.341,
author = {Durand, Ir\`{e}ne and S\'{e}nizergues, G\'{e}raud and Sylvestre, Marc},
title = {{Termination of linear bounded term rewriting systems}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {341--356},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.341},
URN = {urn:nbn:de:0030-drops-26625},
doi = {10.4230/LIPIcs.RTA.2010.341},
annote = {Keywords: Term rewriting, termination, rewriting strategy}
}
@InProceedings{waldmann:LIPIcs.RTA.2010.357,
author = {Waldmann, Johannes},
title = {{Polynomially Bounded Matrix Interpretations}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {357--372},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.357},
URN = {urn:nbn:de:0030-drops-26637},
doi = {10.4230/LIPIcs.RTA.2010.357},
annote = {Keywords: Derivational complexity of rewriting, matrix interpretation, weighted automata, ambiguity of automata, finite domain constraints}
}
@InProceedings{winkler_et_al:LIPIcs.RTA.2010.373,
author = {Winkler, Sarah and Sato, Haruhiko and Middeldorp, Aart and Kurihara, Masahito},
title = {{Optimizing mkbTT}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {373--384},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.373},
URN = {urn:nbn:de:0030-drops-26643},
doi = {10.4230/LIPIcs.RTA.2010.373},
annote = {Keywords: Knuth-Bendix completion, termination prover, automated deduction}
}
@InProceedings{zankl_et_al:LIPIcs.RTA.2010.385,
author = {Zankl, Harald and Korp, Martin},
title = {{Modular Complexity Analysis via Relative Complexity}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {385--400},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.385},
URN = {urn:nbn:de:0030-drops-26659},
doi = {10.4230/LIPIcs.RTA.2010.385},
annote = {Keywords: Term rewriting, complexity analysis, relative complexity, derivation length}
}
@InProceedings{zantema_et_al:LIPIcs.RTA.2010.401,
author = {Zantema, Hans and Raffelsieper, Matthias},
title = {{Proving Productivity in Infinite Data Structures}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {401--416},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.401},
URN = {urn:nbn:de:0030-drops-26661},
doi = {10.4230/LIPIcs.RTA.2010.401},
annote = {Keywords: Productivity, infinite data structures, streams}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing