Travelled to:1 × Belgium
1 × Germany
1 × Portugal
1 × Serbia
1 × Spain
2 × Japan
Collaborated with:G.Vidal M.Sakai T.Sakabe J.Iborra M.Niwa A.Yamada T.Aoto N.Hirokawa J.Nagele H.Zankl
Talks about:program (4) rewrit (4) invers (4) system (3) relat (3) term (3) function (2) termin (2) narrow (2) depend (2)
Person: Naoki Nishida
DBLP: Nishida:Naoki
Contributed to:
2015
20132012
2011
201020092005Wrote 10 papers:
- CADE-2015-AotoHN0Z #confluence #contest
- Confluence Competition 2015 (TA, NH, JN, NN, HZ), pp. 101–104.
- CADE-2015-IborraNVY #dependence #problem #termination
- Reducing Relative Termination to Dependency Pair Problems (JI, NN, GV, AY), pp. 163–178.
- LOPSTR-2013-NishidaV #finite #representation
- A Finite Representation of the Narrowing Space (NN, GV), pp. 54–71.
- LOPSTR-2012-NishidaV #term rewriting
- Computing More Specific Versions of Conditional Rewriting Systems (NN, GV), pp. 137–154.
- LOPSTR-2012-Niwa0S #source code
- Improving Determinization of Grammar Programs for Program Inversion (MN, NN, MS), pp. 155–175.
- RTA-2011-NishidaSS #term rewriting
- Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity (NN, MS, TS), pp. 267–282.
- RTA-2011-NishidaV #recursion
- Program Inversion for Tail Recursive Functions (NN, GV), pp. 283–298.
- FLOPS-2010-NishidaS #injection #proving #term rewriting
- Proving Injectivity of Functions via Program Inversion in Term Rewriting (NN, MS), pp. 288–303.
- LOPSTR-2009-IborraNV #dependence #proving #termination
- Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing (JI, NN, GV), pp. 52–66.
- RTA-2005-NishidaSS #term rewriting
- Partial Inversion of Constructor Term Rewriting Systems (NN, MS, TS), pp. 264–278.