11 papers:
RTA-2015-GenetS #analysis #reachability- Reachability Analysis of Innermost Rewriting (TG, YS), pp. 177–193.
CADE-2011-NoschinskiEG #analysis #complexity #dependence #framework #term rewriting- A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems (LN, FE, JG), pp. 422–438.
- RTA-2008-KojimaS #decidability #linear #reachability #term rewriting
- Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems (YK, MS), pp. 187–201.
- RTA-2008-ThiemannGS
- Deciding Innermost Loops (RT, JG, PSK), pp. 366–380.
- RTA-2007-GodoyH #decidability #term rewriting
- Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems (GG, EH), pp. 184–199.
- RTA-2005-FernandezGR #order #termination
- Orderings for Innermost Termination (MLF, GG, AR), pp. 17–31.
- RTA-2005-PolZ
- Generalized Innermost Rewriting (JvdP, HZ), pp. 2–16.
DLT-2002-GieslM #termination- Innermost Termination of Context-Sensitive Rewriting (JG, AM), pp. 231–244.
- RTA-1997-ArtsG #automation #normalisation #proving
- Proving Innermost Normalisation Automatically (TA, JG), pp. 157–171.
- RTA-1996-Gramlich #on the #proving #termination
- On Proving Termination by Innermost Termination (BG), pp. 93–107.
- RTA-1985-Fribourg
- Handling Function Definitions through Innermost Superposition and Rewriting (LF), pp. 325–344.
