default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNao Hirokawa
Person information
- affiliation: Japan Advanced Institute of Science and Technology, Ishikawa, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Kiraku Shintani, Nao Hirokawa:
Compositional Confluence Criteria. Log. Methods Comput. Sci. 20(1) (2024)- [c31]Nao Hirokawa, Dohan Kim
, Kiraku Shintani, René Thiemann:
Certification of Confluence- and Commutation-Proofs via Parallel Critical Pairs. CPP 2024: 147-161 - [c30]Teppei Saito, Nao Hirokawa:
Simulating Dependency Pairs by Semantic Labeling. FSCD 2024: 13:1-13:20 - [i10]Johannes Niederhauser, Nao Hirokawa, Aart Middeldorp:
Left-Linear Completion with AC Axioms. CoRR abs/2405.17109 (2024) - 2023
- [c29]Johannes Niederhauser, Nao Hirokawa, Aart Middeldorp:
Left-Linear Completion with AC Axioms. CADE 2023: 401-418 - [c28]Teppei Saito, Nao Hirokawa:
Weighted Path Orders Are Semantic Path Orders. FroCoS 2023: 63-80 - [c27]Nao Hirokawa, Aart Middeldorp:
Hydra Battles and AC Termination. FSCD 2023: 12:1-12:16 - [i9]Kiraku Shintani, Nao Hirokawa:
Compositional Confluence Criteria. CoRR abs/2303.03906 (2023) - [i8]Teppei Saito, Nao Hirokawa:
Generalizing Weighted Path Orders. CoRR abs/2307.13973 (2023) - [i7]Nao Hirokawa, Aart Middeldorp:
Hydra Battles and AC Termination, Revisited. CoRR abs/2307.14036 (2023) - 2022
- [c26]Kiraku Shintani, Nao Hirokawa:
Compositional Confluence Criteria. FSCD 2022: 28:1-28:19 - 2021
- [c25]Nao Hirokawa:
Completion and Reduction Orders (Invited Talk). FSCD 2021: 2:1-2:9
2010 – 2019
- 2019
- [j7]Nao Hirokawa, Aart Middeldorp, Christian Sternagel, Sarah Winkler:
Abstract Completion, Formalized. Log. Methods Comput. Sci. 15(3) (2019) - [c24]Nao Hirokawa, Julian Nagele, Vincent van Oostrom, Michio Oyamaguchi:
Confluence by Critical Pair Analysis Revisited. CADE 2019: 319-336 - [i6]Nao Hirokawa, Julian Nagele, Vincent van Oostrom, Michio Oyamaguchi:
Confluence by Critical Pair Analysis Revisited (Extended Version). CoRR abs/1905.11733 (2019) - 2018
- [c23]Nao Hirokawa, Julian Nagele, Aart Middeldorp:
Cops and CoCoWeb: Infrastructure for Confluence Tools. IJCAR 2018: 346-353 - [c22]Takahito Aoto, Makoto Hamana, Nao Hirokawa, Aart Middeldorp, Julian Nagele, Naoki Nishida, Kiraku Shintani, Harald Zankl:
Confluence Competition 2018. FSCD 2018: 32:1-32:5 - [i5]Nao Hirokawa, Aart Middeldorp, Christian Sternagel, Sarah Winkler:
Abstract Completion, Formalized. CoRR abs/1802.08437 (2018) - 2017
- [c21]Nao Hirokawa, Aart Middeldorp, Christian Sternagel, Sarah Winkler:
Infinite Runs in Abstract Completion. FSCD 2017: 19:1-19:16 - [i4]Nao Hirokawa, Julian Nagele, Vincent van Oostrom, Michio Oyamaguchi:
Critical Peaks Redefined - $Φ\sqcup Ψ= \top$. CoRR abs/1708.07877 (2017) - 2016
- [j6]Akihisa Yamada, Sarah Winkler, Nao Hirokawa, Aart Middeldorp:
AC-KBO revisited. Theory Pract. Log. Program. 16(2): 163-188 (2016) - 2015
- [c20]Takahito Aoto, Nao Hirokawa, Julian Nagele, Naoki Nishida, Harald Zankl:
Confluence Competition 2015. CADE 2015: 101-104 - [c19]Kiraku Shintani, Nao Hirokawa:
CoLL: A Confluence Tool for Left-Linear Term Rewrite Systems. CADE 2015: 127-136 - [c18]Nao Hirokawa, Aart Middeldorp, Georg Moser:
Leftmost Outermost Revisited. RTA 2015: 209-222 - 2014
- [c17]Akihisa Yamada, Sarah Winkler, Nao Hirokawa, Aart Middeldorp:
AC-KBO Revisited. FLOPS 2014: 319-335 - [c16]Nao Hirokawa, Aart Middeldorp, Christian Sternagel:
A New and Formalized Proof of Abstract Completion. ITP 2014: 292-307 - [c15]Nao Hirokawa, Georg Moser:
Automated Complexity Analysis Based on Context-Sensitive Rewriting. RTA-TLCA 2014: 257-271 - [i3]Akihisa Yamada, Sarah Winkler, Nao Hirokawa, Aart Middeldorp:
AC-KBO Revisited. CoRR abs/1403.0406 (2014) - 2013
- [j5]Nao Hirokawa, Aart Middeldorp, Harald Zankl:
Uncurrying for Termination and Complexity. J. Autom. Reason. 50(3): 279-315 (2013) - 2012
- [c14]Dominik Klein, Nao Hirokawa:
Confluence of Non-Left-Linear TRSs via Relative Termination. LPAR 2012: 258-273 - 2011
- [j4]Nao Hirokawa, Aart Middeldorp:
Decreasing Diagrams and Relative Termination. J. Autom. Reason. 47(4): 481-501 (2011) - [c13]Dominik Klein, Nao Hirokawa:
Maximal Completion. RTA 2011: 71-80 - [i2]Nao Hirokawa, Georg Moser:
Automated Complexity Analysis Based on the Dependency Pair Method. CoRR abs/1102.3129 (2011) - 2010
- [c12]Nao Hirokawa, Aart Middeldorp:
Decreasing Diagrams and Relative Termination. IJCAR 2010: 487-501 - [c11]Harald Zankl, Nao Hirokawa, Aart Middeldorp:
Uncurrying for Innermost Termination and Derivational Complexity. HOR 2010: 46-57
2000 – 2009
- 2009
- [j3]Harald Zankl, Nao Hirokawa, Aart Middeldorp:
KBO Orientability. J. Autom. Reason. 43(2): 173-201 (2009) - [i1]Nao Hirokawa, Aart Middeldorp:
Decreasing Diagrams and Relative Termination. CoRR abs/0910.2853 (2009) - 2008
- [c10]Nao Hirokawa, Georg Moser:
Automated Complexity Analysis Based on the Dependency Pair Method. IJCAR 2008: 364-379 - [c9]Nao Hirokawa, Georg Moser:
Complexity, Graphs, and the Dependency Pair Method. LPAR 2008: 652-666 - [c8]Nao Hirokawa, Aart Middeldorp, Harald Zankl:
Uncurrying for Termination. LPAR 2008: 667-681 - 2007
- [j2]Nao Hirokawa, Aart Middeldorp:
Tyrolean termination tool: Techniques and features. Inf. Comput. 205(4): 474-511 (2007) - [c7]Harald Zankl, Nao Hirokawa, Aart Middeldorp:
Constraints for Argument Filterings. SOFSEM (1) 2007: 579-590 - 2006
- [c6]Nao Hirokawa, Aart Middeldorp:
Predictive Labeling. RTA 2006: 313-327 - 2005
- [j1]Nao Hirokawa, Aart Middeldorp:
Automating the dependency pair method. Inf. Comput. 199(1-2): 172-199 (2005) - [c5]Nao Hirokawa, Aart Middeldorp:
Tyrolean Termination Tool. RTA 2005: 175-184 - 2004
- [c4]Nao Hirokawa, Aart Middeldorp:
Polynomial Interpretations with Negative Coefficients. AISC 2004: 185-198 - [c3]Nao Hirokawa, Aart Middeldorp:
Dependency Pairs Revisited. RTA 2004: 249-268 - 2003
- [c2]Nao Hirokawa, Aart Middeldorp:
Automating the Dependency Pair Method. CADE 2003: 32-46 - [c1]Nao Hirokawa, Aart Middeldorp:
Tsukuba Termination Tool. RTA 2003: 311-320
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-07 21:21 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:
