default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHiroshi Unno 0001
Person information
- affiliation: University of Tsukuba, Japan
Other persons with the same name
- Hiroshi Unno 0002
![[0000-0001-9159-6185]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-9159-6185")
— Kanagawa Institute of Technology, Japan - Hiroshi Unno 0003 — Shizuoka University, Japan
- Hiroshi Unno 0004 — Hosei University, Faculty of Computer and Information Sciences, Japan
- Hiroshi Unno 0005 — Japan Advanced Institute of Science and Technology Asahidai, Tatsunokuchi, Ishikawa, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Satoshi Kura, Hiroshi Unno:
Automated Verification of Higher-Order Probabilistic Programs via a Dependent Refinement Type System. Proc. ACM Program. Lang. 8(ICFP): 973-1002 (2024)- [j9]Taro Sekiyama, Hiroshi Unno:
Higher-Order Model Checking of Effect-Handling Programs with Answer-Type Modification. Proc. ACM Program. Lang. 8(OOPSLA2): 2662-2691 (2024) - [j8]Takeshi Tsukada, Hiroshi Unno:
Inductive Approach to Spacer. Proc. ACM Program. Lang. 8(PLDI): 1979-2002 (2024) - [j7]Fuga Kawamata, Hiroshi Unno, Taro Sekiyama, Tachio Terauchi:
Answer Refinement Modification: Refinement Type System for Algebraic Effects and Handlers. Proc. ACM Program. Lang. 8(POPL): 115-147 (2024) - [i11]Satoshi Kura, Hiroshi Unno:
Automated Verification of Higher-Order Probabilistic Programs via a Dependent Refinement Type System. CoRR abs/2407.02975 (2024) - 2023
- [j6]Yu Gu, Takeshi Tsukada, Hiroshi Unno:
Optimal CHC Solving via Termination Proofs. Proc. ACM Program. Lang. 7(POPL): 604-631 (2023) - [j5]Taro Sekiyama, Hiroshi Unno:
Temporal Verification with Answer-Effect Modification: Dependent Temporal Type-and-Effect System with Delimited Continuations. Proc. ACM Program. Lang. 7(POPL): 2079-2110 (2023) - [j4]Hiroshi Unno, Tachio Terauchi, Yu Gu, Eric Koskinen:
Modular Primal-Dual Fixpoint Logic Solving for Temporal Verification. Proc. ACM Program. Lang. 7(POPL): 2111-2140 (2023) - [i10]Fuga Kawamata, Hiroshi Unno, Taro Sekiyama, Tachio Terauchi:
Answer Refinement Modification: Refinement Type System for Algebraic Effects and Handlers. CoRR abs/2307.15463 (2023) - 2022
- [j3]Takeshi Tsukada, Hiroshi Unno:
Software model-checking as cyclic-proof search. Proc. ACM Program. Lang. 6(POPL): 1-29 (2022) - [i9]Taro Sekiyama, Hiroshi Unno:
Temporal Verification with Answer-Effect Modification. CoRR abs/2207.10386 (2022) - 2021
- [c23]Satoshi Kura, Hiroshi Unno, Ichiro Hasuo:
Decision Tree Learning in CEGIS-Based Termination Analysis. CAV (2) 2021: 75-98 - [c22]Hiroshi Unno, Tachio Terauchi, Eric Koskinen:
Constraint-Based Relational Verification. CAV (1) 2021: 742-766 - [c21]Naoki Kobayashi, Taro Sekiyama, Issei Sato, Hiroshi Unno:
Toward Neural-Network-Guided Program Synthesis and Verification. SAS 2021: 236-260 - [i8]Naoki Kobayashi, Taro Sekiyama, Issei Sato, Hiroshi Unno:
Toward Neural-Network-Guided Program Synthesis and Verification. CoRR abs/2103.09414 (2021) - [i7]Satoshi Kura, Hiroshi Unno, Ichiro Hasuo:
Decision Tree Learning in CEGIS-Based Termination Analysis. CoRR abs/2104.11463 (2021) - [i6]Hiroshi Unno, Tachio Terauchi, Eric Koskinen:
Constraint-based Relational Verification. CoRR abs/2106.02628 (2021) - [i5]Takeshi Tsukada, Hiroshi Unno, Taro Sekiyama, Kohei Suenaga:
Enhancing Loop-Invariant Synthesis via Reinforcement Learning. CoRR abs/2107.09766 (2021) - [i4]Takeshi Tsukada, Hiroshi Unno:
Software Model-Checking as Cyclic-Proof Search. CoRR abs/2111.05617 (2021) - 2020
- [c20]Yuki Satake, Hiroshi Unno, Hinata Yanagi:
Probabilistic Inference for Predicate Constraint Satisfaction. AAAI 2020: 1644-1651 - [i3]Hiroshi Unno, Yuki Satake, Tachio Terauchi, Eric Koskinen:
Program Verification via Predicate Constraint Satisfiability Modulo Theories. CoRR abs/2007.03656 (2020)
2010 – 2019
- 2019
- [c19]Naoki Kobayashi, Takeshi Nishikawa, Atsushi Igarashi, Hiroshi Unno:
Temporal Verification of Programs via First-Order Fixpoint Logic. SAS 2019: 413-436 - 2018
- [j2]Hiroshi Unno, Yuki Satake, Tachio Terauchi:
Relatively complete refinement type system for verification of higher-order non-deterministic programs. Proc. ACM Program. Lang. 2(POPL): 12:1-12:29 (2018) - [c18]Yuki Satake, Hiroshi Unno:
Propositional Dynamic Logic for Higher-Order Functional Programs. CAV (1) 2018: 105-123 - [c17]Yoji Nanjo, Hiroshi Unno, Eric Koskinen, Tachio Terauchi:
A Fixpoint Logic and Dependent Effects for Temporal Property Verification. LICS 2018: 759-768 - 2017
- [c16]Hiroshi Unno, Sho Torii, Hiroki Sakamoto:
Automating Induction for Solving Horn Clauses. CAV (2) 2017: 571-591 - 2016
- [c15]Akihiro Murase, Tachio Terauchi, Naoki Kobayashi, Ryosuke Sato, Hiroshi Unno:
Temporal verification of higher-order functional programs. POPL 2016: 57-68 - [i2]Hiroshi Unno, Sho Torii:
Automating Induction for Solving Horn Clauses. CoRR abs/1610.06768 (2016) - 2015
- [j1]Hiroshi Unno, Naoshi Tabuchi, Naoki Kobayashi:
Verification of tree-processing programs via higher-order mode checking. Math. Struct. Comput. Sci. 25(4): 841-866 (2015) - [c14]Yuma Matsumoto, Naoki Kobayashi, Hiroshi Unno:
Automata-Based Abstraction for Automated Verification of Higher-Order Tree-Processing Programs. APLAS 2015: 295-312 - [c13]Takuya Kuwahara, Ryosuke Sato, Hiroshi Unno, Naoki Kobayashi:
Predicate Abstraction and CEGAR for Disproving Termination of Higher-Order Functional Programs. CAV (2) 2015: 287-303 - [c12]Tachio Terauchi, Hiroshi Unno:
Relaxed Stratification: A New Approach to Practical Complete Predicate Refinement. ESOP 2015: 610-633 - [c11]Kodai Hashimoto, Hiroshi Unno:
Refinement Type Inference via Horn Constraint Optimization. SAS 2015: 199-216 - [c10]Hiroshi Unno, Tachio Terauchi:
Inferring Simple Solutions to Recursion-Free Horn Clauses via Sampling. TACAS 2015: 149-163 - [i1]Kodai Hashimoto, Hiroshi Unno:
Refinement Type Inference via Horn Constraint Optimization. CoRR abs/1505.02878 (2015) - 2014
- [c9]Takuya Kuwahara, Tachio Terauchi, Hiroshi Unno, Naoki Kobayashi:
Automatic Termination Verification for Higher-Order Functional Programs. ESOP 2014: 392-411 - 2013
- [c8]Ryosuke Sato, Hiroshi Unno, Naoki Kobayashi:
Towards a scalable software model checker for higher-order programs. PEPM 2013: 53-62 - [c7]Hiroshi Unno, Tachio Terauchi, Naoki Kobayashi:
Automating relatively complete verification of higher-order functional programs. POPL 2013: 75-86 - 2011
- [c6]Naoki Kobayashi, Ryosuke Sato, Hiroshi Unno:
Predicate abstraction and CEGAR for higher-order model checking. PLDI 2011: 222-233 - 2010
- [c5]Hiroshi Unno, Naoshi Tabuchi, Naoki Kobayashi:
Verification of Tree-Processing Programs via Higher-Order Model Checking. APLAS 2010: 312-327 - [c4]Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno:
Higher-order multi-parameter tree transducers and recursion schemes for program verification. POPL 2010: 495-508
2000 – 2009
- 2009
- [c3]Hiroshi Unno, Naoki Kobayashi:
Dependent type inference with interpolants. PPDP 2009: 277-288 - 2008
- [c2]Hiroshi Unno, Naoki Kobayashi:
On-Demand Refinement of Dependent Types. FLOPS 2008: 81-96 - 2006
- [c1]Hiroshi Unno, Naoki Kobayashi, Akinori Yonezawa:
Combining type-based analysis and model checking for finding counterexamples against non-interference. PLAS 2006: 17-26
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-02 21:28 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:
