- home
- Advanced Search
Filters
Clear All- EDIH Adria
- 2017-2021
- Doctoral thesis
- Hal-Diderot
- EDIH Adria
- 2017-2021
- Doctoral thesis
- Hal-Diderot
Loading
description Publicationkeyboard_double_arrow_right Preprint , Part of book or chapter of book , Article , Conference object , Doctoral thesis 2020 FrancePublisher:Springer International Publishing Authors: Minami, Kiraku;Minami, Kiraku;Part 1: Full Papers; International audience; In process algebra, we can express security properties using an equivalence on processes. However, it is not clear which equivalence is the most suitable for the purpose. Indeed, several definitions of some properties are proposed. For example, the definition of privacy is not unique. This situation means that we are not certain how to express an intuitive security notion. Namely, there is a gap between an intuitive security notion and the formulation. Proper formalization is essential for verification, and our purpose is to bridge this gap.In the case of the applied pi calculus, an outputted message is not explicitly expressed. This feature suggests that trace equivalence appropriately expresses indistinguishability for attackers in the applied pi calculus. By chasing interchanging bound names and scope extrusions, we prove that trace equivalence is a congruence. Therefore, a security property expressed using trace equivalence is preserved by application of contexts.Moreover, we construct an epistemic logic for the applied pi calculus. We show that its logical equivalence agrees with trace equivalence. It means that trace equivalence is suitable in the presence of a non-adaptive attacker. Besides, we define several security properties to use our epistemic logic.
Europe PubMed Centra... arrow_drop_down Europe PubMed CentralArticle . 2020Full-Text: http://europepmc.org/articles/PMC7281862Data sources: PubMed Centralhttps://doi.org/10.1007/978-3-...Part of book or chapter of book . 2020 . Peer-reviewedLicense: Springer TDMData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationConference object . 2020License: CC BYHal-DiderotConference object . 2020License: CC BYFull-Text: https://hal.inria.fr/hal-03283228/documentData sources: Hal-Diderothttps://doi.org/10.48550/arxiv...Article . 2019License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-50086-3_7&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen bronze 1 citations 1 popularity Average influence Average impulse Average Powered by BIP!more_vert Europe PubMed Centra... arrow_drop_down Europe PubMed CentralArticle . 2020Full-Text: http://europepmc.org/articles/PMC7281862Data sources: PubMed Centralhttps://doi.org/10.1007/978-3-...Part of book or chapter of book . 2020 . Peer-reviewedLicense: Springer TDMData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationConference object . 2020License: CC BYHal-DiderotConference object . 2020License: CC BYFull-Text: https://hal.inria.fr/hal-03283228/documentData sources: Hal-Diderothttps://doi.org/10.48550/arxiv...Article . 2019License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-50086-3_7&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Doctoral thesis , Thesis 2021 France, Austria EnglishPublisher:IST Austria Funded by:FWF | Modern Graph Algorithmic ..., EC | QUAREM, EC | GRAPH GAMES +1 projectsFWF| Modern Graph Algorithmic Techniques in Formal Verification ,EC| QUAREM ,EC| GRAPH GAMES ,UKRI| Matroids in Applied and Computational AlgebraAuthors: Goharshady, Amir;Goharshady, Amir;In this thesis, we consider several of the most classical and fundamental problems in static analysis and formal verification, including invariant generation, reachability analysis, termination analysis of probabilistic programs, data-flow analysis, quantitative analysis of Markov chains and Markov decision processes, and the problem of data packing in cache management.We use techniques from parameterized complexity theory, polyhedral geometry, and real algebraic geometry to significantly improve the state-of-the-art, in terms of both scalability and completeness guarantees, for the mentioned problems. In some cases, our results are the first theoretical improvements for the respective problems in two or three decades.; Dans cette thèse, nous considérons plusieurs des problèmes les plus classiques et fondamentaux de l'analyse statique et de la vérification formelle, y compris la génération d'invariants, l'analyse d'accessibilité, l'analyse de terminaison de programmes probabilistes et l'analyse quantitative des chaînes de Markov et des processus de décision de Markov.Nous utilisons des techniques issues de la théorie de la complexité paramétrée, de la géométrie polyédrique et de la géométrie algébrique réelle. Dans certains cas, nos résultats sont les premières améliorations théoriques des problèmes respectifs en deux ou trois décennies.
Hal-Diderot arrow_drop_down Mémoires en Sciences de l'Information et de la CommunicationDoctoral thesis . 2020Full-Text: https://hal.science/tel-03153209v2/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.15479/at:ista:8934&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert Hal-Diderot arrow_drop_down Mémoires en Sciences de l'Information et de la CommunicationDoctoral thesis . 2020Full-Text: https://hal.science/tel-03153209v2/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.15479/at:ista:8934&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu
Loading
description Publicationkeyboard_double_arrow_right Preprint , Part of book or chapter of book , Article , Conference object , Doctoral thesis 2020 FrancePublisher:Springer International Publishing Authors: Minami, Kiraku;Minami, Kiraku;Part 1: Full Papers; International audience; In process algebra, we can express security properties using an equivalence on processes. However, it is not clear which equivalence is the most suitable for the purpose. Indeed, several definitions of some properties are proposed. For example, the definition of privacy is not unique. This situation means that we are not certain how to express an intuitive security notion. Namely, there is a gap between an intuitive security notion and the formulation. Proper formalization is essential for verification, and our purpose is to bridge this gap.In the case of the applied pi calculus, an outputted message is not explicitly expressed. This feature suggests that trace equivalence appropriately expresses indistinguishability for attackers in the applied pi calculus. By chasing interchanging bound names and scope extrusions, we prove that trace equivalence is a congruence. Therefore, a security property expressed using trace equivalence is preserved by application of contexts.Moreover, we construct an epistemic logic for the applied pi calculus. We show that its logical equivalence agrees with trace equivalence. It means that trace equivalence is suitable in the presence of a non-adaptive attacker. Besides, we define several security properties to use our epistemic logic.
Europe PubMed Centra... arrow_drop_down Europe PubMed CentralArticle . 2020Full-Text: http://europepmc.org/articles/PMC7281862Data sources: PubMed Centralhttps://doi.org/10.1007/978-3-...Part of book or chapter of book . 2020 . Peer-reviewedLicense: Springer TDMData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationConference object . 2020License: CC BYHal-DiderotConference object . 2020License: CC BYFull-Text: https://hal.inria.fr/hal-03283228/documentData sources: Hal-Diderothttps://doi.org/10.48550/arxiv...Article . 2019License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-50086-3_7&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen bronze 1 citations 1 popularity Average influence Average impulse Average Powered by BIP!more_vert Europe PubMed Centra... arrow_drop_down Europe PubMed CentralArticle . 2020Full-Text: http://europepmc.org/articles/PMC7281862Data sources: PubMed Centralhttps://doi.org/10.1007/978-3-...Part of book or chapter of book . 2020 . Peer-reviewedLicense: Springer TDMData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationConference object . 2020License: CC BYHal-DiderotConference object . 2020License: CC BYFull-Text: https://hal.inria.fr/hal-03283228/documentData sources: Hal-Diderothttps://doi.org/10.48550/arxiv...Article . 2019License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1007/978-3-030-50086-3_7&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Doctoral thesis , Thesis 2021 France, Austria EnglishPublisher:IST Austria Funded by:FWF | Modern Graph Algorithmic ..., EC | QUAREM, EC | GRAPH GAMES +1 projectsFWF| Modern Graph Algorithmic Techniques in Formal Verification ,EC| QUAREM ,EC| GRAPH GAMES ,UKRI| Matroids in Applied and Computational AlgebraAuthors: Goharshady, Amir;Goharshady, Amir;In this thesis, we consider several of the most classical and fundamental problems in static analysis and formal verification, including invariant generation, reachability analysis, termination analysis of probabilistic programs, data-flow analysis, quantitative analysis of Markov chains and Markov decision processes, and the problem of data packing in cache management.We use techniques from parameterized complexity theory, polyhedral geometry, and real algebraic geometry to significantly improve the state-of-the-art, in terms of both scalability and completeness guarantees, for the mentioned problems. In some cases, our results are the first theoretical improvements for the respective problems in two or three decades.; Dans cette thèse, nous considérons plusieurs des problèmes les plus classiques et fondamentaux de l'analyse statique et de la vérification formelle, y compris la génération d'invariants, l'analyse d'accessibilité, l'analyse de terminaison de programmes probabilistes et l'analyse quantitative des chaînes de Markov et des processus de décision de Markov.Nous utilisons des techniques issues de la théorie de la complexité paramétrée, de la géométrie polyédrique et de la géométrie algébrique réelle. Dans certains cas, nos résultats sont les premières améliorations théoriques des problèmes respectifs en deux ou trois décennies.
Hal-Diderot arrow_drop_down Mémoires en Sciences de l'Information et de la CommunicationDoctoral thesis . 2020Full-Text: https://hal.science/tel-03153209v2/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.15479/at:ista:8934&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert Hal-Diderot arrow_drop_down Mémoires en Sciences de l'Information et de la CommunicationDoctoral thesis . 2020Full-Text: https://hal.science/tel-03153209v2/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.15479/at:ista:8934&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu