Zobrazeno 1 - 10
of 43
pro vyhledávání: '"partial model checking"'
In the process of designing a computer system S and checking whether an abstract model ℳ of S verifies a given specification property η, one might have only a partial knowledge of the model, either because ℳ has not yet been completely defined (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e3bc73fed69b1f27587f542a1d534ade
Publikováno v:
Future Generation Computer Systems. 80:519-536
The swift and continuous evolution of mobile devices is encouraging both private and public organizations to adopt the Bring Your Own Device (BYOD) paradigm. As a matter of fact, the BYOD paradigm drastically reduces costs and increases productivity
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0020dbbee14e5f2a1a7e82b9c47cbf2c
https://doi.org/10.1016/j.future.2016.06.014
https://doi.org/10.1016/j.future.2016.06.014
Publikováno v:
SAC
ACM Symposium on Applied Computing (SAC 2016), pp. 1–5, Pisa, Italy, 04-08/04/2016
info:cnr-pdr/source/autori:Bistarelli S., Santini F., Martinelli F., Matteucci I./congresso_nome:ACM Symposium on Applied Computing (SAC 2016)/congresso_luogo:Pisa, Italy/congresso_data:04-08%2F04%2F2016/anno:2016/pagina_da:1/pagina_a:5/intervallo_pagine:1–5
ACM Symposium on Applied Computing (SAC 2016), pp. 1–5, Pisa, Italy, 04-08/04/2016
info:cnr-pdr/source/autori:Bistarelli S., Santini F., Martinelli F., Matteucci I./congresso_nome:ACM Symposium on Applied Computing (SAC 2016)/congresso_luogo:Pisa, Italy/congresso_data:04-08%2F04%2F2016/anno:2016/pagina_da:1/pagina_a:5/intervallo_pagine:1–5
We propose a formal framework to model an automated adaptation protocol based on Quantitative Partial Model Checking (QPMC). An agent seeks the collaboration of a second agent to satisfy some (fixed) condition on the actions to be executed. The provi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2789f0b4aaca1f448f447e6822aa99be
https://doi.org/10.1145/2851613.2851955
https://doi.org/10.1145/2851613.2851955
Publikováno v:
LPAR
International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2017), Maun, Botswana, 07-12/05/2017
info:cnr-pdr/source/autori:S. Bistarelli (1), F. Santini (1), F. Martinelli (2), I. Matteucci (2)/congresso_nome:International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2017)/congresso_luogo:Maun, Botswana/congresso_data:07-12%2F05%2F2017/anno:2017/pagina_da:/pagina_a:/intervallo_pagine
International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2017), Maun, Botswana, 07-12/05/2017
info:cnr-pdr/source/autori:S. Bistarelli (1), F. Santini (1), F. Martinelli (2), I. Matteucci (2)/congresso_nome:International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2017)/congresso_luogo:Maun, Botswana/congresso_data:07-12%2F05%2F2017/anno:2017/pagina_da:/pagina_a:/intervallo_pagine
Partial Model-Checking (PMC) is an efficient tool to reduce the combinatorial explosion of a state-space, arising in the verification of loosely-coupled software systems. At the same time, it is useful to consider quantitative temporal-modalities. Th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b10cca0679b2b46a7d3980bfa7fccf7
https://doi.org/10.29007/rb2p
https://doi.org/10.29007/rb2p
Publikováno v:
International Journal of Information Security. 14:123-140
The emerging Bring Your Own Device (BYOD) paradigm is pushing the adoption of employees' personal mobile devices (e.g., smartphones and tablets) inside organizations for professional usage. However, allowing private, general purpose devices to intera
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a85061f4c2f57e3b56ca410e48eb35ea
https://doi.org/10.1007/s10207-014-0252-y
https://doi.org/10.1007/s10207-014-0252-y
Publikováno v:
Formal Aspects of Component Software ISBN: 9783319576657
FACS
BASE-Bielefeld Academic Search Engine
Formal Aspects of Component Software-13th International Conference, FACS 2016, Besançon, France, October 19-21, 2016, Revised Selected Papers
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Formal Aspects of Component Software
Formal Aspects of Component Software-The 13th International Conference, Besançon, France, 19/10/2016
info:cnr-pdr/source/autori:F. Martinelli(1), I. Matteucci(1), S. Bistarelli(2), F. Santini(2)/congresso_nome:Formal Aspects of Component Software-The 13th International Conference/congresso_luogo:Besançon, France/congresso_data:19%2F10%2F2016/anno:2016/pagina_da:/pagina_a:/intervallo_pagine
FACS
BASE-Bielefeld Academic Search Engine
Formal Aspects of Component Software-13th International Conference, FACS 2016, Besançon, France, October 19-21, 2016, Revised Selected Papers
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Formal Aspects of Component Software
Formal Aspects of Component Software-The 13th International Conference, Besançon, France, 19/10/2016
info:cnr-pdr/source/autori:F. Martinelli(1), I. Matteucci(1), S. Bistarelli(2), F. Santini(2)/congresso_nome:Formal Aspects of Component Software-The 13th International Conference/congresso_luogo:Besançon, France/congresso_data:19%2F10%2F2016/anno:2016/pagina_da:/pagina_a:/intervallo_pagine
We address the problem of automatically identifying what local properties the agents of a Cyber Physical System have to satisfy to guarantee a global required property \(\phi \). To enrich the picture, we consider properties where, besides qualitativ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa328643a53826bf74f65d676a42a77c
https://doi.org/10.1007/978-3-319-57666-4_9
https://doi.org/10.1007/978-3-319-57666-4_9
Autor:
Ilaria Matteucci
Publikováno v:
Electronic notes in theoretical computer science 186 (2007): 101–120. doi:10.1016/j.entcs.2007.03.025
info:cnr-pdr/source/autori:[1] Matteucci I./titolo:Automated Synthesis of Enforcing Mechanisms for Security Properties in a Timed Setting/doi:10.1016%2Fj.entcs.2007.03.025/rivista:Electronic notes in theoretical computer science/anno:2007/pagina_da:101/pagina_a:120/intervallo_pagine:101–120/volume:186
info:cnr-pdr/source/autori:[1] Matteucci I./titolo:Automated Synthesis of Enforcing Mechanisms for Security Properties in a Timed Setting/doi:10.1016%2Fj.entcs.2007.03.025/rivista:Electronic notes in theoretical computer science/anno:2007/pagina_da:101/pagina_a:120/intervallo_pagine:101–120/volume:186
In [Martinelli, F. and I. Matteucci, Modeling security automata with process algebras and related results (2006), presented at the 6th International Workshop on Issues in the Theory of Security (WITS '06) - Informal proceedings; Martinelli, F. and I.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::08b3a553a2a4ba8b2cf856a827378edb
https://doi.org/10.1016/j.entcs.2007.03.025
https://doi.org/10.1016/j.entcs.2007.03.025
Publikováno v:
Acta Informatica
Acta Informatica, Springer Verlag, 2015, 52 (4), pp.56. ⟨10.1007/s00236-015-0226-1⟩
Acta Informatica, 2015, 52 (4), pp.56. ⟨10.1007/s00236-015-0226-1⟩
Acta Informatica, Springer Verlag, 2015, 52 (4), pp.56. ⟨10.1007/s00236-015-0226-1⟩
Acta Informatica, 2015, 52 (4), pp.56. ⟨10.1007/s00236-015-0226-1⟩
International audience; During the last decades, concurrency theory successfully developed salient concepts to formally model and soundly reason about distributed and parallel systems. In practice, however, most attempts at analyzing large systems fa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::87caf61326f9cc77b90b04ff9cd97b24
https://hal.inria.fr/hal-01247507
https://hal.inria.fr/hal-01247507
Publikováno v:
[Research Report] RR-8708, INRIA Grenoble-Rhône-Alpes. 2015
During the last decades, concurrency theory successfully developed salient concepts to formally model and soundly reason about distributed and parallel systems. In practice, however, most attempts at analyzing large systems face severe complexity iss
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4b024fd3f6ee54d36002a13b8635db1a
https://hal.inria.fr/hal-01138749/document
https://hal.inria.fr/hal-01138749/document
Autor:
Fabio Martinelli
Publikováno v:
Theoretical Computer Science. 290:1057-1106
We propose a methodology for the formal analysis of security protocols. This originates from the observation that the verification of security protocols can be conveniently treated as the verification of open systems, i.e. systems which may have unsp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::71f226a400ef15946e8792d6c8db9ba8
https://doi.org/10.1016/s0304-3975(02)00596-0
https://doi.org/10.1016/s0304-3975(02)00596-0