Hiroshi Unno

发表

Verification of Tree-Processing Programs via Higher-Order Model Checking

Naoki Kobayashi, Hiroshi Unno, Naoshi Tabuchi, 2010, APLAS.

Temporal Verification of Programs via First-Order Fixpoint Logic

Atsushi Igarashi, Naoki Kobayashi, Hiroshi Unno, 2019, SAS.

Predicate abstraction and CEGAR for higher-order model checking

Naoki Kobayashi, Ryosuke Sato, Hiroshi Unno, 2011, PLDI '11.

Predicate Abstraction and CEGAR for Disproving Termination of Higher-Order Functional Programs

Naoki Kobayashi, Ryosuke Sato, Takuya Kuwahara, 2015, CAV.

Relaxed Stratification: A New Approach to Practical Complete Predicate Refinement

Tachio Terauchi, Hiroshi Unno, Tachio Terauchi, 2015, ESOP.

Towards a scalable software model checker for higher-order programs

Naoki Kobayashi, Ryosuke Sato, Hiroshi Unno, 2013, PEPM '13.

Depth-First Layout Algorithm for Trees

Youzou Miyadera, Takeo Yaku, Koushi Anzai, 1998, Inf. Process. Lett..

Automata-Based Abstraction for Automated Verification of Higher-Order Tree-Processing Programs

Naoki Kobayashi, Hiroshi Unno, Yuma Matsumoto, 2015, APLAS.

Combining type-based analysis and model checking for finding counterexamples against non-interference

Akinori Yonezawa, Naoki Kobayashi, Hiroshi Unno, 2006, PLAS '06.

Propositional Dynamic Logic for Higher-Order Functional Programs

Yuki Satake, Hiroshi Unno, Hiroshi Unno, 2018, CAV.

Dependent type inference with interpolants

Naoki Kobayashi, Hiroshi Unno, N. Kobayashi, 2009, PPDP '09.

Verification of tree-processing programs via higher-order mode checking

Naoki Kobayashi, Hiroshi Unno, Naoshi Tabuchi, 2015, Math. Struct. Comput. Sci..

Relatively complete refinement type system for verification of higher-order non-deterministic programs

Tachio Terauchi, Yuki Satake, Hiroshi Unno, 2018, Proc. ACM Program. Lang..

Automatic Termination Verification for Higher-Order Functional Programs

Naoki Kobayashi, Tachio Terauchi, Takuya Kuwahara, 2014, ESOP.

Temporal verification of higher-order functional programs

Naoki Kobayashi, Ryosuke Sato, Tachio Terauchi, 2016, POPL.

Proceedings 5th Workshop on Horn Clauses for Verification and Synthesis: Horn Clauses and Beyond for Relational and Temporal Program Verification

Hiroshi Unno, 2018 .

Automating Induction for Solving Horn Clauses

Hiroshi Unno, Hiroki Sakamoto, Sho Torii, 2016, CAV.

Generation of the Hichart program diagrams

Youzou Miyadera, Takeo Yaku, Kensei Tsuchida, 1992 .

Refinement Type Inference via Horn Constraint Optimization pdf

Hiroshi Unno, Kodai Hashimoto, Hiroshi Unno, 2015, SAS.

Inferring Simple Solutions to Recursion-Free Horn Clauses via Sampling

Tachio Terauchi, Hiroshi Unno, Tachio Terauchi, 2015, TACAS.

A Fixpoint Logic and Dependent Effects for Temporal Property Verification

Eric Koskinen, Tachio Terauchi, Hiroshi Unno, 2018, LICS.

On-Demand Refinement of Dependent Types

Naoki Kobayashi, Hiroshi Unno, N. Kobayashi, 2008, FLOPS.

Tidy drawing of tree structured diagrams (abstract)

Tetsuro Nishino, Takeo Yaku, Koushi Anzai, 1992 .

Automating relatively complete verification of higher-order functional programs

Naoki Kobayashi, Tachio Terauchi, Hiroshi Unno, 2013, POPL.

Higher-order multi-parameter tree transducers and recursion schemes for program verification

Naoki Kobayashi, Hiroshi Unno, Naoshi Tabuchi, 2010, POPL '10.

Toward Neural-Network-Guided Program Synthesis and Verification

Naoki Kobayashi, Taro Sekiyama, Issei Sato, 2021, SAS.

Software model-checking as cyclic-proof search

Takeshi Tsukada, Hiroshi Unno, 2022, Proceedings of the ACM on Programming Languages.

Decision Tree Learning in CEGIS-Based Termination Analysis

Ichiro Hasuo, Satoshi Kura, Hiroshi Unno, 2021, CAV.

Enhancing Loop-Invariant Synthesis via Reinforcement Learning pdf

Taro Sekiyama, Kohei Suenaga, Takeshi Tsukada, 2021, ArXiv.

Constraint-based Relational Verification

Eric Koskinen, Tachio Terauchi, Hiroshi Unno, 2021, CAV.

Failure of cut-elimination in cyclic proofs of separation logic

Daisuke Kimura, Tachio Terauchi, Hiroshi Unno, 2020 .