Search

Your search keyword '"Minamide, Yasuhiko"' showing total 91 results
Start Over Author "Minamide, Yasuhiko"
91 results on '"Minamide, Yasuhiko"'

1. Formalization of Differential Privacy in Isabelle/HOL

Author

Sato, Tetsuya and Minamide, Yasuhiko

Subjects
Computer Science - Logic in Computer Science, Computer Science - Cryptography and Security, Computer Science - Programming Languages
Abstract

Differential privacy is a statistical definition of privacy that has attracted the interest of both academia and industry. Its formulations are easy to understand, but the differential privacy of databases is complicated to determine. One of the reasons for this is that small changes in database programs can break their differential privacy. Therefore, formal verification of differential privacy has been studied for over a decade. In this paper, we propose an Isabelle/HOL library for formalizing differential privacy in a general setting. To our knowledge, it is the first formalization of differential privacy that supports continuous probability distributions. First, we formalize the standard definition of differential privacy and its basic properties. Second, we formalize the Laplace mechanism and its differential privacy. Finally, we formalize the differential privacy of the report noisy max mechanism., Comment: Draft version

Published
2024

3. Program Logic for Higher-Order Probabilistic Programs in Isabelle/HOL

Author

Hirata, Michikazu, Minamide, Yasuhiko, Sato, Tetsuya, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Hanus, Michael, editor, and Igarashi, Atsushi, editor

Published
2022
Full Text
View/download PDF

4. Context-Free Grammars with Lookahead

Author

Miyazaki, Takayuki, Minamide, Yasuhiko, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Leporati, Alberto, editor, Martín-Vide, Carlos, editor, Shapira, Dana, editor, and Zandron, Claudio, editor

Published
2021
Full Text
View/download PDF

5. Weighted Pushdown Systems with Indexed Weight Domains

Author

Minamide, Yasuhiko

Subjects
Computer Science - Formal Languages and Automata Theory, Computer Science - Programming Languages
Abstract

The reachability analysis of weighted pushdown systems is a very powerful technique in verification and analysis of recursive programs. Each transition rule of a weighted pushdown system is associated with an element of a bounded semiring representing the weight of the rule. However, we have realized that the restriction of the boundedness is too strict and the formulation of weighted pushdown systems is not general enough for some applications. To generalize weighted pushdown systems, we first introduce the notion of stack signatures that summarize the effect of a computation of a pushdown system and formulate pushdown systems as automata over the monoid of stack signatures. We then generalize weighted pushdown systems by introducing semirings indexed by the monoid and weaken the boundedness to local boundedness.

Published
2016
Full Text
View/download PDF

8. Monoid-Based Approach to the Inclusion Problem on Superdeterministic Pushdown Automata

Author

Uezato, Yuya, Minamide, Yasuhiko, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Brlek, Srečko, editor, and Reutenauer, Christophe, editor

Published
2016
Full Text
View/download PDF

9. Synchronized Recursive Timed Automata

Author

Uezato, Yuya, Minamide, Yasuhiko, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Davis, Martin, editor, Fehnker, Ansgar, editor, McIver, Annabelle, editor, and Voronkov, Andrei, editor

Published
2015
Full Text
View/download PDF

10. Semantic Foundations of Higher-Order Probabilistic Programs in Isabelle/HOL

Author

Michikazu Hirata and Yasuhiko Minamide and Tetsuya Sato, Hirata, Michikazu, Minamide, Yasuhiko, Sato, Tetsuya, Michikazu Hirata and Yasuhiko Minamide and Tetsuya Sato, Hirata, Michikazu, Minamide, Yasuhiko, and Sato, Tetsuya

Abstract

Higher-order probabilistic programs are used to describe statistical models and machine-learning mechanisms. The programming languages for them are equipped with three features: higher-order functions, sampling, and conditioning. In this paper, we propose an Isabelle/HOL library for probabilistic programs supporting all of those three features. We extend our previous quasi-Borel theory library in Isabelle/HOL. As a basis of the theory, we formalize s-finite kernels, which is considered as a theoretical foundation of first-order probabilistic programs and a key to support conditioning of probabilistic programs. We also formalize the Borel isomorphism theorem which plays an important role in the quasi-Borel theory. Using them, we develop the s-finite measure monad on quasi-Borel spaces. Our extension enables us to describe higher-order probabilistic programs with conditioning directly as an Isabelle/HOL term whose type is that of morphisms between quasi-Borel spaces. We also implement the qbs prover for checking well-typedness of an Isabelle/HOL term as a morphism between quasi-Borel spaces. We demonstrate several verification examples of higher-order probabilistic programs with conditioning.

Published
2023
Full Text
View/download PDF

11. Weighted Pushdown Systems with Indexed Weight Domains

Author

Minamide, Yasuhiko, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Piterman, Nir, editor, and Smolka, Scott A., editor

Published
2013
Full Text
View/download PDF

13. Reachability Analysis of the HTML5 Parser Specification and Its Application to Compatibility Testing

Author

Minamide, Yasuhiko, Mori, Shunsuke, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Giannakopoulou, Dimitra, editor, and Méry, Dominique, editor

Published
2012
Full Text
View/download PDF

14. A Translation from the HTML DTD into a Regular Hedge Grammar

Author

Nishiyama, Takuya, Minamide, Yasuhiko, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Ibarra, Oscar H., editor, and Ravikumar, Bala, editor

Published
2008
Full Text
View/download PDF

15. Verified Decision Procedures on Context-Free Grammars

Author

Minamide, Yasuhiko, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Schneider, Klaus, editor, and Brandt, Jens, editor

Published
2007
Full Text
View/download PDF

16. Complexity Results on Balanced Context-Free Languages

Author

Tozawa, Akihiko, Minamide, Yasuhiko, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Rangan, C. Pandu, editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Seidl, Helmut, editor

Published
2007
Full Text
View/download PDF

17. XML Validation for Context-Free Grammars

Author

Minamide, Yasuhiko, Tozawa, Akihiko, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Kobayashi, Naoki, editor

Published
2006
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results