Publications/Publications in Japanese

• Program Logic for Higher-Order Probabilistic Programs in Isabelle/HOL, Michikazu Hirata, Yasuhiko Minamide, Tetsuya Sato, Science of Computer Programming, vol. 230, 2023, journal version of FLOPS 2022. (DOI)
• Derivatives of Context-Free Grammars with Lookahead Takayuki Miyazaki, Yasuhiko Minamide, Journal of Information Processing, Vol. 31, pp.421-431, 2023.
• Semantic Foundations of Higher-Order Probabilistic Programs in Isabelle/HOL, Michikazu Hirata, Yasuhiko Minamide, Tetsuya Sato, In: Proceedings of the Fourteenth Conference on Interactive Theorem Proving (ITP 2023)., 2023. (LINK)
• Program Logic for Higher-Order Probabilistic Programs in Isabelle/HOL, Michikazu Hirata, Yasuhiko Minamide, Tetsuya Sato, In: Proceedings of the 16th International Symposium on Functional and Logic Programming (FLOPS 2022). p. 57-74, 2022.
• Context-Free Grammars with Lookahead, Miyazaki T., Minamide Y., In Language and Automata Theory and Applications(LATA), p. 213-225, LNCS 12638, 2021. (DOI)
• Solving String Constraints with Streaming String Transducers, Qizhen Zhu, Hitoshi Akama, Yasuhiko Minamide, Journal of Information Processing, Vol. 27, p. 810-821, 2019. (DOI)
• Derivatives of Regular Expressions with Lookahead, Takayuki Miyazaki, Yasuhiko Minamide, Journal of Information Processing, Vol. 27, p. 422-430, 2019. (DOI)
• Configuration Reachability Analysis of Synchronized Recursive Timed Automata, Yuya Uezato and Yasuhiko Minamide, Computer Software(コンピュータソフトウェア）, Vol. 35, No. 1, p. 140-168, 2018. (PDF)
• Monoid-based Approach to the Inclusion Problem on Superdeterministic Pushdown Automata, Yuya Uezato and Yasuhiko Minamide, DLT 2016: Developments in Language Theory, pp. 393-405, 2016. (springer)
• Weighted Pushdown Systems with Indexed Weight Domains, Yasuhiko Minamide, Logical Methods in Computer Science, Vol. 12(2:9), 2016, pp. 1–27 Selected papers of the conference ''Tools and Algorithms for the Construction and Analysis of Systems'': TACAS 2013. (arXiv)
• Synchronized Recursive Timed Automata, Yuya Uezato, Yasuhiko Minamide, In Proc. the 20th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LNCS 9452, pp. 249-265, 2015. (doi) (author's version)
• Checking Time Linearity of Regular Expression Matching Based on Backtrackingw, Satoshi Sugiyama, Yasuhiko Minamide, IPSJ Transactions on Programming, 7(3),1-11, 2014. (PDF) (draft version)
• Pushdown Systems with Stack Manipulation, Yuya Uezato and Yasuhiko Minamide, International Symposium on Automated Technology for Verification and Analysis(ATVA 2013), LNCS 8712, pp. 412-426, 2013. (doi) (author's version)
• Weighted Pushdown Systems with Indexed Weight Domains, Yasuhiko Minamide, In Proc. the 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, LNCS 7795, pp. 230-244, 2013. (doi) (author's version)
• Reachability Analysis of the HTML5 Parser Specification and Its Application to Compatibility Testing, Yasuhiko Minamide, Shunsuke Mori, In Proc. the 18th International Symposium on Formal Methods, LNCS 7436, pp. 293-307, 2012. (doi) (author's version)
• Translating Regular Expression Matching into Transducers, Yuto Sakuma, Yasuhiko Minamide, Andrei Voronkov, Journal of Applied Logic, 10, pp. 32-51, 2012. (Science Direct )
• Translating Regular Expression Matching into Transducers, Yasuhiko Minamide, Yuto Sakuma, Andrei Voronkov, In Proc. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2010), pp. 107-115, 2011.
• Copy-on-Write in the PHP Language, A. Tozawa, M. Tatsubori, T. Onodera, Y. Minamide, In Proc. POPL: The Symposium on Principles of Programming Languages, pp. 200-212, 2009.
• A Translation from the HTML DTD into a Regular Hedge Grammar, T. Nishiyama and Y. Minamide, In Proc. of the 13th International Conference on Implementation and Applications of Automata, LNCS 5148, pp. 122-131, 2008. (SpringerLink)
• Verified Decision Procedures on Context-Free Grammars, Y. Minamide, In Proc. of the 20th International Conference on Theorem Proving in Higher Order Logics, LNCS 4732, pp. 173-188, 2007. (author's version, SpringerLink)
• Complexity Results on Balanced Context-Free Languages, A. Tozawa, Y. Minamide, In Proc. of the Tenth International Conference on Foundations of Software Science and Computational Structures, LNCS 4423, pp. 346-360, 2007. (author's version, SpringerLink)
• XML Validation for Context-Free Grammars, Y. Minamide, A. Tozawa, In Proc. of The Fourth ASIAN Symposium on Programming Languages and Systems, LNCS 4279, pp. 357-373, 2006. (PDF, SpringerLink)
• Static Approximation of Dynamically Generated Web Pages, Y. Minamide, In Proc. of the 14th International World Wide Web Conference , pp. 432-441, 2005.
• Executing Verified Compiler Specification, K. Okuma and Y. Minamide, In Proc. of the First Asian Symposium on Programming Languages and Systems , pp.178-194, LNCS 2895, 2003.
• Verifying CPS Transformations in Isabelle/HOL, Y. Minamide and K. Okuma, In Proc. of the The Second Workshop on Mechanized Reasoning about Languages with Variable Binding , 2003.
• Selective Tail Call Elimination, Y. Minamide, In Proc. of 10th Annual International Static Analysis Symposium , pp.153-170, LNCS 2694, 2003.
• Runtime Behavior of Conversion Interpretation of Subtyping, Y. Minamide, In Proc. of 13th International Workshop on the Implementation of Functional Languages , pp.155-167, LNCS 2312, 2001.
• A New Criterion for Safe Program Transformations, Y. Minamide, In Proc. The Forth International Workshop on Higher Order Operational Techniques in Semantics (HOOTS) , ENTCS 1, 2000.
• Space-Profiling Semantics of the Call-by-Value Lambda Calculus and the CPS Transformation , Y. Minamide, In Proc. The Third International Workshop on Higher Order Operational Techniques in Semantics (HOOTS) , ENTCS 26, 1999.
• On the Runtime Complexity of Type-Directed Unboxing , Y. Minamide and J. Garrigue.
  In Proc. the third ACM SIGPLAN International Conference on Functional Programming (ICFP), pp.1-12, 1998.
• A Functional Represention of Data Structures with a Hole , Y. Minamide.
  In Proc. POPL '98: The 25rd Symposium on Principles of Programming Languages, pp.75-84, 1998.
• Typed Closure Conversion , Y. Minamide, G. Morrisett, and R. Harper.
  In Proc. POPL '96: The 23rd Symposium on Principles of Programming Languagesm, pp.271-283, 1996.
  Extended version published as CMU Technical Report CMU-CS-95-171 .
• Compilation Based on a Calculus for Explicit Type Passing , Y. Minamide.
  In Proc. Second Fuji International Workshop on Functional and Logic Programming , pp.301-320, 1996.
• Sharing analysis based on type inference, Y.Minamide,
  Formal Aspects of Computing, 6, pp. 659-675, 1994.

Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.