@Proceedings{schmidtschau:LIPIcs.RTA.2011,
title = {{LIPIcs, Volume 10, RTA'11, Complete Volume}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2013},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011},
URN = {urn:nbn:de:0030-drops-41045},
doi = {10.4230/LIPIcs.RTA.2011},
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{schmidtschauss:LIPIcs.RTA.2011.i,
author = {Schmidt-Schauss, Manfred},
title = {{Frontmatter, Table of Contents, Preface, Conference Organization}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {i--xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.i},
URN = {urn:nbn:de:0030-drops-31099},
doi = {10.4230/LIPIcs.RTA.2011.i},
annote = {Keywords: Frontmatter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{tison:LIPIcs.RTA.2011.1,
author = {Tison, Sophie},
title = {{Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What's New?}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {1--2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.1},
URN = {urn:nbn:de:0030-drops-31404},
doi = {10.4230/LIPIcs.RTA.2011.1},
annote = {Keywords: Tree Automata, Constraints, Term Rewriting}
}
@InProceedings{tiwari:LIPIcs.RTA.2011.3,
author = {Tiwari, Ashish},
title = {{Rewriting in Practice}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {3--8},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.3},
URN = {urn:nbn:de:0030-drops-31326},
doi = {10.4230/LIPIcs.RTA.2011.3},
annote = {Keywords: Rewriting, Polynomial constraints, Biochemical reaction networks}
}
@InProceedings{weirich:LIPIcs.RTA.2011.9,
author = {Weirich, Stephanie},
title = {{Combining Proofs and Programs}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {9--9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.9},
URN = {urn:nbn:de:0030-drops-31398},
doi = {10.4230/LIPIcs.RTA.2011.9},
annote = {Keywords: Dependent types, functional programming}
}
@InProceedings{conchinha_et_al:LIPIcs.RTA.2011.11,
author = {Conchinha, Bruno and Basin, David A. and Caleiro, Carlos},
title = {{FAST: An Efficient Decision Procedure for Deduction and Static Equivalence}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {11--20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.11},
URN = {urn:nbn:de:0030-drops-31369},
doi = {10.4230/LIPIcs.RTA.2011.11},
annote = {Keywords: Efficient algorithms, Equational theories, Deducibility, Static equivalence, Security protocols}
}
@InProceedings{contejean_et_al:LIPIcs.RTA.2011.21,
author = {Contejean, \'{E}velyne and Courtieu, Pierre and Forest, Julien and Pons, Olivier and Urbain, Xavier},
title = {{Automated Certified Proofs with CiME3}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {21--30},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.21},
URN = {urn:nbn:de:0030-drops-31192},
doi = {10.4230/LIPIcs.RTA.2011.21},
annote = {Keywords: Rewriting, Formal Proof, Proof Automation, Proof Assistant}
}
@InProceedings{duran_et_al:LIPIcs.RTA.2011.31,
author = {Duran, Francisco and Eker, Steven and Escobar, Santiago and Meseguer, Jose and Talcott, Carolyn},
title = {{Variants, Unification, Narrowing, and Symbolic Reachability in Maude 2.6}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {31--40},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.31},
URN = {urn:nbn:de:0030-drops-31211},
doi = {10.4230/LIPIcs.RTA.2011.31},
annote = {Keywords: Rewriting logic, narrowing, unification, variants}
}
@InProceedings{falke_et_al:LIPIcs.RTA.2011.41,
author = {Falke, Stephan and Kapur, Deepak and Sinz, Carsten},
title = {{Termination Analysis of C Programs Using Compiler Intermediate Languages}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {41--50},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.41},
URN = {urn:nbn:de:0030-drops-31232},
doi = {10.4230/LIPIcs.RTA.2011.41},
annote = {Keywords: termination analysis; C programs; compiler intermediate languages}
}
@InProceedings{gascon_et_al:LIPIcs.RTA.2011.51,
author = {Gasc\'{o}n, Adri\`{a} and Maneth, Sebastian and Ramos, Lander},
title = {{First-Order Unification on Compressed Terms}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {51--60},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.51},
URN = {urn:nbn:de:0030-drops-31263},
doi = {10.4230/LIPIcs.RTA.2011.51},
annote = {Keywords: unification, matching, grammars, compression, STG, system C++}
}
@InProceedings{grathwohl_et_al:LIPIcs.RTA.2011.61,
author = {Grathwohl, Niels Bj{\o}rn Bugge and Ketema, Jeroen and Pallesen, Jens Duelund and Simonsen, Jakob Grue},
title = {{Anagopos: A Reduction Graph Visualizer for Term Rewriting and Lambda Calculus}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {61--70},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.61},
URN = {urn:nbn:de:0030-drops-31286},
doi = {10.4230/LIPIcs.RTA.2011.61},
annote = {Keywords: term rewriting, lambda calculus, reduction graphs, visualization}
}
@InProceedings{klein_et_al:LIPIcs.RTA.2011.71,
author = {Klein, Dominik and Hirokawa, Nao},
title = {{Maximal Completion}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {71--80},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.71},
URN = {urn:nbn:de:0030-drops-31295},
doi = {10.4230/LIPIcs.RTA.2011.71},
annote = {Keywords: Term Rewriting, Knuth-Bendix Completion, Multi-completion}
}
@InProceedings{rose:LIPIcs.RTA.2011.81,
author = {Rose, Kristoffer H.},
title = {{CRSX - Combinatory Reduction Systems with Extensions}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {81--90},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.81},
URN = {urn:nbn:de:0030-drops-31301},
doi = {10.4230/LIPIcs.RTA.2011.81},
annote = {Keywords: Higher-Order Rewriting, Compilers}
}
@InProceedings{aoto_et_al:LIPIcs.RTA.2011.91,
author = {Aoto, Takahito and Toyama, Yoshihito},
title = {{A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {91--106},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.91},
URN = {urn:nbn:de:0030-drops-31105},
doi = {10.4230/LIPIcs.RTA.2011.91},
annote = {Keywords: Confluence, Completion, Equational Term Rewriting Systems, Confluence Modulo Equations}
}
@InProceedings{aoto_et_al:LIPIcs.RTA.2011.107,
author = {Aoto, Takahito and Yamada, Toshiyuki and Chiba, Yuki},
title = {{Natural Inductive Theorems for Higher-Order Rewriting}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {107--121},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.107},
URN = {urn:nbn:de:0030-drops-31119},
doi = {10.4230/LIPIcs.RTA.2011.107},
annote = {Keywords: Inductive Theorems, Higher-Order Equational Logic, Simply-Typed S-Expression Rewriting Systems, Term Rewriting Systems}
}
@InProceedings{avanzini_et_al:LIPIcs.RTA.2011.123,
author = {Avanzini, Martin and Eguchi, Naohi and Moser, Georg},
title = {{A Path Order for Rewrite Systems that Compute Exponential Time Functions}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {123--138},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.123},
URN = {urn:nbn:de:0030-drops-31127},
doi = {10.4230/LIPIcs.RTA.2011.123},
annote = {Keywords: Runtime Complexity, Exponential Time Functions, Implicit Computational Complexity}
}
@InProceedings{bahr:LIPIcs.RTA.2011.139,
author = {Bahr, Patrick},
title = {{Modes of Convergence for Term Graph Rewriting}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {139--154},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.139},
URN = {urn:nbn:de:0030-drops-31131},
doi = {10.4230/LIPIcs.RTA.2011.139},
annote = {Keywords: term graphs, partial order, metric, infinitary rewriting, graph rewriting}
}
@InProceedings{brockschmidt_et_al:LIPIcs.RTA.2011.155,
author = {Brockschmidt, Marc and Otto, Carsten and Giesl, J\"{u}rgen},
title = {{Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {155--170},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.155},
URN = {urn:nbn:de:0030-drops-31146},
doi = {10.4230/LIPIcs.RTA.2011.155},
annote = {Keywords: termination, Java Bytecode, term rewriting, recursion}
}
@InProceedings{bruttomesso_et_al:LIPIcs.RTA.2011.171,
author = {Bruttomesso, Roberto and Ghilardi, Silvio and Ranise, Silvio},
title = {{Rewriting-based Quantifier-free Interpolation for a Theory of Arrays}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {171--186},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.171},
URN = {urn:nbn:de:0030-drops-31155},
doi = {10.4230/LIPIcs.RTA.2011.171},
annote = {Keywords: rewriting, interpolation, arrays, model-checking}
}
@InProceedings{kochems_et_al:LIPIcs.RTA.2011.187,
author = {Kochems, Jonathan and Ong, C.H. Luke},
title = {{Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {187--202},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.187},
URN = {urn:nbn:de:0030-drops-31167},
doi = {10.4230/LIPIcs.RTA.2011.187},
annote = {Keywords: Flow analysis, reachability, collecting semantics, higher-order program, term rewriting, indexed linear tree grammar}
}
@InProceedings{kop_et_al:LIPIcs.RTA.2011.203,
author = {Kop, Cynthia and van Raamsdonk, Femke},
title = {{Higher Order Dependency Pairs for Algebraic Functional Systems}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {203--218},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.203},
URN = {urn:nbn:de:0030-drops-31177},
doi = {10.4230/LIPIcs.RTA.2011.203},
annote = {Keywords: higher order rewriting, termination, dynamic dependency pairs}
}
@InProceedings{kutsia_et_al:LIPIcs.RTA.2011.219,
author = {Kutsia, Temur and Levy, Jordi and Villaret, Mateu},
title = {{Anti-Unification for Unranked Terms and Hedges}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {219--234},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.219},
URN = {urn:nbn:de:0030-drops-31181},
doi = {10.4230/LIPIcs.RTA.2011.219},
annote = {Keywords: Anti-unification, generalization, unranked terms, hedges, software clones.}
}
@InProceedings{moser_et_al:LIPIcs.RTA.2011.235,
author = {Moser, Georg and Schnabl, Andreas},
title = {{Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {235--250},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.235},
URN = {urn:nbn:de:0030-drops-31208},
doi = {10.4230/LIPIcs.RTA.2011.235},
annote = {Keywords: Complexity, DP Framework, Multiple Recursive Functions}
}
@InProceedings{neurauter_et_al:LIPIcs.RTA.2011.251,
author = {Neurauter, Friedrich and Middeldorp, Aart},
title = {{Revisiting Matrix Interpretations for Proving Termination of Term Rewriting}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {251--266},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.251},
URN = {urn:nbn:de:0030-drops-31222},
doi = {10.4230/LIPIcs.RTA.2011.251},
annote = {Keywords: term rewriting, termination, matrix interpretations}
}
@InProceedings{nishida_et_al:LIPIcs.RTA.2011.267,
author = {Nishida, Naoki and Sakai, Masahiko and Sakabe, Toshiki},
title = {{Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {267--282},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.267},
URN = {urn:nbn:de:0030-drops-31244},
doi = {10.4230/LIPIcs.RTA.2011.267},
annote = {Keywords: conditional term rewriting, program transformation}
}
@InProceedings{nishida_et_al:LIPIcs.RTA.2011.283,
author = {Nishida, Naoki and Vidal, German},
title = {{Program Inversion for Tail Recursive Functions}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {283--298},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.283},
URN = {urn:nbn:de:0030-drops-31253},
doi = {10.4230/LIPIcs.RTA.2011.283},
annote = {Keywords: term rewriting, program transformation, termination}
}
@InProceedings{roux:LIPIcs.RTA.2011.299,
author = {Roux, Cody},
title = {{Refinement Types as Higher-Order Dependency Pairs}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {299--312},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.299},
URN = {urn:nbn:de:0030-drops-31273},
doi = {10.4230/LIPIcs.RTA.2011.299},
annote = {Keywords: Dependency Pairs, Higher-Order, Refinement Types}
}
@InProceedings{severi_et_al:LIPIcs.RTA.2011.313,
author = {Severi, Paula and de Vries, Fer-Jan},
title = {{Weakening the Axiom of Overlap in Infinitary Lambda Calculus}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {313--328},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.313},
URN = {urn:nbn:de:0030-drops-31312},
doi = {10.4230/LIPIcs.RTA.2011.313},
annote = {Keywords: Infinitary Lambda Calculus, Confluence, Normalization}
}
@InProceedings{sternagel_et_al:LIPIcs.RTA.2011.329,
author = {Sternagel, Christian and Thiemann, Ren\'{e}},
title = {{Modular and Certified Semantic Labeling and Unlabeling}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {329--344},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.329},
URN = {urn:nbn:de:0030-drops-31333},
doi = {10.4230/LIPIcs.RTA.2011.329},
annote = {Keywords: semantic labeling, certification, term rewriting, unlabeling}
}
@InProceedings{stump_et_al:LIPIcs.RTA.2011.345,
author = {Stump, Aaron and Kimmell, Garrin and El Haj Omar, Roba},
title = {{Type Preservation as a Confluence Problem}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {345--360},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.345},
URN = {urn:nbn:de:0030-drops-31343},
doi = {10.4230/LIPIcs.RTA.2011.345},
annote = {Keywords: Term rewriting, Type Safety, Confluence}
}
@InProceedings{durand_et_al:LIPIcs.RTA.2011.361,
author = {Durand, Ir\`{e}ne and Sylvestre, Marc},
title = {{Left-linear Bounded TRSs are Inverse Recognizability Preserving}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {361--376},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.361},
URN = {urn:nbn:de:0030-drops-31350},
doi = {10.4230/LIPIcs.RTA.2011.361},
annote = {Keywords: Term Rewriting, Preservation of Recognizability, Rewriting Strategies}
}
@InProceedings{zankl_et_al:LIPIcs.RTA.2011.377,
author = {Zankl, Harald and Felgenhauer, Bertram and Middeldorp, Aart},
title = {{Labelings for Decreasing Diagrams}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {377--392},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.377},
URN = {urn:nbn:de:0030-drops-31378},
doi = {10.4230/LIPIcs.RTA.2011.377},
annote = {Keywords: term rewriting, confluence, decreasing diagrams, labeling}
}
@InProceedings{zantema_et_al:LIPIcs.RTA.2011.393,
author = {Zantema, Hans and Endrullis, Joerg},
title = {{Proving Equality of Streams Automatically}},
booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
pages = {393--408},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-30-9},
ISSN = {1868-8969},
year = {2011},
volume = {10},
editor = {Schmidt-Schauss, Manfred},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.393},
URN = {urn:nbn:de:0030-drops-31381},
doi = {10.4230/LIPIcs.RTA.2011.393},
annote = {Keywords: 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