default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaisuke Kimura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Kenji Saotome
, Koji Nakazawa, Daisuke Kimura:
Restriction on cut rule in cyclic-proof system for symbolic heaps. Theor. Comput. Sci. 1019: 114854 (2024)- 2023
- [j10]Tatsuya Abe, Daisuke Kimura:
Extending a Call-by-Value Calculus Based on Bilateralism with Dynamic Binding. FLAP 10(4): 511-530 (2023) - [j9]Tatsuya Abe, Daisuke Kimura:
A typed lambda-calculus with first-class configurations. J. Log. Comput. 33(7): 1527-1565 (2023) - 2022
- [i6]Yukihiro Masuoka, Daisuke Kimura:
A study for recovering the cut-elimination property in cyclic proof systems by restricting the arity of inductive predicates. CoRR abs/2203.05791 (2022) - 2021
- [j8]Daisuke Kimura, Makoto Tatsuta:
Decidability for Entailments of Symbolic Heaps with Arrays. Log. Methods Comput. Sci. 17(2) (2021) - [c12]Daisuke Kimura, Mahmudul Faisal Al Ameen, Makoto Tatsuta, Koji Nakazawa:
Function Pointer Eliminator for C Programs. APLAS 2021: 23-37 - [c11]Kenji Saotome, Koji Nakazawa, Daisuke Kimura:
Failure of Cut-Elimination in the Cyclic Proof System of Bunched Logic with Inductive Propositions. FSCD 2021: 11:1-11:14 - [i5]Tatsuya Abe, Daisuke Kimura:
A Symmetric Lambda-Calculus Corresponding to the Negation-Free Bilateral Natural Deduction. CoRR abs/2101.12607 (2021) - 2020
- [c10]Kenji Saotome, Koji Nakazawa, Daisuke Kimura:
Restriction on Cut in Cyclic Proof System for Symbolic Heaps. FLOPS 2020: 88-105
2010 – 2019
- 2019
- [c9]Makoto Tatsuta, Koji Nakazawa, Daisuke Kimura:
Completeness of Cyclic Proofs for Symbolic Heaps with Inductive Definitions. APLAS 2019: 367-387 - 2018
- [i4]Daisuke Kimura, Makoto Tatsuta:
Decidability for Entailments of Symbolic Heaps with Arrays. CoRR abs/1802.05935 (2018) - [i3]Makoto Tatsuta, Koji Nakazawa, Daisuke Kimura:
Completeness of Cyclic Proofs for Symbolic Heaps. CoRR abs/1804.03938 (2018) - 2017
- [c8]Daisuke Kimura, Makoto Tatsuta:
Decision Procedure for Entailment of Symbolic Heaps with Arrays. APLAS 2017: 169-189 - [i2]Daisuke Kimura, Makoto Tatsuta:
Decision Procedure for Entailment of Symbolic Heaps with Arrays. CoRR abs/1708.06696 (2017) - 2015
- [c7]Makoto Tatsuta, Daisuke Kimura:
Separation Logic with Monadic Inductive Definitions and Implicit Existentials. APLAS 2015: 69-89 - 2014
- [j7]Daisuke Kimura, Kumiko Tanaka-Ishii:
Study on Constants of Natural Language Texts. Inf. Media Technol. 9(4): 771-789 (2014) - 2013
- [j6]Daisuke Kimura, Makoto Tatsuta:
Call-by-Value and Call-by-Name Dual Calculi with Inductive and Coinductive Types. Log. Methods Comput. Sci. 9(1) (2013) - [c6]Yoshihiko Kakutani, Daisuke Kimura:
Induction by Coinduction and Control Operators in Call-by-Name. COS 2013: 101-112 - 2012
- [c5]Daisuke Kimura, Hisashi Kashima:
Fast Computation of Subpath Kernel for Trees. ICML 2012 - [i1]Daisuke Kimura, Hisashi Kashima:
Fast Computation of Subpath Kernel for Trees. CoRR abs/1206.4642 (2012) - 2011
- [j5]Daisuke Kimura, Toshimichi Saito:
A Trade-Off between the Maximum Power Point and Stability. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(7): 1513-1518 (2011) - [j4]Daisuke Kimura, Yoshihiko Kakutani:
Classical Natural Deduction for S4 Modal Logic. New Gener. Comput. 29(1): 61-86 (2011) - [c4]Daisuke Kimura, Tetsuji Kuboyama, Tetsuo Shibuya, Hisashi Kashima:
A Subpath Kernel for Rooted Unordered Trees. PAKDD (1) 2011: 62-74
2000 – 2009
- 2009
- [j3]Toshimichi Saito, Daisuke Kimura:
Synchronization and Hyperchaos in Switched Dynamical Systems Based on Parallel Buck Converters. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(8): 2061-2066 (2009) - [c3]Daisuke Kimura, Yoshihiko Kakutani:
Classical Natural Deduction for S4 Modal Logic. APLAS 2009: 243-258 - [c2]Daisuke Kimura, Makoto Tatsuta:
Dual Calculus with Inductive and Coinductive Types. RTA 2009: 224-238 - 2008
- [j2]Yuki Ishikawa, Daisuke Kimura, Yasuhide Ishige, Toshimichi Saito:
Analysis of Simple Single/Parallel Switched Dynamical Systems Based on Two Switching Strategies. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(8): 2076-2083 (2008) - 2007
- [j1]Daisuke Kimura:
Duality between Call-by-value Reductions and Call-by-name Reductions. Inf. Media Technol. 2(2): 537-573 (2007) - [c1]Daisuke Kimura:
Call-by-Value Is Dual to Call-by-Name, Extended. APLAS 2007: 415-430
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-12-10 20:51 CET 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:
