@InProceedings{Bryant-RTA06,
author={Bryant, R. E.},
title={{Formal Verification of Infinite State Systems Using Boolean Methods}},
pages={1-3},
crossref={RTA06}
}
@InProceedings{CodishLS-RTA06,
author={Codish, M. and Lagoon, V. and Stuckey, P. J.},
title={{Solving Partial Order Constraints for LPO Termination}},
pages={4-18},
crossref={RTA06}
}
@InProceedings{SerbanutaR-RTA06,
author={Serbanuta, T. and Rosu, G.},
title={{Computationally Equivalent Elimination of Conditions}},
pages={19-34},
crossref={RTA06}
}
@InProceedings{AntoyBC-RTA06,
author={Antoy, S. and Brown, D. W. and Chiang, S.-H.},
title={{On the Correctness of Bubbling}},
pages={35-49},
crossref={RTA06}
}
@InProceedings{HendrixOV-RTA06,
author={Hendrix, J. and Ohsaki, H. and Viswanathan, M.},
title={{Propositional Tree Automata}},
pages={50-65},
crossref={RTA06}
}
@InProceedings{GramlichL-RTA06,
author={Gramlich, B. and Lucas, S.},
title={{Generalizing Newman's Lemma for Left-Linear Rewrite Systems}},
pages={66-80},
crossref={RTA06}
}
@InProceedings{Hoffman-RTA06,
author={Hoffman, P.},
title={{Unions of Equational Monadic Theories}},
pages={81-95},
crossref={RTA06}
}
@InProceedings{Jouannaud-RTA06,
author={Jouannaud, J.-P.},
title={{Modular Church-Rosser Modulo}},
pages={96-107},
crossref={RTA06}
}
@InProceedings{ChevalierR-RTA06,
author={Chevalier, Y. and Rusinowitch, M.},
title={{Hierarchical Combination of Intruder Theories}},
pages={108-122},
crossref={RTA06}
}
@InProceedings{BoichutG-RTA06,
author={Boichut, Y. and Genet, Th.},
title={{Feasible Trace Reconstruction for Rewriting Approximations}},
pages={123-135},
crossref={RTA06}
}
@InProceedings{Esparza-IT-RTA06,
author={Bouajjani, A. and Esparza, J.},
title={{Rewriting Models of Boolean Programs (invited lecture)}},
pages={136-150},
crossref={RTA06}
}
@InProceedings{Salvati-RTA06,
author={Salvati, S.},
title={{Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear Lambda-Calculus}},
pages={151-165},
crossref={RTA06}
}
@InProceedings{OhtaH-RTA06,
author={Ohta, Y. and Hasegawa, M.},
title={{A Terminating and Confluent Linear Lambda Calculus}},
pages={166-180},
crossref={RTA06}
}
@InProceedings{ArbiserMR-RTA06,
author={Arbiser, A. and Miquel, A. and Ríos, A.},
title={{A Lambda-Calculus with Constructors}},
pages={181-196},
crossref={RTA06}
}
@InProceedings{EspiritoSantoFP-RTA06,
author={Espírito Santo, J. and Frade, M. J. and Pinto, L.},
title={{Structural Proof Theory as Rewriting}},
pages={197-211},
crossref={RTA06}
}
@InProceedings{Obua-RTA06,
author={Obua, S.},
title={{Checking Conservativity of Overloaded Definitions in Higher-Order Logic}},
pages={212-226},
crossref={RTA06}
}
@InProceedings{Koprowski-RTA06,
author={Koprowski, A.},
title={{Certified Higher-Order Recursive Path Ordering}},
pages={227-241},
crossref={RTA06}
}
@InProceedings{Aoto-RTA06,
author={Aoto, T.},
title={{Dealing with Non-orientable Equations in Rewriting Induction}},
pages={242-256},
crossref={RTA06}
}
@InProceedings{Koprowski-RTA06,
author={Koprowski, A.},
title={{TPA: Termination Proved Automatically (system description)}},
pages={257-266},
crossref={RTA06}
}
@InProceedings{ChibaA-RTA06,
author={Chiba, Y. and Aoto, T.},
title={{RAPT: A Program Transformation System Based on Term Rewriting (system description)}},
pages={267-276},
crossref={RTA06}
}
@InProceedings{Turuani-RTA06,
author={Turuani, M.},
title={{The CL-Atse Protocol Analyser (system description)}},
pages={277-286},
crossref={RTA06}
}
@InProceedings{WehrmanSW-RTA06,
author={Wehrman, I. and Stump, A. and Westbrook, E.},
title={{Slothrop: Knuth-Bendix Completion with a Modern Termination Checker (system description)}},
pages={287-296},
crossref={RTA06}
}
@InProceedings{Giesl-IT-RTA06,
author={Giesl, J. and Swiderski, S. and Schneider-Kamp, P. and Thiemann, R.},
title={{Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages (invited lecture)}},
pages={297-312},
crossref={RTA06}
}
@InProceedings{HirokawaM-RTA06,
author={Hirokawa, N. and Middeldorp, A.},
title={{Predictive Labeling}},
pages={313-327},
crossref={RTA06}
}
@InProceedings{HofbauerW-RTA06,
author={Hofbauer, D. and Waldmann, J.},
title={{Termination of String Rewriting with Matrix Interpretations}},
pages={328-342},
crossref={RTA06}
}
@InProceedings{WangS-RTA06,
author={Wang, Y. and Sakai, M.},
title={{Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems}},
pages={343-356},
crossref={RTA06}
}
@InProceedings{BournezG-RTA06,
author={Bournez, O. and Garnier, F.},
title={{Proving Positive Almost Sure Termination Under Strategies}},
pages={357-371},
crossref={RTA06}
}
@InProceedings{SanderBruggink-RTA06,
author={Sander Bruggink, H. J.},
title={{A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property}},
pages={372-386},
crossref={RTA06}
}
@InProceedings{JouannaudR-RTA06,
author={Jouannaud, J.-P. and Rubio, A.},
title={{Higher-Order Orderings for Normal Rewriting}},
pages={387-399},
crossref={RTA06}
}
@InProceedings{LevySSV-RTA06,
author={Levy, J. and Schmidt-Schauß, M. and Villaret, M.},
title={{Bounded Second-Order Unification Is NP-Complete}},
pages={400-414},
crossref={RTA06}
}

% CROSSREFERENCES
% These must remain at the end of this file.

@Proceedings{RTA06,
year={2006},
month=aug # {~12-14,},
editor={Pfenning, F.},
title={{Term Rewriting and Applications, 17th International Conference, RTA-06}},
booktitle={{Rewriting Techniques and Applications, 17th International Conference, RTA-06}},
address={Seattle, WA, USA},
series={LNCS 4098},
publisher={Springer}
}