default search action
Kazunori Ueda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j22]Hussaini Aliyu Idris, Kazunori Ueda, Bassem Mokhtar, Samir A. Elsagheer Mohamed:
Novel Intelligent BSM Falsification Attack Detection System Using Trusted Neighbor Vehicle Approach in IoV. Int. J. Comput. 23(1): 116-125 (2024) - [c82]Olivia Nakayima
, Mostafa I. Soliman
Enhancing Bundle Delivery Efficiency in Mobile Ad-hoc Networks with a Multi-protocol Delay-Tolerant Network. CF 2024 - [c81]Haruto Mishina, Kazunori Ueda
Introducing Quantification into a Hierarchical Graph Rewriting Language. LOPSTR 2024: 220-239 - [c80]Naoki Yamamoto
Grammar-based Pattern Matching and Type Checking for Difference Data Structures. PPDP 2024: 13:1-13:13 - [i4]Haruto Mishina, Kazunori Ueda:
Introducing Quantification into a Hierarchical Graph Rewriting Language. CoRR abs/2409.11015 (2024) - 2023
- [j21]Jin Sano
Type Checking Data Structures More Complex than Trees. J. Inf. Process. 31: 112-130 (2023) - [c79]Kazunori Ueda, Kouki Yano:
DTN Routing Method Based on Records of Data Transmission Paths. BWCCA 2023: 273-281 - [c78]Jin Sano
Implementing the λ GT Language: A Functional Language with Graphs as First-Class Data. ICGT 2023: 263-277 - 2022
- [j20]Naoki Yamamoto
Engineering Grammar-Based Type Checking for Graph Rewriting Languages. IEEE Access 10: 114612-114628 (2022) - [c77]Kazunori Ueda:
In pursuit of Japanese-style Research and Education of Computer Software: Experiences with Software-Centered Research Projects. ICCTA 2022: 5-6 - [c76]Kazunori Ueda:
DTN Routing Method Based on Node Movement Prediction and Message Deliverability. NBiS 2022: 267-278 - [i3]Jin Sano, Naoki Yamamoto, Kazunori Ueda:
Type checking data structures more complex than trees. CoRR abs/2209.05149 (2022) - 2021
- [j19]Alimujiang Yasen
Revisiting Graph Types in HyperLMNtal: A Modeling Language for Hypergraph Rewriting. IEEE Access 9: 133449-133460 (2021) - 2020
- [c75]Hironori Washizaki, Kenji Tei, Kazunori Ueda, Hayato Yamana
Smart SE: Smart Systems and Services Innovative Professional Education Program. COMPSAC 2020: 1113-1114
2010 – 2019
- 2019
- [j18]Muhammad Hataba
Generation of Efficient Obfuscated Code through Just-in-Time Compilation. IEICE Trans. Inf. Syst. 102-D(3): 645-649 (2019) - [c74]Kazuma Ikenoue, Kazunori Ueda:
Routing Method Based on Data Transfer Path in DTN Environments. BWCCA 2019: 544-552 - [c73]Yunosuke Yamada, Masashi Sato, Kazunori Ueda:
Constraint-Based Modeling and Symbolic Simulation of Hybrid Systems with HydLa and HyLaGI. CyPhy/WESE 2019: 153-178 - [c72]Taichi Tomioka, Yutaro Tsunekawa, Kazunori Ueda:
Introducing Symmetry to Graph Rewriting Systems with Process Abstraction. ICGT 2019: 3-20 - [c71]Kazunori Ueda:
DTN Sub-ferry Nodes Placement with Consideration for Battery Consumption. NBiS 2019: 406-412 - [i2]Kazunori Ueda, Hiroshi Hosobe, Daisuke Ishii:
Declarative Semantics of the Hybrid Constraint Language HydLa. CoRR abs/1910.12272 (2019) - 2018
- [j17]Alimujiang Yasen, Kazunori Ueda:
Name Binding is Easy with Hypergraphs. IEICE Trans. Inf. Syst. 101-D(4): 1126-1140 (2018) - [j16]Kazunori Ueda, Makoto Iwata, Ken-ichi Baba, Shinji Shimojo:
Multi-overlay information management for IoT-oriented P2P network applications. Int. J. Space Based Situated Comput. 8(4): 204-213 (2018) - [j15]Yutaro Tsunekawa, Taichi Tomioka, Kazunori Ueda:
Implementation of LMNtal Model Checkers: a Metaprogramming Approach. J. Object Technol. 17(1): 1:1-28 (2018) - [j14]Kazunori Ueda:
Logic/Constraint Programming and Concurrency: The hard-won lessons of the Fifth Generation Computer project. Sci. Comput. Program. 164: 3-17 (2018) - [c70]Kazuma Ikenoue, Kazunori Ueda:
Score-Based Message Ferrying Approach for Evacuees on Delay Tolerant Networks. BWCCA 2018: 769-774 - [c69]Kazunori Ueda, Yusei Irifuku:
Peer-to-Peer Data Distribution System with Browser Cache Sharing. NBiS 2018: 590-597 - 2017
- [j13]Masami Hagiya, Kazunori Ueda, Ryutaro Ichise, Ferdinand Peper, Satoshi Murata:
Renewal of the Major Fields. New Gener. Comput. 35(2): 125-128 (2017) - [c68]Kazunori Ueda:
Performance Evaluation of Peer-to-Peer Network Applications on Multiple Overlay Networks. NBiS 2017: 750-756 - [c67]Hiroaki Akutsu, Takahiro Yamamoto, Kazunori Ueda, Hideo Saito:
MEC: Network Optimized Multi-stage Erasure Coding for Scalable Storage Systems. PRDC 2017: 292-300 - [c66]Alimujiang Yasen, Kazunori Ueda:
Unification of Hypergraph \lambda -Terms. TTCS 2017: 106-124 - 2016
- [j12]Hiroaki Akutsu, Kazunori Ueda, Takeru Chiba, Tomohiro Kawaguchi, Norio Shimozono:
Reliability and Failure Impact Analysis of Distributed Storage Systems with Dynamic Refuging. IEICE Trans. Inf. Syst. 99-D(9): 2259-2268 (2016) - [c65]Shinya Yano, Kazunori Ueda:
Improvement of WMNs routing method for the purpose of reduction of control communications. APNOMS 2016: 1-4 - [c64]Kenichi Betsuno, Shota Matsumoto, Kazunori Ueda:
Symbolic Analysis of Hybrid Systems Involving Numerous Discrete Changes Using Loop Detection. CyPhy 2016: 17-30 - [c63]Kazunori Ueda:
Logic/Constraint Programming and Concurrency: The Hard-Won Lessons of the Fifth Generation Computer Project. FLOPS 2016: 1-11 - [c62]Nanami Imada, Kazunori Ueda:
Peer-to-Peer Network System and Application Design on Multiple Virtual Networks. NBiS 2016: 298-302 - [c61]Alimujiang Yasen, Kazunori Ueda:
Hypergraph Representation of Lambda-Terms. TASE 2016: 113-116 - [c60]Shota Matsumoto, Kazunori Ueda:
Symbolic Simulation of Parametrized Hybrid Systems with Affine Arithmetic. TIME 2016: 4-11 - 2015
- [j11]Yuxi Fu, Kazunori Ueda:
Preface. Math. Struct. Comput. Sci. 25(4): 764 (2015) - [c59]Kazunori Ueda, Norio Kimura:
Network information sharing system with peer-to-peer network applications. APNOMS 2015: 534-537 - [c58]Kazuki Matsushita, Masashi Nishimine, Kazunori Ueda:
Cooperative Cache Distribution System for Virtual P2P Web Proxy. COMPSAC Workshops 2015: 646-647 - [c57]Shizuya Irimoto, Yuta Maruoka, Kazunori Ueda:
Performance evaluation of WMN routing methods considering amount of control packets. ICMU 2015: 80-81 - [c56]Wataru Kobayashi, Kazunori Ueda, Yuta Maruoka:
Performance Evaluation of Routing Method Based on Neighboring Node Information in WMN. NBiS 2015: 424-431 - [c55]Hiroaki Akutsu, Kazunori Ueda, Takeru Chiba, Tomohiro Kawaguchi, Norio Shimozono:
Reliability Analysis of Highly Redundant Distributed Storage Systems with Dynamic Refuging. PDP 2015: 261-268 - [c54]Shota Matsumoto, Fumihiko Kono, Teruya Kobayashi, Kazunori Ueda:
HyLaGI: Symbolic Implementation of a Hybrid Constraint Language HydLa. NSV 2015: 109-115 - 2014
- [c53]Wataru Kobayashi, Yuta Maruoka, Kazunori Ueda:
Routing Method Based on Relationships between Neighboring Nodes in Wireless Mesh Networks. AINA Workshops 2014: 180-184 - [c52]Kazunori Ueda:
Towards a Substrate Framework of Computation. Concurrent Objects and Beyond 2014: 341-366 - [c51]Kazuki Matsushita, Masashi Nishimine, Kazunori Ueda:
Cooperation P2P Web Proxy to Reduce Resource Usage. NBiS 2014: 420-425 - 2013
- [c50]Yuta Maruoka, Kazunori Ueda:
A Method for Establishing Routes and IPv6 Addressing Based on the Estimated Distance from Neighboring Nodes in Wireless Mesh Networks. AINA Workshops 2013: 21-26 - [c49]Kazunori Ueda, Jun-ichi Akase, Takuya Okubo:
Analysis of peer cluster layers selection criteria for P2P contents distribution systems. APNOMS 2013: 1-6 - [c48]Masashi Nishimine, Kazunori Ueda:
Design and Implementation of a Cache-less P2P Web Proxy. BWCCA 2013: 500-505 - 2012
- [j10]Kazunori Ueda, Seiji Ogawa:
HyperLMNtal: An Extension of a Hierarchical Graph Rewriting Model. Künstliche Intell. 26(1): 27-36 (2012) - [c47]Kazunori Ueda, Takuya Okubo:
Peer-to-Peer contents distribution system using multiple peer clusters. APNOMS 2012: 1-6 - [i1]Philippe Codognet, Kazunori Ueda, Hiroshi Hosobe:
Parallel Methods for Constraint Solving and Combinatorial Optimization (NII Shonan Meeting 2012-5). NII Shonan Meet. Rep. 2012 (2012) - 2011
- [j9]Daisuke Ishii, Kazunori Ueda, Hiroshi Hosobe:
An interval-based SAT modulo ODE solver for model checking nonlinear hybrid systems. Int. J. Softw. Tools Technol. Transf. 13(5): 449-461 (2011) - [c46]Takuya Okubo, Kazunori Ueda:
Peer-to-Peer contents delivery system considering network distance. APNOMS 2011: 1-4 - 2010
- [e4]Kazunori Ueda:
Programming Languages and Systems - 8th Asian Symposium, APLAS 2010, Shanghai, China, November 28 - December 1, 2010. Proceedings. Lecture Notes in Computer Science 6461, Springer 2010, ISBN 978-3-642-17163-5 [contents]
2000 – 2009
- 2009
- [j8]Kazunori Ueda:
LMNtal as a hierarchical logic programming language. Theor. Comput. Sci. 410(46): 4784-4800 (2009) - [c45]Daisuke Ishii, Kazunori Ueda, Hiroshi Hosobe, Alexandre Goldsztejn:
Interval-based Solving of Hybrid Constraint Systems. ADHS 2009: 144-149 - [c44]Kazunori Ueda, Kazuhisa Kawada:
Asymmetric DHT Based on Performance of Peers. APNOMS 2009: 427-430 - [c43]Kazunori Ueda, Takayuki Ayano, Taisuke Hori, Hiroki Iwasawa, Seiji Ogawa:
Hierarchical Graph Rewriting as a Unifying Tool for Analyzing and Understanding Nondeterministic Systems. ICTAC 2009: 349-355 - [c42]Kazunori Ueda, Ken-ichi Baba:
Proposal of an Initial Route Establishment Method in Wireless Mesh Networks. SAINT 2009: 173-176 - [c41]Kei Ohmura, Kazunori Ueda:
c-sat: A Parallel SAT Solver for Clusters. SAT 2009: 524-537 - [c40]Daisuke Ishii, Kazunori Ueda, Hiroshi Hosobe:
Simulation of hybrid systems based on hierarchical interval constraints. SimuTools 2009: 37 - 2008
- [c39]Kazunori Ueda:
Encoding the Pure Lambda Calculus into Hierarchical Graph Rewriting. RTA 2008: 392-408 - 2006
- [c38]Kazunori Ueda, Norio Kato, Koji Hara, Ken Mizuno:
LMNtal as a Unifying Declarative Language: Live Demonstration. ICLP 2006: 457-458 - [c37]Kazunori Ueda:
Encoding Distributed Process Calculi into LMNtal. LIX 2006: 187-200 - 2005
- [c36]Kazunori Ueda:
Constraint-Based Concurrency and Beyond. APC 25 2005: 327-331 - 2004
- [c35]Kazunori Ueda, Norio Kato:
LMNtal: A Language Model with Links and Membranes. Workshop on Membrane Computing 2004: 110-125 - 2003
- [c34]Kazunori Ueda, Norio Kato:
The Language Model LMNtal. ICLP 2003: 517-518 - [c33]Kazunori Ueda, Hiroyuki Ohsaki, Shinji Shimojo
Design and Implementation of Real-Time Digital Video Streaming System over IPv6 Network using Feedback Control. SAINT 2003: 111-119 - 2002
- [j7]Yasuhiro Ajiro, Kazunori Ueda:
Kima: An Automated Error Correction System for Concurrent Logic Programs. Autom. Softw. Eng. 9(1): 67-94 (2002) - [j6]Herbert Kuchen, Kazunori Ueda:
Editorial: Functional and Logic Programming. J. Funct. Log. Program. 2002 (2002) - [c32]Kazunori Ueda:
Programming with Logical Links. APLAS 2002: 115-126 - [c31]Kazunori Ueda:
A Pure Meta-interpreter for Flat GHC, a Concurrent Constraint Language. Computational Logic: Logic Programming and Beyond 2002: 138-161 - 2001
- [c30]Norio Kato, Kazunori Ueda:
Optimizing Compilation of Concurrent Logic Programs Directed by Interface Analysis. APLAS 2001: 237-250 - [c29]Kazunori Ueda:
Resource-Passing Concurrent Programming. APLAS 2001: 313-327 - [c28]Michiya Okamoto, Kazunori Ueda, Junzo Kamahara, Shinji Shimojo
An Architecture of Personalized Sports Digest System with Scenario Templates. DASFAA 2001: 170-171 - [c27]Kazunori Ueda:
A Close Look at Constraint-Based Concurrency. ICLP 2001: 9 - [c26]Kazunori Ueda:
Resource-Passing Concurrent Programming. TACS 2001: 95-126 - [e3]Herbert Kuchen, Kazunori Ueda:
Functional and Logic Programming, 5th International Symposium, FLOPS 2001, Tokyo, Japan, March 7-9, 2001, Proceedings. Lecture Notes in Computer Science 2024, Springer 2001, ISBN 3-540-41739-7 [contents] - 2000
- [c25]Yasuhiro Ajiro, Kazunori Ueda:
Kima- An automated error correction system for concurrent logic programs. AADEBUG 2000 - [c24]Kazunori Ueda:
Linearity Analysis of Concurrent Logic Programs. APLAS 2000: 51-68 - [c23]Yasuhiro Ajiro, Kazunori Ueda:
Kima - An Automated Error Correction System for Concurrent Logic Programs. APLAS 2000: 99-118
1990 – 1999
- 1999
- [c22]Kazunori Ueda:
Linearity Analysis of Concurrent Logic Programs. WOID@ICLP 1999: 188 - [p1]Kazunori Ueda:
Concurrent Logic/Constraint Programming: The Next 10 Years. The Logic Programming Paradigm 1999: 53-71 - 1998
- [c21]Junzo Kamahara, Yuji Nomura, Kazunori Ueda, Keishi Kandori, Shinji Shimojo, Hideo Miyahara:
A TV News Recommendation System with Automatic Recomposition. AMCP 1998: 221-235 - [c20]Yasuhiro Ajiro, Kazunori Ueda, Kenta Cho:
Error-Correcting Source Code. CP 1998: 40-54 - 1997
- [e2]R. K. Shyamasundar, Kazunori Ueda:
Advances in Computing Science - ASIAN '97, Third Asian Computing Science Conference, Kathmandu, Nepal, December 9-11, 1997, Proceedings. Lecture Notes in Computer Science 1345, Springer 1997, ISBN 3-540-63875-X [contents] - 1996
- [c19]Kenta Cho, Kazunori Ueda:
Diagnosing Non-Well-Moded Concurrent Logic Programs. JICSLP 1996: 215-229 - 1995
- [c18]Kazunori Ueda:
Experiences with Strong Moding in Concurrent Logic/Constraint Programming. PSLS 1995: 134-153 - 1994
- [j5]Kazunori Ueda, Masao Morita:
Moded Flat GHC and Its Message-Oriented Implementation Technique. New Gener. Comput. 13(1): 3-43 (1994) - [c17]Kazunori Ueda:
The Mode System of Moded Flat GHC. Specification of Parallel Algorithms 1994: 259-274 - [c16]Makoto Amamiya, Masahiko Satoh, Akifumi Makinouchi, Ken-Ichi Hagiwara, Taiichi Yuasa, Hitoshi Aida, Kazunori Ueda, Keijiro Araki, Tetsuo Ida, Takanobu Baba:
Research on programming languages for massively parallel processing. ISPAN 1994: 443-450 - [c15]Kazunori Ueda:
I/O Mode Analysis in Concurrent Logic Programming. Theory and Practice of Parallel Programming 1994: 356-368 - 1993
- [j4]Ehud Shapiro, David H. D. Warren, Kazuhiro Fuchi, Robert A. Kowalski, Koichi Furukawa, Kazunori Ueda, Kenneth M. Kahn, Takashi Chikayama, Evan Tick:
The Fifth Generation Project: Personal Perspectives. Commun. ACM 36(3): 46-103 (1993) - [j3]Kazunori Ueda, Masao Morita:
Message-Oriented Parallel Implementation of Moded Flat GHC. New Gener. Comput. 11(3): 323-341 (1993) - 1992
- [c14]Kazunori Ueda, Masao Morita:
Message-Oriented Parallel Implementation of Moded Flat GHC. FGCS 1992: 799-808 - 1991
- [e1]Vijay A. Saraswat, Kazunori Ueda:
Logic Programming, Proceedings of the 1991 International Symposium, San Diego, California, USA, Oct. 28 - Nov 1, 1991. MIT Press 1991, ISBN 0-262-69147-7 [contents] - 1990
- [j2]Kazunori Ueda, Takashi Chikayama:
Design of the Kernel Language for the Parallel Inference Machine. Comput. J. 33(6): 494-500 (1990) - [c13]Kazunori Ueda, Masao Morita:
A New Implementation Technique for Flat GHC. ICLP 1990: 3-17
1980 – 1989
- 1989
- [c12]Kazunori Ueda:
Parallelism in Logic Programming. IFIP Congress 1989: 957-964 - 1988
- [c11]Kazunori Ueda:
Theory and Practice of Concurrent Systems - The Role of Kernel Language in the FGCS Project. FGCS 1988: 165-166 - [c10]Kazunori Ueda, Koichi Furukawa:
Transformation Rules for GHC Programs. FGCS 1988: 582-591 - [c9]Koichi Furukawa, Kazunori Ueda:
GHC - A Language for a New Age of Parallel Programming. FSTTCS 1988: 364-376 - 1987
- [j1]Kazunori Ueda:
Making Exhaustive Search Programs Deterministic. New Gener. Comput. 5(1): 29-44 (1987) - [c8]Kazunori Ueda:
Making Exhaustive Search Programs Deterministic, Part II. ICLP 1987: 356-375 - 1986
- [c7]Jiro Tanaka, Kazunori Ueda, Tashihiko Miyazaki, Akikazu Takeuchi, Yuji Matsumoto, Koichi Furukawa:
Guarded Horn Clauses and Experience with Parallel Logic Programming. FJCC 1986: 948-954 - [c6]Kazunori Ueda:
Making Exhaustive Search Programs Deterministic. ICLP 1986: 270-282 - 1985
- [c5]Kazunori Ueda:
Guarded Horn Clauses. LP 1985: 168-179 - [c4]Kazunori Ueda, Takashi Chikayama:
Concurrent Prolog Compiler on Top of Prolog. SLP 1985: 119-126 - 1984
- [c3]Kazunori Ueda, Takashi Chikayama:
Efficient Stream/Array Processing in Logic Programming Languages. FGCS 1984: 317-326 - [c2]Hideyuki Nakashima, Satoru Tomura, Kazunori Ueda:
What is a Variable in Prolog? FGCS 1984: 327-332 - [c1]Koichi Furukawa, Akikazu Takeuchi, Susumu Kunifuji, Hideki Yasukawa, Masaru Ohki, Kazunori Ueda:
MANDELA: A LogicBased Knowledge Programming System. FGCS 1984: 613-622
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 21:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: