default search action
Mizuhito Ogawa
Person information
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c51]Thanh-Hung Pham, Mizuhito Ogawa:
Original Entry Point Detection Based on Graph Similarity. FPS (1) 2023: 355-371 - 2022
- [c50]Mizuhito Ogawa, Alexander Okhotin:
On the Determinization of Event-Clock Input-Driven Pushdown Automata. CSR 2022: 256-268 - [c49]Anh T. V. Nguyen, Mizuhito Ogawa:
Automatic Stub Generation for Dynamic Symbolic Execution of ARM binary. SoICT 2022: 352-359 - 2021
- [i4]Mizuhito Ogawa, Alexander Okhotin:
On the determinization of event-clock input-driven pushdown automata. CoRR abs/2103.04079 (2021)
2010 – 2019
- 2019
- [c48]Mizuhito Ogawa, Victor L. Selivanov:
On Classes of Regular Languages Related to Monotone WQOs. DCFS 2019: 235-247 - [c47]Anh V. Vu, Mizuhito Ogawa:
Formal Semantics Extraction from Natural Language Specifications for ARM. FM 2019: 465-483 - [c46]Quang Thinh Trac, Mizuhito Ogawa:
Formal Semantics Extraction from MIPS Instruction Manual. FTSCS 2019: 133-140 - 2018
- [c45]Khanh Duy Tung Nguyen, Tran Minh Tuan, Son Hai Le, Viet-Anh Phan, Mizuhito Ogawa, Le Minh Nguyen:
Comparison of Three Deep Learning-based Approaches for IoT Malware Detection. KSE 2018: 382-388 - [c44]Pascal Fontaine, Mizuhito Ogawa, Thomas Sturm, To Van Khanh, Xuan-Tung Vu:
Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT. SC-Square@FLOC 2018: 110 - 2017
- [j11]Vu Xuan Tung, To Van Khanh, Mizuhito Ogawa:
raSAT: an SMT solver for polynomial constraints. Formal Methods Syst. Des. 51(3): 462-499 (2017) - [c43]Pascal Fontaine, Mizuhito Ogawa, Thomas Sturm, Xuan-Tung Vu:
Subtropical Satisfiability. FroCoS 2017: 189-206 - [c42]Xin Li, Mizuhito Ogawa:
A Sliding-Window Algorithm for On-The-Fly Interprocedural Program Analysis. ICFEM 2017: 281-297 - [i3]Pascal Fontaine, Mizuhito Ogawa, Thomas Sturm, Xuan-Tung Vu:
Subtropical Satisfiability. CoRR abs/1706.09236 (2017) - 2016
- [c41]Vu Xuan Tung, To Van Khanh, Mizuhito Ogawa:
raSAT: An SMT Solver for Polynomial Constraints. IJCAR 2016: 228-237 - [c40]Suhua Lei, Xiaojuan Cai, Mizuhito Ogawa:
Termination and Boundedness for Well-Structured Pushdown Systems. TASE 2016: 22-29 - 2015
- [c39]Masahiko Sakai, Michio Oyamaguchi, Mizuhito Ogawa:
Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent. CADE 2015: 111-126 - [c38]Jiaxiang Liu, Jean-Pierre Jouannaud, Mizuhito Ogawa:
Confluence of Layered Rewrite Systems. CSL 2015: 423-440 - [c37]Guoqiang Li, Mizuhito Ogawa, Shoji Yuen:
Nested Timed Automata with Frozen Clocks. FORMATS 2015: 189-205 - [c36]Minh Hai Nguyen, Mizuhito Ogawa, Quan Thanh Tho:
Obfuscation Code Localization Based on CFG Generation of Malware. FPS 2015: 229-247 - [i2]Jean-Pierre Jouannaud, Jiaxiang Liu, Mizuhito Ogawa:
Confluence of Layered Rewrite Systems. CoRR abs/1509.04699 (2015) - [i1]Jean-Yves Marion, Akira Mori, Mizuhito Ogawa:
Low level code analysis and applications to computer security (NII Shonan Meeting 2015-4). NII Shonan Meet. Rep. 2015 (2015) - 2014
- [c35]Xiaojuan Cai, Mizuhito Ogawa:
Well-Structured Pushdown System: Case of Dense Timed Pushdown Automata. FLOPS 2014: 336-352 - [c34]To Van Khanh, Xuan-Tung Vu, Mizuhito Ogawa:
raSAT: SMT for Polynomial Inequality. SMT 2014: 67 - 2013
- [c33]Mizuhito Ogawa, To Van Khanh:
SAT and SMT: Their Algorithm Designs and Applications. APSEC (2) 2013: 83-84 - [c32]Minh Hai Nguyen, Thien Binh Nguyen, Thanh Tho Quan, Mizuhito Ogawa:
A Hybrid Approach for Control Flow Graph Construction from Binary Code. APSEC (2) 2013: 159-164 - [c31]Xiaojuan Cai, Mizuhito Ogawa:
Well-Structured Pushdown Systems. CONCUR 2013: 121-136 - [c30]Guoqiang Li, Xiaojuan Cai, Mizuhito Ogawa, Shoji Yuen:
Nested Timed Automata. FORMATS 2013: 168-182 - [e1]Dang Van Hung, Mizuhito Ogawa:
Automated Technology for Verification and Analysis - 11th International Symposium, ATVA 2013, Hanoi, Vietnam, October 15-18, 2013. Proceedings. Lecture Notes in Computer Science 8172, Springer 2013, ISBN 978-3-319-02443-1 [contents] - 2012
- [c29]To Van Khanh, Mizuhito Ogawa:
SMT for Polynomial Constraints on Real Numbers. TAPAS@SAS 2012: 27-40 - 2011
- [j10]Kobkrit Viriyayudhakorn, Mizuhito Ogawa:
Associative Search on Shogi Game Records. Inf. Media Technol. 6(3): 833-845 (2011) - 2010
- [j9]Masahiko Sakai, Mizuhito Ogawa:
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent. Inf. Process. Lett. 110(18-19): 810-814 (2010) - [c28]Do Thi Bich Ngoc, Mizuhito Ogawa:
Checking roundoff errors using counterexample-guided narrowing. ASE 2010: 301-304 - [c27]Kobkrit Viriyayudhakorn, Susumu Kunifuji, Mizuhito Ogawa:
A Comparison of Four Association Engines in Divergent Thinking Support Systems on Wikipedia. KICSS 2010: 226-237 - [c26]Xin Li, Mizuhito Ogawa:
Conditional weighted pushdown systems and applications. PEPM 2010: 141-150
2000 – 2009
- 2009
- [c25]Xin Li, Mizuhito Ogawa:
Stacking-Based Context-Sensitive Points-to Analysis for Java. Haifa Verification Conference 2009: 133-149 - [c24]Do Thi Bich Ngoc, Mizuhito Ogawa:
Overflow and Roundoff Error Analysis via Model Checking. SEFM 2009: 105-114 - [c23]Nguyen Van Tang, Mizuhito Ogawa:
Event-Clock Visibly Pushdown Automata. SOFSEM 2009: 558-569 - [c22]Xin Li, Mizuhito Ogawa:
An Ahead-of-time Yet Context-Sensitive Points-to Analysis for Java. BYTECODE@ETAPS 2009: 31-46 - 2008
- [j8]Nguyen Van Tang, Mizuhito Ogawa:
Alternate Stacking Technique Revisited: Inclusion Problem of Superdeterministic Pushdown Automata. Inf. Media Technol. 3(4): 744-754 (2008) - [c21]Xin Li, Daryl Shannon, Indradeep Ghosh, Mizuhito Ogawa, Sreeranga P. Rajan, Sarfraz Khurshid:
Context-Sensitive Relevancy Analysis for Efficient Symbolic Execution. APLAS 2008: 36-52 - [c20]Guoqiang Li, Mizuhito Ogawa:
Authentication Revisited: Flaw or Not, the Recursive Authentication Protocol. ATVA 2008: 374-385 - 2007
- [j7]Guoqiang Li, Mizuhito Ogawa:
On-the-fly Model Checking of Security Protocols and Its Implementation by Maude. Inf. Media Technol. 2(3): 937-962 (2007) - [c19]Guoqiang Li, Mizuhito Ogawa:
On-the-Fly Model Checking of Fair Non-repudiation Protocols. ATVA 2007: 511-522 - 2006
- [j6]Xin Li, Mizuhito Ogawa:
Proxy Certificate Trust List for Grid Computing. Inf. Media Technol. 1(1): 589-593 (2006) - [c18]Nguyen Van Tang, Dang Van Hung, Mizuhito Ogawa:
Modeling Urgency in Component-Based Real-Time Systems. ASIAN 2006: 248-255 - 2005
- [c17]Mizuhito Ogawa, Eiichi Horita, Satoshi Ono:
Proving Properties of Incremental Merkle Trees. CADE 2005: 424-440 - [c16]Isao Sasano, Mizuhito Ogawa, Zhenjiang Hu:
Maximum Marking Problems with Accumulative Weight Functions. ICTAC 2005: 562-578 - 2004
- [j5]Mizuhito Ogawa:
Well-quasi-orders and regular omega-languages. Theor. Comput. Sci. 324(1): 55-60 (2004) - [c15]Mizuhito Ogawa:
Complete Axiomatization of an Algebraic Construction of Graphs. FLOPS 2004: 163-179 - [c14]Xin Li, Mizuhito Ogawa:
A Lightweight Mutual Authentication Based on Proxy Certificate Trust List. PDCAT 2004: 628-632 - 2003
- [j4]Mizuhito Ogawa:
A linear time algorithm for monadic querying of indefinite data over linearly ordered domains. Inf. Comput. 186(2): 236-259 (2003) - [c13]Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano:
Iterative-free program analysis. ICFP 2003: 111-123 - [c12]Mizuhito Ogawa:
Call-by-need reduction for membership conditional term rewriting Systems. WRS 2003: 673-688 - 2002
- [c11]Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano, Masato Takeichi:
Algebraic construction of graphs with bounded tree width and its applications - Catamorphic Approach to Program Analyses. APLAS 2002: 58-73 - 2001
- [j3]Zurab Khasidashvili, Mizuhito Ogawa, Vincent van Oostrom:
Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems. Inf. Comput. 164(1): 118-151 (2001) - [j2]Ken Mano, Mizuhito Ogawa:
Unique normal form property of compatible term rewriting systems: a new proof of Chew's theorem. Theor. Comput. Sci. 258(1-2): 169-208 (2001) - [c10]Mizuhito Ogawa:
Abstract Interpretation over Infinite Abstract Domains (Tentative Report). APLAS 2001: 183-191 - [c9]Zurab Khasidashvili, Mizuhito Ogawa, Vincent van Oostrom:
Uniform Normalisation beyond Orthogonality. RTA 2001: 122-136 - [c8]Mizuhito Ogawa:
Generation of a Linear Time Query Processing Algorithm Based on Well-Quasi-Orders. TACS 2001: 283-297 - 2000
- [c7]Mizuhito Ogawa:
A Note on Algebraic Structure of Tree Decomposition of Graphs. APLAS 2000: 223-229 - [c6]Isao Sasano, Zhenjiang Hu, Masato Takeichi, Mizuhito Ogawa:
Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems. ICFP 2000: 137-149
1990 – 1999
- 1999
- [c5]Mizuhito Ogawa:
Automatic Verification Based on Abstract Interpretation. Fuji International Symposium on Functional and Logic Programming 1999: 131-146 - 1997
- [c4]Zurab Khasidashvili, Mizuhito Ogawa:
Perpetuality and Uniform Normalization. ALP/HOA 1997: 240-255 - 1996
- [c3]Ken Mano, Mizuhito Ogawa:
Unique Normal Form Property of Higher-Order Rewriting Systems. ALP 1996: 269-283 - 1992
- [c2]Mizuhito Ogawa:
Chew's Theorem Revisited -Uniquely Normalizing Property of Nonlinear Term Rewriting Systems-. ISAAC 1992: 309-318 - 1990
- [j1]Mizuhito Ogawa, Satoshi Ono:
Anomaly Detection of Functional Programs Based on Global Dataflow Analysis. Syst. Comput. Jpn. 21(2): 11-22 (1990)
1980 – 1989
- 1988
- [c1]Mizuhito Ogawa, Satoshi Ono:
Transformation of Strictness-Related Analyses Nased on Abstract Interpretation. FGCS 1988: 430-438
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-12 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint