Zobrazeno 1 - 10
of 73
pro vyhledávání: '"Max I. Kanovich"'
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:
Journal of Logic, Language and Information. 30:31-88
We give a proof-theoretic and algorithmic complexity analysis for systems introduced by Morrill to serve as the core of the CatLog categorial grammar parser. We consider two recent versions of Morrill’s calculi, and focus on their fragments includi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::43f94d48fea83ef07db2eeae3f2d4cba
https://doi.org/10.1007/s10849-020-09320-9
https://doi.org/10.1007/s10849-020-09320-9
Publikováno v:
Journal of Logic and Computation. 30:239-256
The Lambek calculus can be considered as a version of non-commutative intuitionistic linear logic. One of the interesting features of the Lambek calculus is the so-called ‘Lambek’s restriction’, i.e. the antecedent of any provable sequent shoul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f9441250fcc626cf822c7f99e75e9b60
https://doi.org/10.1093/logcom/exaa010
https://doi.org/10.1093/logcom/exaa010
Publikováno v:
Studies in Computational Intelligence ISBN: 9783030901370
Studies in Computational Intelligence
Studies in Computational Intelligence
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef986af83b745049eb9a77ed79d38609
https://doi.org/10.1007/978-3-030-90138-7_1
https://doi.org/10.1007/978-3-030-90138-7_1
Autor:
Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Musab A. Alturki, Carolyn L. Talcott
Publikováno v:
ICISSP
Development of automated technological systems has seen the increase in interconnectivity among its components. This includes Internet of Things (IoT) and Industry 4.0 (I4.0) and the underlying communication between sensors and controllers. This pape
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ad82a839c3a9e9ce820287c1daae47e3
https://doi.org/10.5220/0010195100430054
https://doi.org/10.5220/0010195100430054
Publikováno v:
Protocols, Strands, and Logic ISBN: 9783030916305
Protocols, Strands, and Logic
Protocols, Strands, and Logic
This paper develops a Multiset Rewriting language with explicit time for the specification and analysis of Time-Sensitive Distributed Systems (TSDS). Goals are often specified using explicit time constraints. A good trace is an infinite trace in whic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6a68837398ec448551fed6b28e901b24
https://doi.org/10.1007/978-3-030-91631-2_14
https://doi.org/10.1007/978-3-030-91631-2_14
Publikováno v:
Automated Reasoning ISBN: 9783030510732
IJCAR (1)
IJCAR (1)
Linear logic and its refinements have been used as a specification language for a number of deductive systems. This has been accomplished by carefully studying the structural restrictions of linear logic modalities. Examples of such refinements are s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::774ed5cdf383c06c59a55ebc9fe619e6
https://doi.org/10.1007/978-3-030-51074-9_29
https://doi.org/10.1007/978-3-030-51074-9_29
Publikováno v:
Journal of Computer Security. 25:585-630
Many security protocols rely on the assumptions on the physical properties in which its protocol sessions will be carried out. For instance, Distance Bounding Protocols take into account the round trip time of messages and the transmission velocity t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::403cde4259e07ab41754e0f9d1bcdfc1
https://doi.org/10.3233/jcs-0560
https://doi.org/10.3233/jcs-0560
Autor:
Carolyn L. Talcott, Max I. Kanovich, Abraão Aires Urquiza, Vivek Nigam, Andre Scedrov, Musab A. Alturki, Tajana Ban Kirigin
Publikováno v:
CSF
Denial of Service (DoS) attacks have been a serious security concern, as no service is, in principle, protected against them. Although a Dolev-Yao intruder with unlimited resources can trivially render any service unavailable, DoS attacks do not nece
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8f0d2fe4a90ee17b6c9efd5a54cebc0
https://doi.org/10.1109/csf.2019.00033
https://doi.org/10.1109/csf.2019.00033
Publikováno v:
Logic, Language, Information, and Computation ISBN: 9783662595329
WoLLIC
WoLLIC
The Lambek calculus was introduced as a mathematical description of natural languages. The original Lambek calculus is NP-complete (Pentus), while its product-free fragment with only one implication is polynomially decidable (Savateev). We consider L
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a37efa7db983c6bbdbb9bb53e6a38ee2
https://doi.org/10.1007/978-3-662-59533-6_22
https://doi.org/10.1007/978-3-662-59533-6_22