Výsledky vyhledávání - "Andre Scedrov"

This Festschrift was published in honor of Andre Scedrov on the occasion of his 65th birthday. The 11 technical papers and 3 short papers included in this volume show the many transformative discoveries made by Andre Scedrov in the areas of linear lo

Zobrazit plný text záznamu

Resource and timing aspects of security protocols

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

Zobrazit plný text záznamu

Plný text ve formátu HTML

The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities

Autor: Andre Scedrov, Max I. Kanovich, Stepan L. Kuznetsov

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

Zobrazit plný text záznamu

Reconciling Lambek’s restriction, cut-elimination and substitution in the presence of exponential modalities

Autor: Stepan L. Kuznetsov, Andre Scedrov, Max I. Kanovich

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

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání