Mizuhito Ogawa

Orcid: 0000-0002-8050-7228

According to our database1, Mizuhito Ogawa authored at least 57 papers between 1988 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Automatic Stub Generation for Dynamic Symbolic Execution of ARM binary.
Proceedings of the 11th International Symposium on Information and Communication Technology, 2022

On the Determinization of Event-Clock Input-Driven Pushdown Automata.
Proceedings of the Computer Science - Theory and Applications, 2022

2019
Formal Semantics Extraction from MIPS Instruction Manual.
Proceedings of the Formal Techniques for Safety-Critical Systems, 2019

Formal Semantics Extraction from Natural Language Specifications for ARM.
Proceedings of the Formal Methods - The Next 30 Years - Third World Congress, 2019

On Classes of Regular Languages Related to Monotone WQOs.
Proceedings of the Descriptional Complexity of Formal Systems, 2019

2018
Wrapping Computer Algebra is Surprisingly Successful for Non-Linear SMT.
Proceedings of the 3rd Workshop on Satisfiability Checking and Symbolic Computation co-located with Federated Logic Conference, 2018

Comparison of Three Deep Learning-based Approaches for IoT Malware Detection.
Proceedings of the 10th International Conference on Knowledge and Systems Engineering, 2018

2017
raSAT: an SMT solver for polynomial constraints.
Formal Methods Syst. Des., 2017

A Sliding-Window Algorithm for On-The-Fly Interprocedural Program Analysis.
Proceedings of the Formal Methods and Software Engineering, 2017

Subtropical Satisfiability.
Proceedings of the Frontiers of Combining Systems - 11th International Symposium, 2017

2016
Termination and Boundedness for Well-Structured Pushdown Systems.
Proceedings of the 10th International Symposium on Theoretical Aspects of Software Engineering, 2016

2015
Low level code analysis and applications to computer security (NII Shonan Meeting 2015-4).
NII Shonan Meet. Rep., 2015

Obfuscation Code Localization Based on CFG Generation of Malware.
Proceedings of the Foundations and Practice of Security - 8th International Symposium, 2015

Nested Timed Automata with Frozen Clocks.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2015

Confluence of Layered Rewrite Systems.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent.
Proceedings of the Automated Deduction - CADE-25, 2015

2014
raSAT: SMT for Polynomial Inequality.
Proceedings of the 12th International Workshop on Satisfiability Modulo Theories, 2014

Well-Structured Pushdown System: Case of Dense Timed Pushdown Automata.
Proceedings of the Functional and Logic Programming - 12th International Symposium, 2014

2013
Nested Timed Automata.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2013

Well-Structured Pushdown Systems.
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

SAT and SMT: Their Algorithm Designs and Applications.
Proceedings of the 20th Asia-Pacific Software Engineering Conference, 2013

A Hybrid Approach for Control Flow Graph Construction from Binary Code.
Proceedings of the 20th Asia-Pacific Software Engineering Conference, 2013

2012
SMT for Polynomial Constraints on Real Numbers.
Proceedings of the Third Workshop on Tools for Automatic Program Analysis, 2012

2010
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent.
Inf. Process. Lett., 2010

Conditional weighted pushdown systems and applications.
Proceedings of the 2010 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, 2010

A Comparison of Four Association Engines in Divergent Thinking Support Systems on Wikipedia.
Proceedings of the Knowledge, Information, and Creativity Support Systems, 2010

Checking roundoff errors using counterexample-guided narrowing.
Proceedings of the ASE 2010, 2010

2009
An Ahead-of-time Yet Context-Sensitive Points-to Analysis for Java.
Proceedings of the Fourth Workshop on Bytecode Semantics, 2009

Event-Clock Visibly Pushdown Automata.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Overflow and Roundoff Error Analysis via Model Checking.
Proceedings of the Seventh IEEE International Conference on Software Engineering and Formal Methods, 2009

Stacking-Based Context-Sensitive Points-to Analysis for Java.
Proceedings of the Hardware and Software: Verification and Testing, 2009

2008
Authentication Revisited: Flaw or Not, the Recursive Authentication Protocol.
Proceedings of the Automated Technology for Verification and Analysis, 2008

Context-Sensitive Relevancy Analysis for Efficient Symbolic Execution.
Proceedings of the Programming Languages and Systems, 6th Asian Symposium, 2008

2007
On-the-Fly Model Checking of Fair Non-repudiation Protocols.
Proceedings of the Automated Technology for Verification and Analysis, 2007

2006
Modeling Urgency in Component-Based Real-Time Systems.
Proceedings of the Advances in Computer Science, 2006

2005
Maximum Marking Problems with Accumulative Weight Functions.
Proceedings of the Theoretical Aspects of Computing, 2005

Proving Properties of Incremental Merkle Trees.
Proceedings of the Automated Deduction, 2005

2004
Well-quasi-orders and regular omega-languages.
Theor. Comput. Sci., 2004

A Lightweight Mutual Authentication Based on Proxy Certificate Trust List.
Proceedings of the Parallel and Distributed Computing: Applications and Technologies, 2004

Complete Axiomatization of an Algebraic Construction of Graphs.
Proceedings of the Functional and Logic Programming, 7th International Symposium, 2004

2003
A linear time algorithm for monadic querying of indefinite data over linearly ordered domains.
Inf. Comput., 2003

Call-by-need reduction for membership conditional term rewriting Systems.
Proceedings of the 3rd International Workshop on Reduction Strategies in Rewriting and Programming, 2003

Iterative-free program analysis.
Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, 2003

2002
Algebraic construction of graphs with bounded tree width and its applications - Catamorphic Approach to Program Analyses.
Proceedings of the Third Asian Workshop on Programming Languages and Systems, 2002

2001
Unique normal form property of compatible term rewriting systems: a new proof of Chew's theorem.
Theor. Comput. Sci., 2001

Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems.
Inf. Comput., 2001

Generation of a Linear Time Query Processing Algorithm Based on Well-Quasi-Orders.
Proceedings of the Theoretical Aspects of Computer Software, 4th International Symposium, 2001

Uniform Normalisation beyond Orthogonality.
Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

Abstract Interpretation over Infinite Abstract Domains (Tentative Report).
Proceedings of the Second Asian Workshop on Programming Languages and Systems, 2001

2000
Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems.
Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP '00), 2000

A Note on Algebraic Structure of Tree Decomposition of Graphs.
Proceedings of the First Asian Workshop on Programming Languages and Systems, 2000

1999
Automatic Verification Based on Abstract Interpretation.
Proceedings of the Functional and Logic Programming, 4th Fuji International Symposium, 1999

1997
Perpetuality and Uniform Normalization.
Proceedings of the Algebraic and Logic Programming, 6th International Joint Conference, 1997

1996
Unique Normal Form Property of Higher-Order Rewriting Systems.
Proceedings of the Algebraic and Logic Programming, 5th International Conference, 1996

1992
Chew's Theorem Revisited -Uniquely Normalizing Property of Nonlinear Term Rewriting Systems-.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1990
Anomaly Detection of Functional Programs Based on Global Dataflow Analysis.
Syst. Comput. Jpn., 1990

1988
Transformation of Strictness-Related Analyses Nased on Abstract Interpretation.
Proceedings of the International Conference on Fifth Generation Computer Systems, 1988


  Loading...