| 2022 | CADE | Non-associative, Non-commutative Multi-modal Linear Logic. | Eben Blaisdell, Max I. Kanovich, Stepan L. Kuznetsov, Elaine Pimentel, Andre Scedrov |
| 2022 | ICTAC | On the Formalization and Computational Complexity of Resilience Problems for Cyber-Physical Systems. | Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott |
| 2021 | ICISSP | On Security Analysis of Periodic Systems: Expressiveness and Complexity. | Musab A. Alturki, Tajana Ban Kirigin, Max I. Kanovich, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott |
| 2020 | CADE | Soft Subexponentials and Multiplexing. | Max I. Kanovich, Stepan L. Kuznetsov, Vivek Nigam, Andre Scedrov |
| 2019 | FG | Undecidability of a Newly Proposed Calculus for CatLog3. | Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov |
| 2019 | WoLLIC | The Complexity of Multiplicative-Additive Lambek Calculus: 25 Years Later. | Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov |
| 2019 | WoLLIC | L-Models and R-Models for Lambek Calculus Enriched with Additives and the Multiplicative Unit. | Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov |
| 2018 | APLAS | On the Complexity of Pointer Arithmetic in Separation Logic. | James Brotherston, Max I. Kanovich |
| 2018 | CADE | A Logical Framework with Commutative and Non-commutative Subexponentials. | Max I. Kanovich, Stepan L. Kuznetsov, Vivek Nigam, Andre Scedrov |
| 2018 | CCS | Statistical Model Checking of Distance Fraud Attacks on the Hancke-Kuhn Family of Protocols. | Musab A. AlTurki, Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott |
| 2018 | FG | Bracket Induction for Lambek Calculus with Bracket Modalities. | Glyn Morrill, Stepan L. Kuznetsov, Max I. Kanovich, Andre Scedrov |
| 2017 | CADE | Biabduction (and Related Problems) in Array Separation Logic. | James Brotherston, Nikos Gorogiannis, Max I. Kanovich |
| 2017 | FCT | Undecidability of the Lambek Calculus with Subexponential and Bracket Modalities. | Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov |
| 2016 | FG | Undecidability of the Lambek Calculus with a Relevant Modality. | Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov |
| 2016 | LFCS | On Lambek's Restriction in the Presence of Exponential Modalities. | Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov |
| 2016 | POPL | Model checking for symbolic-heap separation logic with inductive predicates. | James Brotherston, Nikos Gorogiannis, Max I. Kanovich, Reuben Rowe |
| 2014 | FOSSACS | Foundations for Decision Problems in Separation Logic with General Inductive Predicates. | Timos Antonopoulos, Nikos Gorogiannis, Christoph Haase, Max I. Kanovich, Jol Ouaknine |
| 2013 | ESORICS | Bounded Memory Protocols and Progressing Collaborative Systems. | Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov |
| 2011 | SAS | The Complexity of Abduction for Separated Heap Abstractions. | Nikos Gorogiannis, Max I. Kanovich, Peter W. O'Hearn |
| 2010 | LICS | Undecidability of Propositional Separation Logic and Its Neighbours. | James Brotherston, Max I. Kanovich |
| 2009 | LFCS | Light Linear Logic with Controlled Weakening. | Max I. Kanovich |
| 2007 | LFCS | A Note on Rewriting Proofs and Fibonacci Numbers. | Max I. Kanovich |
| 2003 | CSL | Coping Polynomially with Numerous but Identical Elements within Planning Problems. | Max I. Kanovich, Jacqueline Vauzeilles |
| 2002 | CSL | Bijections between Partitions by Two-Directional Rewriting Techniques. | Max I. Kanovich |
| 2001 | CCS | Inductive methods and contract-signing protocols. | Rohit Chadha, Max I. Kanovich, Andre Scedrov |
| 2001 | CSL | The Expressive Power of Horn Monadic Linear Logic. | Max I. Kanovich |
| 1997 | LICS | Temporal Linear Logic Specifications for Concurrent Processes (Extended Abstract). | Max I. Kanovich, Takayasu Ito |
| 1995 | LICS | The Complexity of Neutrals in Linear Logic | Max I. Kanovich |
| 1994 | COLING | The Rumors System Of Russian Synthesis. | Max I. Kanovich, Zoya M. Shalyapina |
| 1994 | LFCS | Computational and Concurrency Models of Linear Logic. | Max I. Kanovich |
| 1992 | LICS | Horn Programming in Linear Logic Is NP-Complete | Max I. Kanovich |