Diff of Publications/copy2 - LMNtal PukiWiki

The added line is THIS COLOR.
The deleted line is THIS COLOR.
Go to Publications/copy2.
Deleting diff of Publications/copy2
#author("2024-06-27T12:05:45+09:00","default:LMNtal","LMNtal")
#author("2024-06-27T12:10:27+09:00","default:LMNtal","LMNtal")
[[Publications]]

* Publications and Presentations [#c568e38a]

- [[[extended abstract and poster pdf]>https://conf.researchr.org/details/aplas-2023/src-and-posters/4/-Non-SRC-Encoding-MELL-Cut-Elimination-into-a-Hierarchical-Graph-Rewriting-Language]]
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]>https://doi.org/10.1007/978-3-031-36709-0_14]]
[&ref(ICGT2023.pdf,,slides);] 
Jin Sano and Kazunori Ueda, Implementing the &#955;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]>https://doi.org/10.2197/ipsjjip.31.112]] 
[&ref(SWoPP2022-slides-v2.pdf,,slides);] 
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]>https://doi.org/10.1109/ACCESS.2022.3217913]] 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]>https://doi.org/10.1109/ACCESS.2021.3112903]]
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]>https://sites.google.com/view/gcm2021/pre-proceedings]]
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]>https://doi.org/10.1007/978-3-030-23611-3_1]]
[&ref(ICGT2019.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]>https://www.jstage.jst.go.jp/article/transinf/E101.D/4/E101.D_2017EDP7257/_article]] 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]>https://www.jot.fm/contents/issue_2018_01/article1.html]] 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]>https://link.springer.com/chapter/10.1007/978-3-319-68953-1_9]] 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]>https://doi.org/10.1016/j.scico.2017.06.002]] 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]>http://2016.splashcon.org/event/meta2016-implementation-of-lmntal-model-checkers-a-metaprogramming-approach]]
[&ref(meta2016_slide.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]>http://doi.ieeecomputersociety.org/10.1109/TASE.2016.25]] 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]>http://link.springer.com/chapter/10.1007/978-3-319-29604-3_1]]
[&ref(FLOPS2016-v4.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]>https://www.jstage.jst.go.jp/article/jssst/33/1/33_1_126/_article]] 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]>http://www.ueda.info.waseda.ac.jp/~ueda/pub/COB2012-ueda.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]>http://jssst.or.jp/files/user/taikai/2014/PPL/PPL6-4.pdf]] Alimujiang Yasen, Kazunori Ueda: Implementing a subset of Lambda Prolog in HyperLMNtal. In Proc. JSSST 2014, 2014. (11 pages)

- [[[pdf]>http://jssst.or.jp/files/user/taikai/2013/hoga3/hoga3-1.pdf]] Alimujiang Yasen, Kazunori Ueda: Encoding Type Systems into HyperLMNtal. In Proc. JSSST 2013, 2013. (6 pages)

- [[[pdf]>https://link.springer.com/article/10.1007/s13218-011-0162-3]] Kazunori Ueda and Seiji Ogawa: HyperLMNtal: An Extension of a Hierarchical Graph Rewriting Model. K&#252;nstliche Intelligenz, Vol.26, No.1 (2012), pp.27-36. DOI: 10.1007/s13218-011-0162-3. 

- [[[pdf]>http://www.ueda.info.waseda.ac.jp/pub/jssst2012_meguro.pdf]] Manabu Meguro, Naoki Yaguchi, Kazunori Ueda: Model Checker for Multiple Models of Computation.  In Proc. JSSST 2012, 2012. (13 pages)

- [[[pdf]>https://www.jstage.jst.go.jp/article/jssst/28/4/28_4_4_137/_article/-char/en/]] 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]>https://www.jstage.jst.go.jp/article/jssst/27/4/27_4_4_197/_article/-char/en/]] 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]>https://link.springer.com/chapter/10.1007/978-3-642-03466-4_24]]
[&ref(ICTAC09.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]>http://dx.doi.org/10.1016/j.tcs.2009.07.043]] 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]>https://link.springer.com/chapter/10.1007/978-3-540-70590-1_27]] 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]>https://doi.org/10.1016/j.entcs.2008.04.012]]
[&ref(ambient-jssst2006.pdf,,slides);] 
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]>https://www.jstage.jst.go.jp/article/jssst/25/3/25_3_3_49/_article/-char/en/]] 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]>https://www.jstage.jst.go.jp/article/jssst/25/2/25_2_2_47/_article/-char/en/]] 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]>https://www.jstage.jst.go.jp/article/jssst/25/1/25_1_1_124/_article/-char/en/]] 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)

- [&ref(LIX-colloquium-2006.pdf,,slides);] 
Kazunori Ueda, Hierarchical graph rewriting as a unifying model of concurrency.
[[LIX Colloquium on Emerging Trends in Concurrency Theory>http://www.lix.polytechnique.fr/comete/conferences/LIXColloquium2006/page/talks.html]],
Paris, November 13-15, 2006.

- [[[pdf]>http://www.ueda.info.waseda.ac.jp/~ueda/pub/chrworkshop-ueda.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)>https://www.cs.kuleuven.be/publicaties/rapporten/cw/CW452.abs.html]], pp.1-15 (invited talk).

- [[[pdf]>https://doi.org/10.1016/j.entcs.2005.12.103]]
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.

- [[[pdf]>http://www.cs.kuleuven.ac.be/~dtai/projects/ALP/newsletter/may06/nav/articles/ueda/article.html]] Kazunori Ueda, Logic Programming and Concurrency: a Personal Perspective. The ALP Newsletter, Vol.19, No.2, May 2006.

- 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.
- [[[pdf]>https://dio.org/10.1016/j.entcs.2005.12.103]]
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.

- [[[pdf]>http://www.ueda.info.waseda.ac.jp/~ueda/pub/wmc5-ueda-revised.pdf]]
[&ref(LMNtal-WMC2004.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]>https://www.jstage.jst.go.jp/article/jssst/21/2/21_2_126/_article/-char/en/]] 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]>https://doi.org/10.1007/978-3-540-24599-5_50]] 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.