Zobrazeno 1 - 10
of 102
pro vyhledávání: '"Vivek Nigam"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 14, Issue 1 (2018)
Pitts and Stark's $\nu$-calculus is a paradigmatic total language for studying the problem of contextual equivalence in higher-order languages with name generation. Models for the $\nu$-calculus that validate basic equivalences concerning names may b
Externí odkaz:
https://doaj.org/article/2bbc6deb315a437fbb7c36b5ce03e45e
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 197, Iss Proc. WoF 2015, Pp 1-6 (2015)
This paper tackles the problem of formulating and proving the completeness of focused-like proof systems in an automated fashion. Focusing is a discipline on proofs which structures them into phases in order to reduce proof search non-determinism. We
Externí odkaz:
https://doaj.org/article/8f933487be3f4ce7a50795b7fa64ef44
Autor:
Yuri Gil Dantas, Vivek Nigam
Publikováno v:
ACM Transactions on Cyber-Physical Systems. 7:1-28
During the design of safety-critical systems, safety and security engineers make use of architecture patterns, such as Watchdog and Firewall, to address identified failures and threats. Often, however, the deployment of safety architecture patterns h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bfc818eff8e208f917eb0d09d721b96a
https://doi.org/10.1145/3565269
https://doi.org/10.1145/3565269
Publikováno v:
Mathematical Structures in Computer Science. 32:1254-1282
Given the complexity of cyber-physical systems (CPS), such as swarms of drones, often deviations, from a planned mission or protocol, occur which may in some cases lead to harm and losses. To increase the robustness of such systems, it is necessary t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::96069b984a28da6709e837e91a0ecf77
https://doi.org/10.1017/s0960129522000251
https://doi.org/10.1017/s0960129522000251
Publikováno v:
Ciências exatas e da terra e engenharias: Conhecimento e informação 2 ISBN: 9786525811338
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b4b2221d0ffb97bfbf2f28be10f5632
https://doi.org/10.22533/at.ed.33823200413
https://doi.org/10.22533/at.ed.33823200413
Autor:
Yuri Gil Dantas, Tiziano Munaro, Carmen Carlan, Vivek Nigam, Simon Barner, Shiqing Fan, Alexander Pretschner, Ulrich Schöpp, Sergey Tverdyshev
Publikováno v:
SN Computer Science. 4
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb4316f27e013a73e97e1e0940ae169a
https://doi.org/10.1007/s42979-023-01712-5
https://doi.org/10.1007/s42979-023-01712-5
Publikováno v:
2023 IEEE 20th International Conference on Software Architecture Companion (ICSA-C).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d1e37bd5f1dd5248de4ce2b33a7839c0
https://doi.org/10.1109/icsa-c57050.2023.00070
https://doi.org/10.1109/icsa-c57050.2023.00070
Publikováno v:
Proceedings of the 9th International Conference on Information Systems Security and Privacy.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::75967ab527d7849de7b0c1300574066f
https://doi.org/10.5220/0011786400003405
https://doi.org/10.5220/0011786400003405
Autor:
Tajana Ban Kirigin, Abraão Aires Urquiza, Max I. Kanovich, Carolyn L. Talcott, Vivek Nigam, Andre Scedrov, Musab A. Alturki
Publikováno v:
Journal of Computer Security. 29:299-340
Protocol security verification is one of the best success stories of formal methods. However, some aspects important to protocol security, such as time and resources, are not covered by many formal models. While timing issues involve e.g., network de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::52f07cc1f226442f33ca61c21788bb07
https://doi.org/10.3233/jcs-200012
https://doi.org/10.3233/jcs-200012
Publikováno v:
ACM SIGAda Ada Letters. 39:29-34
We propose AdaHorn, a model checker for verification of Ada programs with respect to correctness properties given as assertions. AdaHorn translates an Ada program together with its assertion into a set of Constrained Horn Clauses, and feeds it to a H
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::06f71c52c164987bafd9c07ba79bbf00
https://doi.org/10.1145/3394514.3394517
https://doi.org/10.1145/3394514.3394517