Publications

Publications

Publications and Presentations †

• Kento Takyu and Kazunori Ueda, Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination. To be presented at the 27th International Symposium on Practical Aspects of Declarative Languages (PADL 2025), Denver, Colorado, United States, January 2025.

• [slides] Naoki Yamamoto and Kazunori Ueda, Grammar-based Pattern Matching and Type Checking for Difference Data Structures. The 7th Workshop on New Ideas and Emerging Results in Programming Languages and Systems, Kyoto, Japan, October 2024.

• [pdf] [slides] Naoki Yamamoto and Kazunori Ueda, Grammar-based Pattern Matching and Type Checking for Difference Data Structures. In Proceedings of the 26th International Symposium on Principles and Practice of Declarative Programming (PPDP '24), ACM, 2024, Article No.:13, pp.1-13.

• [pdf] [slides] Haruto Mishina and Kazunori Ueda, Introducing Quantification into a Hierarchical Graph Rewriting Language. In Proc. 34th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2024), LNCS 14919, Springer-Verlag, 2024, pp.220-239.

• [abstract and slides pdf] Kazunori Ueda, Gentle Introduction to LMNtal: Language Design and Implementation. 17th International Conference on Graph Transformation (ICGT 2024), Enschede, the Netherlands, July 2024 (tutorial).

• [extended abstract and poster pdf] Kento Takyu and Kazunori Ueda, Encoding MELL Cut Elimination into a Hierarchical Graph Rewriting Language, The 21st Asian Symposium on Programming Languages and Systems (APLAS 2023), 2023. (Non-SRC poster award)

• [pdf] [slides] Jin Sano and Kazunori Ueda, Implementing the λGT Language: A Functional Language with Graphs as First-Class Data. In Proc. 16th International Conference on Graph Transformation (ICGT 2023), LNCS 13961, Springer-Verlag, 2023, pp.263-277, DOI: 10.1007/978-3-031-36709-0_14.

• [pdf] [slides of the conference version] Jin Sano, Naoki Yamamoto and Kazunori Ueda: Type Checking Data Structures More Complex Than Trees. Journal of Information Processing, Vol.31, 2023, pp.112-130. DOI: 10.2197/ipsjjip.31.112.

• [pdf] Naoki Yamamoto and Kazunori Ueda: Engineering Grammar-based Type Checking for Graph Rewriting Languages. IEEE Access, Vol.10, 2022, pp.114612-114628. DOI: 10.1109/ACCESS.2022.3217913.

• [pdf] Alimujiang Yasen and Kazunori Ueda: Revisiting Graph Types in HyperLMNtal: A Modeling Language for Hypergraph Rewriting. IEEE Access, Vol.9, pp.133449-133460, 2021. DOI: doi.org/10.1109/ACCESS.2021.3112903.

• [pdf] Naoki Yamamoto and Kazunori Ueda: Engineering Grammar-based Type Checking for Graph Rewriting Languages. In Proc. Twelfth International Workshop on Graph Computation Models (GCM 2021), June 2021, pp.93-114.

• [pdf] [slides] Taichi Tomioka, Yutaro Tsunekawa and Kazunori Ueda: Introducing Symmetry to Graph Rewriting Systems with Process Abstraction. In Proc. 12th International Conference on Graph Transformation (ICGT 2019), LNCS 11629, Springer-Verlang, 2019, pp.3-20, DOI: 10.1007/978-3-030-23611-3_1.

• [pdf] Alimujiang Yasen and Kazunori Ueda, Name Binding is Easy with Hypergraphs. IEICE Transactions on Information and Systems, Vol.E101-D, No.4, 2018, pp.1126-1140, DOI: 10.1587/transinf.2017EDP7257.

• [pdf] Alimujiang Yasen, Hypergraph-Based Modeling of Formal Systems Involving Name Binding. Doctoral Thesis, Department of Computer Science and Engineering, Waseda University, February 2018.

• [pdf] [slides of the conference version] Yutaro Tsunekawa, Taichi Tomioka and Kazunori Ueda: Implementation of LMNtal Model Checkers: a Metaprogramming Approach. The Journal of Object Technology, Vol.17, No.1, 2018, pp.1:1-28, DOI: 10.5381/jot.2018.17.1.a1

• [pdf] [slides] Alimujiang Yasen and Kazunori Ueda: Unification of Hypergraph Lambda-Terms. In Proc. Second IFIP International Conference on Topics in Theoretical Computer Science (TTCS 2017), LNCS 10608, Springer-Verlag, 2017, pp.106-124, DOI: 10.1007/978-3-319-68953-1_9.

• [pdf] [slides of the conference version] Kazunozi Ueda: Logic/Constraint Programming and Concurrency: The Hard-Won Lessons of the Fifth Generation Computer Project. Science of Computer Programming, Vol.164 (2018), pp.3-17, DOI: 10.1016/j.scico.2017.06.002.

• [pdf] [slides] Yutaro Tsunekawa, Taichi Tomioka and Kazunori Ueda: Implementation of LMNtal Model Checkers: a Metaprogramming Approach. First Workshop on Meta-Programming Techniques and Reflection (META'16), Amsterdam, Oct. 2016.

• [pdf] [slides] Alimujiang Yasen and Kazunori Ueda: Hypergraph Representation of Lambda-Terms. In Proc. 10th International Symposium on Theoretical Aspects of Software Engineering, IEEE Compueter Society, 2016, pp.113-116, DOI: 10.1109/TASE.2016.25.

• [pdf] [slides] Kazunori Ueda: Logic/Constraint Programming and Concurrency: The Hard-Won Lessons of the Fifth Generation Computer Project. In Proc. 13th International Symposium on Functional and Logic Programming (FLOPS 2016), Oleg Kiselyov and Andy King (eds.), LNCS 9613, Springer-Verlang, 2016, pp.1-11, DOI: 10.1007/978-3-319-29604-3_1.

• [pdf] Kazuhiro Miyahara and Kazunori Ueda: Optimized Canonical Labeling Algorithm for Graph Rewriting Systems. Computer Software, Vol.33 (2016), No.1 pp.1_126-1_149, DOI: 10.11309/jssst.33.1_126.

• [pdf] Kazunori Ueda: Towards a Substrate Framework of Computation. In Concurrent Objects and Beyond, Gul Agha et al. (eds.), LNCS 8665, Springer-Verlag, 2014, pp.341-366, DOI: 10.1007/978-3-662-44471-9_15.

• [pdf] Alimujiang Yasen, Kazunori Ueda: Implementing a subset of Lambda Prolog in HyperLMNtal. In Proc. JSSST 2014, 2014. (11 pages)

• [pdf] Alimujiang Yasen, Kazunori Ueda: Encoding Type Systems into HyperLMNtal. In Proc. JSSST 2013, 2013. (6 pages)

• [pdf] Kazunori Ueda and Seiji Ogawa: HyperLMNtal: An Extension of a Hierarchical Graph Rewriting Model. Künstliche Intelligenz, Vol.26, No.1 (2012), pp.27-36. DOI: 10.1007/s13218-011-0162-3.

• [pdf] Manabu Meguro, Naoki Yaguchi, Kazunori Ueda: Model Checker for Multiple Models of Computation. In Proc. JSSST 2012, 2012. (13 pages)

• [pdf] Masato Gocho, Taisuke Hori and Kazunori Ueda, Evolution of the LMNtal Runtime to a Parallel Model Checker. Computer Software, Vol.28, No.4 (2011), pp.137-157l, DOI: 10.11309/jssst.28.4_137. (in Japanese)

• [pdf] Takayuki Ayano, Taisuke Hori, Hiroki Iwasawa, Seiji Ogawa and Kazunori Ueda, LMNtal Model Checking using an Integrated Development Environment. Computer Software, Vol.27, No.4 (2010), pp.197-214, DOI: 10.11309/jssst.27.4_197. (in Japanese)

• [pdf] [slides] Kazunori Ueda, Takayuki Ayano, Taisuke Hori, Hiroki Iwasawa and Seiji Ogawa, Hierarchical Graph Rewriting as a Unifying Tool for Analyzing and Understanding Nondeterministic Systems. In Proc. Sixth International Colloquium on Theoretical Aspects of Computing (ICTAC 2009), LNCS 5684, Springer, 2009, pp.349-355, DOI: 10.1007/978-3-642-03466-4_24.

• [pdf] Kazunori Ueda, LMNtal as a Hierarchical Logic Programming Language. Theoretical Computer Science, Vol.410, No.46 (2009), pp.4784-4800. doi: 10.1016/j.tcs.2009.07.043.

• [pdf] Kazunori Ueda, Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting. In Proc. 19th International Conference on Rewriting Techniques and Applications (RTA 2008), LNCS 5117, Springer, 2008, pp.392-408, DOI: 10.1007/978-3-540-70590-1_27.

• [pdf] [slides of the conference version] Kazunori Ueda, Encoding Distributed Process Calculi into LMNtal. Electronic Notes in Theoretical Computer Science, Vol.209 (2008), pp.187-200, DOI: 10.1016/j.entcs.2008.04.012.

• [pdf] Kazunori Ueda, Logic and Constraint Programming versus Concurrency. Computer Software, Vol.25, No.3 (2008), pp.49-54, DOI: 10.11309/jssst.25.3_49. (in Japanese)

• [pdf] Kei Murayama, Shintaro Kudo, Ken Sakurai, Ken Mizuno, Norio Kato and Kazunori Ueda, Implementation of the Hierarchical Graph Rewriting Language LMNtal. Computer Software, Vol.25, No.2 (2008), pp.47-77, DOI: 10.11309/jssst.25.2_47. (in Japanese)

• [pdf] Atsuyuki Inui, Shintaro Kudo, Koji Hara, Ken Mizuno, Norio Kato and Kazunori Ueda, LMNtal: The Unifying Programming Language Based on Hierarchical Graph Rewriting. Computer Software, Vol.25. No.1 (2008), pp.124-150, DOI: 10.11309/jssst.25.1_124. (in Japanese)

• [slides] Kazunori Ueda, Hierarchical graph rewriting as a unifying model of concurrency. LIX Colloquium on Emerging Trends in Concurrency Theory, Paris, November 13-15, 2006.

• [pdf] Kazunori Ueda, Norio Kato, Koji Hara and Ken Mizuno, LMNtal as a Unifying Declarative Language. In Proc. Third workshop on Constraint Handling Rules (CHR 2006), pp.1-15 (invited talk).

• [pdf] Kazunori Ueda, Logic Programming and Concurrency: a Personal Perspective. The ALP Newsletter, Vol.19, No.2, May 2006.

• [pdf] [slides] Kazunori Ueda, Constraint-Based Concurrency and Beyond. Electronic Notes in Theoretical Computer Science, Vol.162, pp.327-331, 2006, DOI:10.1016/j.entcs.2005.12.103. (Post-proceedings of the workshop Algebraic Process Calculi: The First Twenty Five Years and Beyond, Bertinoro, Italy, August 1-5, 2005)

• [pdf] [slides] Kazunori Ueda and Norio Kato, LMNtal: a language model with links and membranes. In Proc. Fifth Int. Workshop on Membrane Computing (WMC 2004), LNCS 3365, Springer, 2005, pp.110-125, DOI: 10.1007/978-3-540-31837-8_6. (invited lecture)

• [pdf] Kazunori Ueda and Norio Kato, The Language Model LMNtal. Computer Software, Vol.21, No.2 (2004), pp.44-60, DOI: 10.11309/jssst.21.126. (in Japanese)

• [pdf] Kazunori Ueda and Norio Kato, The Language Model LMNtal. In Proc. 19th Int. Conf. on Logic Programming (ICLP'03), LNCS 2916, Springer-Verlag, pp.517-518, 2003, DOI: 10.1007/978-3-540-24599-5_50.