Max I. Kanovich

99 papers A* 7A 7B 13C 5Misc 4Journal 45Unranked 18
YearRankTypeTitle / Venue / Authors
2026 C conf
Complexity of Equational Theories for Relational and Language Action Lattices.
RAMICS
Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2026 J jnl
Verification of time-bounded multiset rewriting properties.
J. Log. Algebraic Methods Program.
Tajana Ban Kirigin, Jesse Comer, Max I. Kanovich, Andre Scedrov, Carolyn L. Talcott
2024 J jnl
Technical Report: Time-Bounded Resilience.
CoRR
Tajana Ban Kirigin, Jesse Comer, Max I. Kanovich, Andre Scedrov, Carolyn L. Talcott
2024 — conf
Time-Bounded Resilience.
WRLA
Tajana Ban Kirigin, Jesse Comer, Max I. Kanovich, Andre Scedrov, Carolyn L. Talcott
2023 — conf
Explorations in Subexponential Non-associative Non-commutative Linear Logic.
AMSLO@ESSLLI
Eben Blaisdell, Max I. Kanovich, Stepan L. Kuznetsov, Elaine Pimentel, Andre Scedrov
2023 J jnl
Explorations in Subexponential non-associative non-commutative Linear Logic (extended version).
CoRR
Eben Blaisdell, Max I. Kanovich, Stepan L. Kuznetsov, Elaine Pimentel, Andre Scedrov
2022 J jnl
Language models for some extensions of the Lambek calculus.
Inf. Comput.
Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2022 A conf
Non-associative, Non-commutative Multi-modal Linear Logic.
IJCAR
Eben Blaisdell, Max I. Kanovich, Stepan L. Kuznetsov, Elaine Pimentel, Andre Scedrov
2022 C conf
On the Formalization and Computational Complexity of Resilience Problems for Cyber-Physical Systems.
ICTAC
Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2022 J jnl
On the Security and Complexity of Periodic Systems.
SN Comput. Sci.
Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2021 A* conf
A Compositional Deadlock Detector for Android Java.
ASE
James Brotherston, Paul Brunet, Nikos Gorogiannis, Max I. Kanovich
2021 J jnl
Correction to: The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities.
J. Log. Lang. Inf.
Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2021 C conf
On Security Analysis of Periodic Systems: Expressiveness and Complexity.
ICISSP
Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2021 — conf
On the Complexity of Verification of Time-Sensitive Distributed Systems.
Protocols, Strands, and Logic
Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2021 J jnl
On the Complexity of Verification of Time-Sensitive Distributed Systems: Technical Report.
CoRR
Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2021 J jnl
Resource and timing aspects of security protocols.
J. Comput. Secur.
Abraão Aires Urquiza, Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2021 J jnl
The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities.
J. Log. Lang. Inf.
Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2020 J jnl
Language Models for Some Extensions of the Lambek Calculus.
CoRR
Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2020 J jnl
Reconciling Lambek's restriction, cut-elimination and substitution in the presence of exponential modalities.
J. Log. Comput.
Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2020 — conf
Soft Subexponentials and Multiplexing.
IJCAR (1)
Max I. Kanovich, Stepan L. Kuznetsov, Vivek Nigam, Andre Scedrov
2020 J jnl
The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities.
CoRR
Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2019 — conf
A Multiset Rewriting Model for Specifying and Verifying Timing Aspects of Security Protocols.
Foundations of Security, Protocols, and Equational Reasoning
Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2019 C conf
L-Models and R-Models for Lambek Calculus Enriched with Additives and the Multiplicative Unit.
WoLLIC
Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2019 A conf
Resource-Bounded Intruders in Denial of Service Attacks.
CSF
Abraão Aires Urquiza, Musab A. Alturki, Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2019 J jnl
Subexponentials in non-commutative linear logic.
Math. Struct. Comput. Sci.
Max I. Kanovich, Stepan L. Kuznetsov, Vivek Nigam, Andre Scedrov
2019 C conf
The Complexity of Multiplicative-Additive Lambek Calculus: 25 Years Later.
WoLLIC
Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2019 B conf
Undecidability of a Newly Proposed Calculus for CatLog3.
FG
Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2018 A conf
A Logical Framework with Commutative and Non-commutative Subexponentials.
IJCAR
Max I. Kanovich, Stepan L. Kuznetsov, Vivek Nigam, Andre Scedrov
2018 B conf
Bracket Induction for Lambek Calculus with Bracket Modalities.
FG
Glyn Morrill, Stepan L. Kuznetsov, Max I. Kanovich, Andre Scedrov
2018 J jnl
Compliance in Real Time Multiset Rewriting Models.
CoRR
Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2018 J jnl
On the Complexity of Pointer Arithmetic in Separation Logic (an extended version).
CoRR
James Brotherston, Max I. Kanovich
2018 B conf
On the Complexity of Pointer Arithmetic in Separation Logic.
APLAS
James Brotherston, Max I. Kanovich
2018 — conf
Statistical Model Checking of Distance Fraud Attacks on the Hancke-Kuhn Family of Protocols.
CPS-SPC@CCS
Musab A. Alturki, Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2017 B conf
A Polynomial-Time Algorithm for the Lambek Calculus with Brackets of Bounded Order.
FSCD
Max I. Kanovich, Stepan L. Kuznetsov, Glyn Morrill, Andre Scedrov
2017 J jnl
A polynomial time algorithm for the Lambek calculus with brackets of bounded order.
CoRR
Max I. Kanovich, Stepan L. Kuznetsov, Glyn Morrill, Andre Scedrov
2017 J jnl
A rewriting framework and logic for activities subject to regulations.
Math. Struct. Comput. Sci.
Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott, Ranko Perovic
2017 A conf
Biabduction (and Related Problems) in Array Separation Logic.
CADE
James Brotherston, Nikos Gorogiannis, Max I. Kanovich
2017 J jnl
Simulating Linear Logic in 1-Only Linear Logic.
CoRR
Max I. Kanovich
2017 J jnl
Time, Computational Complexity, and Probability in the Analysis of Distance-Bounding Protocols.
CoRR
Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2017 J jnl
Time, computational complexity, and probability in the analysis of distance-bounding protocols.
J. Comput. Secur.
Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2017 B conf
Undecidability of the Lambek Calculus with Subexponential and Bracket Modalities.
FCT
Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2016 J jnl
Biabduction (and Related Problems) in Array Separation Logic.
CoRR
James Brotherston, Nikos Gorogiannis, Max I. Kanovich
2016 A* conf
Model checking for symbolic-heap separation logic with inductive predicates.
POPL
James Brotherston, Nikos Gorogiannis, Max I. Kanovich, Reuben Rowe
2016 Misc conf
On Lambek's Restriction in the Presence of Exponential Modalities.
LFCS
Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2016 J jnl
Reconciling Lambek's restriction, cut-elimination, and substitution in the presence of exponential modalities.
CoRR
Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2016 J jnl
The undecidability theorem for the Horn-like fragment of linear logic (Revisited).
Math. Struct. Comput. Sci.
Max I. Kanovich
2016 — conf
Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems.
FORMATS
Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2016 J jnl
Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems.
CoRR
Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2016 B conf
Undecidability of the Lambek Calculus with a Relevant Modality.
FG
Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2016 J jnl
Undecidability of the Lambek calculus with a relevant modality.
CoRR
Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2016 J jnl
Undecidability of the Lambek calculus with subexponentials and bracket modalities.
CoRR
Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov
2015 — conf
Discrete vs. Dense Times in the Analysis of Cyber-Physical Security Protocols.
POST
Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott
2015 J jnl
Horn Linear Logic and Minsky Machines.
CoRR
Max I. Kanovich
2014 J jnl
Bounded memory Dolev-Yao adversaries in collaborative systems.
Inf. Comput.
Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov
2014 J jnl
Bounded memory protocols.
Comput. Lang. Syst. Struct.
Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov
2014 B conf
Foundations for Decision Problems in Separation Logic with General Inductive Predicates.
FoSSaCS
Timos Antonopoulos, Nikos Gorogiannis, Christoph Haase, Max I. Kanovich, Joël Ouaknine
2014 J jnl
Multiset rewriting over Fibonacci and Tribonacci numbers.
J. Comput. Syst. Sci.
Max I. Kanovich
2014 J jnl
Undecidability of Propositional Separation Logic and Its Neighbours.
J. ACM
James Brotherston, Max I. Kanovich
2013 A conf
Bounded Memory Protocols and Progressing Collaborative Systems.
ESORICS
Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov
2012 — conf
A Rewriting Framework for Activities Subject to Regulations.
RTA
Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott, Ranko Perovic
2012 J jnl
Light linear logics with controlled weakening: Expressibility, confluent strong normalization.
Ann. Pure Appl. Log.
Max I. Kanovich
2012 — conf
Towards an automated assistant for clinical investigations.
IHI
Vivek Nigam, Tajana Ban Kirigin, Andre Scedrov, Carolyn L. Talcott, Max I. Kanovich, Ranko Perovic
2011 J jnl
Collaborative Planning with Confidentiality.
J. Autom. Reason.
Max I. Kanovich, Paul D. Rowe, Andre Scedrov
2011 J jnl
Linear logic as a tool for planning under temporal uncertainty.
Theor. Comput. Sci.
Max I. Kanovich, Jacqueline Vauzeilles
2011 B conf
The Complexity of Abduction for Separated Heap Abstractions.
SAS
Nikos Gorogiannis, Max I. Kanovich, Peter W. O'Hearn
2010 — conf
Bounded Memory Dolev-Yao Adversaries in Collaborative Systems.
Formal Aspects in Security and Trust
Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov
2010 A* conf
Undecidability of Propositional Separation Logic and Its Neighbours.
LICS
James Brotherston, Max I. Kanovich
2009 Misc conf
Light Linear Logic with Controlled Weakening.
LFCS
Max I. Kanovich
2009 A conf
Policy Compliance in Collaborative Systems.
CSF
Max I. Kanovich, Paul D. Rowe, Andre Scedrov
2007 Misc conf
A Note on Rewriting Proofs and Fibonacci Numbers.
LFCS
Max I. Kanovich
2007 A conf
Collaborative Planning With Privacy.
CSF
Max I. Kanovich, Paul D. Rowe, Andre Scedrov
2007 J jnl
Strong planning under uncertainty in domains with numerous but identical elements (a generic approach).
Theor. Comput. Sci.
Max I. Kanovich, Jacqueline Vauzeilles
2007 J jnl
The two-way rewriting in action: Removing the mystery of Euler-Glaisher's map.
Discret. Math.
Max I. Kanovich
2006 J jnl
Intuitionistic phase semantics is almost classical.
Math. Struct. Comput. Sci.
Max I. Kanovich, Mitsuhiro Okada, Kazushige Terui
2004 J jnl
Finding direct partition bijections by two-directional rewriting techniques.
Discret. Math.
Max I. Kanovich
2003 B conf
Coping Polynomially with Numerous but Identical Elements within Planning Problems.
CSL
Max I. Kanovich, Jacqueline Vauzeilles
2003 J jnl
Phase semantics for light linear logic.
Theor. Comput. Sci.
Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov
2002 B conf
Bijections between Partitions by Two-Directional Rewriting Techniques.
CSL
Max I. Kanovich
2001 A* conf
Inductive methods and contract-signing protocols.
CCS
Rohit Chadha, Max I. Kanovich, Andre Scedrov
2001 B conf
The Expressive Power of Horn Monadic Linear Logic.
CSL
Max I. Kanovich
2001 J jnl
The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity.
Math. Struct. Comput. Sci.
Max I. Kanovich, Jacqueline Vauzeilles
1998 — conf
Specifying Real-Time Finite-State Systems in Linear Logic.
COTIC
Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov
1997 B conf
Phase semantics for light linear logic.
MFPS
Max I. Kanovich, Mitsuhiro Okada, Andre Scedrov
1997 A* conf
Temporal Linear Logic Specifications for Concurrent Processes (Extended Abstract).
LICS
Max I. Kanovich, Takayasu Ito
1996 J jnl
Linear Logic Automata.
Ann. Pure Appl. Log.
Max I. Kanovich
1996 — conf
Simulating Computations in Second Order Non-Commutative Linear Logic.
Linear Logic Tokyo Meeting
Max I. Kanovich
1995 J jnl
Petri Nets, Horn Programs, Linear Logic and Vector Games.
Ann. Pure Appl. Log.
Max I. Kanovich
1995 A* conf
The Complexity of Neutrals in Linear Logic
LICS
Max I. Kanovich
1994 — conf
Computational and Concurrency Aspects of Linear Logic.
IFIP Congress (1)
Max I. Kanovich
1994 Misc conf
Computational and Concurrency Models of Linear Logic.
LFCS
Max I. Kanovich
1994 J jnl
Linear Logic as a Logic of Computations.
Ann. Pure Appl. Log.
Max I. Kanovich
1994 — conf
Petri Nets, Horn Programs, Linear Logic, and Vector Games.
TACS
Max I. Kanovich
1994 — conf
Simulating Guarded Programs in Linear Logic.
Theory and Practice of Parallel Programming
Max I. Kanovich
1994 J jnl
The Complexity of Horn Fragments of Linear Logic.
Ann. Pure Appl. Log.
Max I. Kanovich
1994 B conf
The Rumors System Of Russian Synthesis.
COLING
Max I. Kanovich, Zoya M. Shalyapina
1992 A* conf
Horn Programming in Linear Logic Is NP-Complete
LICS
Max I. Kanovich
1991 — conf
Efficient Program Synthesis: Semantics, Logic, Complexity.
TACS
Max I. Kanovich
1990 J jnl
Efficient Program Synthesis in Computational Models.
J. Log. Program.
Max I. Kanovich
1989 — conf
What is the Logic of Computational Tasks?
Logic at Botik
Max I. Kanovich