default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMax I. Kanovich
Person information
- affiliation: University College London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2022
[j28]Max I. Kanovich, Stepan L. Kuznetsov
, Andre Scedrov:
Language models for some extensions of the Lambek calculus. Inf. Comput. 287: 104760 (2022)- [j27]Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
On the Security and Complexity of Periodic Systems. SN Comput. Sci. 3(5): 356 (2022) - 2021
- [j26]Abraão Aires Urquiza, Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Resource and timing aspects of security protocols. J. Comput. Secur. 29(3): 299-340 (2021) - [j25]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities. J. Log. Lang. Inf. 30(1): 31-88 (2021) - [j24]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
Correction to: The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities. J. Log. Lang. Inf. 30(1): 89 (2021) - 2020
- [j23]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
Reconciling Lambek's restriction, cut-elimination and substitution in the presence of exponential modalities. J. Log. Comput. 30(1): 239-256 (2020) - 2019
- [j22]Max I. Kanovich, Stepan L. Kuznetsov, Vivek Nigam, Andre Scedrov:
Subexponentials in non-commutative linear logic. Math. Struct. Comput. Sci. 29(8): 1217-1249 (2019) - 2017
- [j21]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Time, computational complexity, and probability in the analysis of distance-bounding protocols. J. Comput. Secur. 25(6): 585-630 (2017) - [j20]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott, Ranko Perovic:
A rewriting framework and logic for activities subject to regulations. Math. Struct. Comput. Sci. 27(3): 332-375 (2017) - 2016
- [j19]Max I. Kanovich:
The undecidability theorem for the Horn-like fragment of linear logic (Revisited). Math. Struct. Comput. Sci. 26(5): 719-744 (2016) - 2014
- [j18]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov:
Bounded memory protocols. Comput. Lang. Syst. Struct. 40(3-4): 137-154 (2014) - [j17]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov:
Bounded memory Dolev-Yao adversaries in collaborative systems. Inf. Comput. 238: 233-261 (2014) - [j16]James Brotherston, Max I. Kanovich:
Undecidability of Propositional Separation Logic and Its Neighbours. J. ACM 61(2): 14:1-14:43 (2014) - [j15]Max I. Kanovich:
Multiset rewriting over Fibonacci and Tribonacci numbers. J. Comput. Syst. Sci. 80(6): 1138-1151 (2014) - 2012
- [j14]Max I. Kanovich:
Light linear logics with controlled weakening: Expressibility, confluent strong normalization. Ann. Pure Appl. Log. 163(7): 854-874 (2012) - 2011
- [j13]Max I. Kanovich, Paul D. Rowe, Andre Scedrov:
Collaborative Planning with Confidentiality. J. Autom. Reason. 46(3-4): 389-421 (2011) - [j12]Max I. Kanovich, Jacqueline Vauzeilles:
Linear logic as a tool for planning under temporal uncertainty. Theor. Comput. Sci. 412(20): 2072-2092 (2011) - 2007
- [j11]Max I. Kanovich:
The two-way rewriting in action: Removing the mystery of Euler-Glaisher's map. Discret. Math. 307(15): 1909-1935 (2007) - [j10]Max I. Kanovich, Jacqueline Vauzeilles:
Strong planning under uncertainty in domains with numerous but identical elements (a generic approach). Theor. Comput. Sci. 379(1-2): 84-119 (2007) - 2006
- [j9]Max I. Kanovich, Mitsuhiro Okada, Kazushige Terui:
Intuitionistic phase semantics is almost classical. Math. Struct. Comput. Sci. 16(1): 67-86 (2006) - 2004
- [j8]Max I. Kanovich:
Finding direct partition bijections by two-directional rewriting techniques. Discret. Math. 285(1-3): 151-166 (2004) - 2003
- [j7]Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov:
Phase semantics for light linear logic. Theor. Comput. Sci. 294(3): 525-549 (2003) - 2001
- [j6]Max I. Kanovich, Jacqueline Vauzeilles:
The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity. Math. Struct. Comput. Sci. 11(6): 689-716 (2001) - 1996
- [j5]Max I. Kanovich:
Linear Logic Automata. Ann. Pure Appl. Log. 78(1-3): 147-188 (1996) - 1995
- [j4]Max I. Kanovich:
Petri Nets, Horn Programs, Linear Logic and Vector Games. Ann. Pure Appl. Log. 75(1-2): 107-135 (1995) - 1994
- [j3]Max I. Kanovich:
Linear Logic as a Logic of Computations. Ann. Pure Appl. Log. 67(1-3): 183-212 (1994) - [j2]Max I. Kanovich:
The Complexity of Horn Fragments of Linear Logic. Ann. Pure Appl. Log. 69(2-3): 195-241 (1994) - 1990
- [j1]Max I. Kanovich:
Efficient Program Synthesis in Computational Models. J. Log. Program. 9(2&3): 159-177 (1990)
Conference and Workshop Papers
- 2024
- [c53]Tajana Ban Kirigin, Jesse Comer, Max I. Kanovich, Andre Scedrov, Carolyn L. Talcott:
Time-Bounded Resilience. WRLA 2024: 22-44 - 2023
- [c52]Eben Blaisdell, Max I. Kanovich, Stepan L. Kuznetsov, Elaine Pimentel, Andre Scedrov:
Explorations in Subexponential Non-associative Non-commutative Linear Logic. AMSLO@ESSLLI 2023: 4-19 - 2022
- [c51]Eben Blaisdell, Max I. Kanovich, Stepan L. Kuznetsov, Elaine Pimentel, Andre Scedrov:
Non-associative, Non-commutative Multi-modal Linear Logic. IJCAR 2022: 449-467 - [c50]Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
On the Formalization and Computational Complexity of Resilience Problems for Cyber-Physical Systems. ICTAC 2022: 96-113 - 2021
- [c49]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
On the Complexity of Verification of Time-Sensitive Distributed Systems. Protocols, Strands, and Logic 2021: 251-275 - [c48]Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
On Security Analysis of Periodic Systems: Expressiveness and Complexity. ICISSP 2021: 43-54 - [c47]James Brotherston, Paul Brunet, Nikos Gorogiannis, Max I. Kanovich:
A Compositional Deadlock Detector for Android Java. ASE 2021: 955-966 - 2020
- [c46]Max I. Kanovich, Stepan L. Kuznetsov, Vivek Nigam, Andre Scedrov:
Soft Subexponentials and Multiplexing. IJCAR (1) 2020: 500-517 - 2019
- [c45]Musab A. AlTurki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
A Multiset Rewriting Model for Specifying and Verifying Timing Aspects of Security Protocols. Foundations of Security, Protocols, and Equational Reasoning 2019: 192-213 - [c44]Abraão Aires Urquiza, Musab A. AlTurki, Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Resource-Bounded Intruders in Denial of Service Attacks. CSF 2019: 382-396 - [c43]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
Undecidability of a Newly Proposed Calculus for CatLog3. FG 2019: 67-83 - [c42]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
The Complexity of Multiplicative-Additive Lambek Calculus: 25 Years Later. WoLLIC 2019: 356-372 - [c41]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
L-Models and R-Models for Lambek Calculus Enriched with Additives and the Multiplicative Unit. WoLLIC 2019: 373-391 - 2018
- [c40]James Brotherston, Max I. Kanovich:
On the Complexity of Pointer Arithmetic in Separation Logic. APLAS 2018: 329-349 - [c39]Max I. Kanovich, Stepan L. Kuznetsov, Vivek Nigam, Andre Scedrov:
A Logical Framework with Commutative and Non-commutative Subexponentials. IJCAR 2018: 228-245 - [c38]Musab A. AlTurki, Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Statistical Model Checking of Distance Fraud Attacks on the Hancke-Kuhn Family of Protocols. CPS-SPC@CCS 2018: 60-71 - [c37]Glyn Morrill, Stepan L. Kuznetsov, Max I. Kanovich, Andre Scedrov:
Bracket Induction for Lambek Calculus with Bracket Modalities. FG 2018: 84-101 - 2017
- [c36]James Brotherston, Nikos Gorogiannis, Max I. Kanovich:
Biabduction (and Related Problems) in Array Separation Logic. CADE 2017: 472-490 - [c35]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
Undecidability of the Lambek Calculus with Subexponential and Bracket Modalities. FCT 2017: 326-340 - [c34]Max I. Kanovich, Stepan L. Kuznetsov, Glyn Morrill, Andre Scedrov:
A Polynomial-Time Algorithm for the Lambek Calculus with Brackets of Bounded Order. FSCD 2017: 22:1-22:17 - 2016
- [c33]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
Undecidability of the Lambek Calculus with a Relevant Modality. FG 2016: 240-256 - [c32]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems. FORMATS 2016: 228-244 - [c31]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
On Lambek's Restriction in the Presence of Exponential Modalities. LFCS 2016: 146-158 - [c30]James Brotherston, Nikos Gorogiannis, Max I. Kanovich, Reuben Rowe:
Model checking for symbolic-heap separation logic with inductive predicates. POPL 2016: 84-96 - 2015
- [c29]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Discrete vs. Dense Times in the Analysis of Cyber-Physical Security Protocols. POST 2015: 259-279 - 2014
- [c28]Timos Antonopoulos, Nikos Gorogiannis, Christoph Haase, Max I. Kanovich, Joël Ouaknine:
Foundations for Decision Problems in Separation Logic with General Inductive Predicates. FoSSaCS 2014: 411-425 - 2013
- [c27]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov:
Bounded Memory Protocols and Progressing Collaborative Systems. ESORICS 2013: 309-326 - 2012
- [c26]Vivek Nigam, Tajana Ban Kirigin, Andre Scedrov, Carolyn L. Talcott, Max I. Kanovich, Ranko Perovic:
Towards an automated assistant for clinical investigations. IHI 2012: 773-778 - [c25]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott, Ranko Perovic:
A Rewriting Framework for Activities Subject to Regulations. RTA 2012: 305-322 - 2011
- [c24]Nikos Gorogiannis, Max I. Kanovich, Peter W. O'Hearn:
The Complexity of Abduction for Separated Heap Abstractions. SAS 2011: 25-42 - 2010
- [c23]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov:
Bounded Memory Dolev-Yao Adversaries in Collaborative Systems. Formal Aspects in Security and Trust 2010: 18-33 - [c22]James Brotherston, Max I. Kanovich:
Undecidability of Propositional Separation Logic and Its Neighbours. LICS 2010: 130-139 - 2009
- [c21]Max I. Kanovich, Paul D. Rowe, Andre Scedrov:
Policy Compliance in Collaborative Systems. CSF 2009: 218-233 - [c20]Max I. Kanovich:
Light Linear Logic with Controlled Weakening. LFCS 2009: 246-264 - 2007
- [c19]Max I. Kanovich, Paul D. Rowe, Andre Scedrov:
Collaborative Planning With Privacy. CSF 2007: 265-278 - [c18]Max I. Kanovich:
A Note on Rewriting Proofs and Fibonacci Numbers. LFCS 2007: 284-292 - 2003
- [c17]Max I. Kanovich, Jacqueline Vauzeilles:
Coping Polynomially with Numerous but Identical Elements within Planning Problems. CSL 2003: 285-298 - 2002
- [c16]Max I. Kanovich:
Bijections between Partitions by Two-Directional Rewriting Techniques. CSL 2002: 44-58 - 2001
- [c15]Rohit Chadha, Max I. Kanovich, Andre Scedrov:
Inductive methods and contract-signing protocols. CCS 2001: 176-185 - [c14]Max I. Kanovich:
The Expressive Power of Horn Monadic Linear Logic. CSL 2001: 39-53 - 1998
- [c13]Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov:
Specifying Real-Time Finite-State Systems in Linear Logic. COTIC 1998: 42-59 - 1997
- [c12]Max I. Kanovich, Takayasu Ito:
Temporal Linear Logic Specifications for Concurrent Processes (Extended Abstract). LICS 1997: 48-57 - [c11]Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov:
Phase semantics for light linear logic. MFPS 1997: 221-234 - 1996
- [c10]Max I. Kanovich:
Simulating Computations in Second Order Non-Commutative Linear Logic. Linear Logic Tokyo Meeting 1996: 106 - 1995
- [c9]Max I. Kanovich:
The Complexity of Neutrals in Linear Logic. LICS 1995: 486-495 - 1994
- [c8]Max I. Kanovich, Zoya M. Shalyapina:
The Rumors System Of Russian Synthesis. COLING 1994: 177-179 - [c7]Max I. Kanovich:
Computational and Concurrency Aspects of Linear Logic. IFIP Congress (1) 1994: 336-341 - [c6]Max I. Kanovich:
Computational and Concurrency Models of Linear Logic. LFCS 1994: 184-190 - [c5]Max I. Kanovich:
Petri Nets, Horn Programs, Linear Logic, and Vector Games. TACS 1994: 642-666 - [c4]Max I. Kanovich:
Simulating Guarded Programs in Linear Logic. Theory and Practice of Parallel Programming 1994: 45-69 - 1992
- [c3]Max I. Kanovich:
Horn Programming in Linear Logic Is NP-Complete. LICS 1992: 200-210 - 1991
- [c2]Max I. Kanovich:
Efficient Program Synthesis: Semantics, Logic, Complexity. TACS 1991: 615-632 - 1989
- [c1]Max I. Kanovich:
What is the Logic of Computational Tasks? Logic at Botik 1989: 181-185
Informal and Other Publications
- 2024
- [i16]Tajana Ban Kirigin, Jesse Comer, Max I. Kanovich, Andre Scedrov, Carolyn L. Talcott:
Technical Report: Time-Bounded Resilience. CoRR abs/2401.05585 (2024) - 2023
- [i15]Eben Blaisdell, Max I. Kanovich, Stepan L. Kuznetsov, Elaine Pimentel, Andre Scedrov:
Explorations in Subexponential non-associative non-commutative Linear Logic (extended version). CoRR abs/2307.03059 (2023) - 2021
- [i14]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
On the Complexity of Verification of Time-Sensitive Distributed Systems: Technical Report. CoRR abs/2105.03531 (2021) - 2020
- [i13]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
Language Models for Some Extensions of the Lambek Calculus. CoRR abs/2008.00070 (2020) - [i12]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities. CoRR abs/2008.00075 (2020) - 2018
- [i11]James Brotherston, Max I. Kanovich:
On the Complexity of Pointer Arithmetic in Separation Logic (an extended version). CoRR abs/1803.03164 (2018) - [i10]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Compliance in Real Time Multiset Rewriting Models. CoRR abs/1811.04826 (2018) - 2017
- [i9]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Time, Computational Complexity, and Probability in the Analysis of Distance-Bounding Protocols. CoRR abs/1702.03504 (2017) - [i8]Max I. Kanovich, Stepan L. Kuznetsov, Glyn Morrill, Andre Scedrov:
A polynomial time algorithm for the Lambek calculus with brackets of bounded order. CoRR abs/1705.00694 (2017) - [i7]Max I. Kanovich:
Simulating Linear Logic in 1-Only Linear Logic. CoRR abs/1709.02935 (2017) - 2016
- [i6]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
Undecidability of the Lambek calculus with a relevant modality. CoRR abs/1601.06303 (2016) - [i5]Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems. CoRR abs/1606.07886 (2016) - [i4]James Brotherston, Nikos Gorogiannis, Max I. Kanovich:
Biabduction (and Related Problems) in Array Separation Logic. CoRR abs/1607.01993 (2016) - [i3]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
Reconciling Lambek's restriction, cut-elimination, and substitution in the presence of exponential modalities. CoRR abs/1608.02254 (2016) - [i2]Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
Undecidability of the Lambek calculus with subexponentials and bracket modalities. CoRR abs/1608.04020 (2016) - 2015
- [i1]Max I. Kanovich:
Horn Linear Logic and Minsky Machines. CoRR abs/1512.04964 (2015)
Coauthor Index
[j28] [j27] [j26] [j25] [j24] [j23] [j22] [j21] [j20] [j18] [j17] [j13] [j7] [c53] [c52] [c51] [c50] [c49] [c48] [c46] [c45] [c44] [c43] [c42] [c41] [c39] [c38] [c37] [c35] [c34] [c33] [c32] [c31] [c29] [c27] [c26] [c25] [c23] [c21] [c19] [c15] [c13] [c11] [i16] [i15] [i14] [i13] [i12] [i10] [i9] [i8] [i6] [i5] [i3] [i2]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
