Abstract is missing.
- Formal Verification of Infinite State Systems Using Boolean MethodsRandal E. Bryant. 1-3 [doi]
- Solving Partial Order Constraints for LPO TerminationMichael Codish, Vitaly Lagoon, Peter J. Stuckey. 4-18 [doi]
- Computationally Equivalent Elimination of ConditionsTraian-Florin Serbanuta, Grigore Rosu. 19-34 [doi]
- On the Correctness of BubblingSergio Antoy, Daniel W. Brown, Su-Hui Chiang. 35-49 [doi]
- Propositional Tree AutomataJoe Hendrix, Hitoshi Ohsaki, Mahesh Viswanathan. 50-65 [doi]
- Generalizing Newman s Lemma for Left-Linear Rewrite SystemsBernhard Gramlich, Salvador Lucas. 66-80 [doi]
- Unions of Equational Monadic TheoriesPiotr Hoffman. 81-95 [doi]
- Modular Church-Rosser ModuloJean-Pierre Jouannaud. 96-107 [doi]
- Hierarchical Combination of Intruder TheoriesYannick Chevalier, Michaël Rusinowitch. 108-122 [doi]
- Feasible Trace Reconstruction for Rewriting ApproximationsYohan Boichut, Thomas Genet. 123-135 [doi]
- Rewriting Models of Boolean ProgramsAhmed Bouajjani, Javier Esparza. 136-150 [doi]
- Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear ::::lambda::::-CalculusSylvain Salvati. 151-165 [doi]
- A Terminating and Confluent Linear Lambda CalculusYo Ohta, Masahito Hasegawa. 166-180 [doi]
- A Lambda-Calculus with ConstructorsAriel Arbiser, Alexandre Miquel, Alejandro Ríos. 181-196 [doi]
- Structural Proof Theory as RewritingJosé Espírito Santo, Maria João Frade, Luis Pinto. 197-211 [doi]
- Checking Conservativity of Overloaded Definitions in Higher-Order LogicSteven Obua. 212-226 [doi]
- Certified Higher-Order Recursive Path OrderingAdam Koprowski. 227-241 [doi]
- Dealing with Non-orientable Equations in Rewriting InductionTakahito Aoto. 242-256 [doi]
- TPA: Termination Proved AutomaticallyAdam Koprowski. 257-266 [doi]
- RAPT: A Program Transformation System Based on Term RewritingYuki Chiba, Takahito Aoto. 267-276 [doi]
- The CL-Atse Protocol AnalyserMathieu Turuani. 277-286 [doi]
- Slothrop: Knuth-Bendix Completion with a Modern Termination CheckerIan Wehrman, Aaron Stump, Edwin M. Westbrook. 287-296 [doi]
- Automated Termination Analysis for Haskell: From Term Rewriting to Programming LanguagesJürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp, René Thiemann. 297-312 [doi]
- Predictive LabelingNao Hirokawa, Aart Middeldorp. 313-327 [doi]
- Termination of String Rewriting with Matrix InterpretationsDieter Hofbauer, Johannes Waldmann. 328-342 [doi]
- Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related SystemsYi Wang, Masahiko Sakai. 343-356 [doi]
- Proving Positive Almost Sure Termination Under StrategiesOlivier Bournez, Florent Garnier. 357-371 [doi]
- A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix PropertyHarrie Jan Sander Bruggink. 372-386 [doi]
- Higher-Order Orderings for Normal RewritingJean-Pierre Jouannaud, Albert Rubio. 387-399 [doi]
- Bounded Second-Order Unification Is NP-CompleteJordi Levy, Manfred Schmidt-Schauß, Mateu Villaret. 400-414 [doi]