Travelled to:1 × Cyprus
1 × Portugal
1 × Sweden
1 × Switzerland
2 × Canada
2 × France
2 × Germany
2 × Italy
2 × The Netherlands
2 × United Kingdom
9 × USA
Collaborated with:Z.Hu H.Iwasaki W.Chin D.Liu K.Matsuda A.Morihata K.Matsuzaki T.Yokoyama S.Mu Y.Xiong K.Kakehi I.Sasano H.Song H.Zhao H.Mei K.Tanaka-Ishii T.Murakami M.Ogawa S.Khoo A.Takano K.Nakano M.Hamana K.Morita
Talks about:transform (7) program (7) parallel (6) calcul (6) base (5) automat (4) model (4) algorithm (3) bidirect (3) recurs (3)
Person: Masato Takeichi
DBLP: Takeichi:Masato
Contributed to:
2010
2009
2009
2009
2009
2008
200720072007
2007
2005
2005
20042004
20032002
20012000
2000
20001999
1998199819971996
1996Wrote 27 papers:
- ESOP-2010-MatsudaMHT #approach #grammarware #source code
- A Grammar-Based Approach to Invertible Programs (KM, SCM, ZH, MT), pp. 448–467.
- ESEC-FSE-2009-XiongHZSTM #automation #consistency #nondeterminism
- Supporting automatic model inconsistency fixing (YX, ZH, HZ, HS, MT, HM), pp. 315–324.
- ICMT-2009-XiongSHT #bidirectional #model transformation #parallel
- Supporting Parallel Updates with Bidirectional Model Transformations (YX, HS, ZH, MT), pp. 213–228.
- PEPM-2009-MatsudaHT #type system #xml
- Type-based specialization of xml transformations (KM, ZH, MT), pp. 61–72.
- POPL-2009-MorihataMHT #divide and conquer #morphism #theorem
- The third homomorphism theorem on trees: downward & upward lead to divide-and-conquer (AM, KM, ZH, MT), pp. 177–185.
- ICFP-2008-MorihataMT #framework #query #recursion
- Write it recursively: a generic framework for optimal path queries (AM, KM, MT), pp. 169–178.
- ASE-2007-XiongLHZTM #automation #model transformation #towards
- Towards automatic model synchronization from model transformations (YX, DL, ZH, HZ, MT, HM), pp. 164–173.
- ICFP-2007-MatsudaHNHT #automation #bidirectional
- Bidirectionalization transformation based on automatic derivation of view complement functions (KM, ZH, KN, MH, MT), pp. 47–58.
- PEPM-2007-LiuHT #bidirectional #xquery
- Bidirectional interpretation of XQuery (DL, ZH, MT), pp. 21–30.
- PLDI-2007-MoritaMMHT #automation #divide and conquer #parallel #source code
- Automatic inversion generates divide-and-conquer parallel programs (KM, AM, KM, ZH, MT), pp. 146–155.
- DocEng-2005-LiuHT #dependence #documentation #maintenance #xml
- An environment for maintaining computation dependency in XML documents (DL, ZH, MT), pp. 42–51.
- GTTSE-2005-HuYT #optimisation
- Program Optimizations and Transformations in Calculation Form (ZH, TY, MT), pp. 144–168.
- ITiCSE-2004-Tanaka-IshiiKT #feedback #named #programming #verification
- EMMA: a web-based report system for programming course--automated verification and enhanced feedback (KTI, KK, MT), p. 278.
- PEPM-2004-HuMT #bidirectional #documentation #editing #programmable
- A programmable editor for developing structured documents based on bidirectional transformations (ZH, SCM, MT), pp. 178–189.
- LOPSTR-2003-MurakamiHKT #algorithm #analysis #performance #staging
- An Efficient Staging Algorithm for Binding-Time Analysis (TM, ZH, KK, MT), pp. 106–107.
- LOPSTR-2003-YokoyamaHT #higher-order #program transformation
- Deterministic Higher-Order Patterns for Program Transformation (TY, ZH, MT), pp. 128–142.
- ESOP-2002-HuIT #cumulative #parallel
- An Accumulative Parallel Skeleton for All (ZH, HI, MT), pp. 83–97.
- SAIG-2001-SasanoHT #generative #multi #performance #problem #source code
- Generation of Efficient Programs for Solving Maximum Multi-marking Problems (IS, ZH, MT), pp. 72–91.
- ICFP-2000-SasanoHTO #algorithm #linear #problem
- Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems (IS, ZH, MT, MO), pp. 137–149.
- PADL-2000-HuCT #algorithm #analysis #data mining #mining
- Calculating a New Data Mining Algorithm for Market Basket Analysis (ZH, WNC, MT), pp. 169–184.
- SAS-2000-ChinKHT #invariant #parallel
- Deriving Parallel Codes via Invariants (WNC, SCK, ZH, MT), pp. 75–94.
- PEPM-1999-HuTI #named #parallel #performance #source code
- Diffusion: Calculating Efficient Parallel Programs (ZH, MT, HI), pp. 85–94.
- FLOPS-1998-IwasakiHT #recursion #towards
- Towards Manipulation of Mutually Recursive Functions (HI, ZH, MT), pp. 61–79.
- POPL-1998-HuTC #parallel
- Parallelization in Calculational Forms (ZH, MT, WNC), pp. 316–328.
- ICFP-1997-HuITT #multi #traversal
- Tupling Calculation Eliminates Multiple Data Traversals (ZH, HI, MT, AT), pp. 164–175.
- ICFP-1996-HuIT #morphism #recursion
- Deriving Structural Hylomorphisms From Recursive Definitions (ZH, HI, MT), pp. 73–82.
- PLILP-1996-HuIT
- Cheap Tupling in Calculational Form (ZH, HI, MT), pp. 471–472.