Max Kanovich

From MaRDI portal
Person:1326779

Available identifiers

zbMath Open kanovich.max-iDBLP39/5019WikidataQ102403179 ScholiaQ102403179MaRDI QIDQ1326779

List of research outcomes





PublicationDate of PublicationType
Explorations in Subexponential Non-associative Non-commutative Linear Logic2024-03-14Paper
Undecidability of a newly proposed calculus for CatLog32024-02-06Paper
On the complexity of pointer arithmetic in separation logic2023-08-02Paper
On the formalization and computational complexity of resilience problems for cyber-physical systems2023-07-28Paper
Explorations in Subexponential non-associative non-commutative Linear Logic (extended version)2023-07-06Paper
Bracket induction for Lambek calculus with bracket modalities2023-06-12Paper
Non-associative, non-commutative multi-modal linear logic2022-12-07Paper
Soft subexponentials and multiplexing2022-11-09Paper
Efficient program synthesis: semantics, logic, complexity2022-08-16Paper
On the complexity of verification of time-sensitive distributed systems2022-07-13Paper
Language models for some extensions of the Lambek calculus2022-06-13Paper
The multiplicative-additive Lambek calculus with subexponential and bracket modalities2021-06-25Paper
Language Models for Some Extensions of the Lambek Calculus2020-07-31Paper
A rewriting framework for activities subject to regulations2020-05-27Paper
https://portal.mardi4nfdi.de/entity/Q51113182020-05-26Paper
Reconciling Lambek's restriction, cut-elimination and substitution in the presence of exponential modalities2020-04-29Paper
The complexity of multiplicative-additive Lambek calculus: 25 years later2020-03-04Paper
L-models and R-models for Lambek calculus enriched with additives and the multiplicative unit2020-03-04Paper
A multiset rewriting model for specifying and verifying timing aspects of security protocols2020-03-03Paper
Subexponentials in non-commutative linear logic2019-10-09Paper
A logical framework with commutative and non-commutative subexponentials2018-10-18Paper
Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems2018-02-16Paper
Undecidability of the Lambek calculus with subexponential and bracket modalities2017-11-22Paper
Biabduction (and related problems) in array separation logic2017-09-22Paper
On Lambek's restriction in the presence of exponential modalities2017-07-21Paper
A rewriting framework and logic for activities subject to regulations2017-04-03Paper
Undecidability of the Lambek calculus with a relevant modality2016-12-01Paper
Model checking for symbolic-heap separation logic with inductive predicates2016-10-24Paper
Reconciling Lambek's restriction, cut-elimination, and substitution in the presence of exponential modalities2016-08-07Paper
The undecidability theorem for the Horn-like fragment of linear logic (revisited)2016-07-28Paper
Bounded memory protocols2015-03-31Paper
Bounded memory Dolev-Yao adversaries in collaborative systems2014-10-20Paper
Undecidability of propositional separation logic and its neighbours2014-09-12Paper
Multiset rewriting over Fibonacci and tribonacci numbers2014-06-10Paper
Foundations for decision problems in separation logic with general inductive predicates2014-04-16Paper
Light linear logics with controlled weakening: expressibility, confluent strong normalization2012-04-10Paper
Linear logic as a tool for planning under temporal uncertainty2011-05-10Paper
Light Linear Logic with Controlled Weakening2009-02-24Paper
A Note on Rewriting Proofs and Fibonacci Numbers2008-01-04Paper
Strong planning under uncertainty in domains with numerous but identical elements (a generic approach)2007-07-16Paper
Computer Science Logic2007-06-21Paper
The two-way rewriting in action: removing the mystery of Euler-Glaisher's map2007-05-23Paper
Intuitionistic phase semantics is almost classical2006-05-22Paper
Finding direct partition bijections by two-directional rewriting techniques2004-08-19Paper
Phase semantics for light linear logic2003-07-29Paper
https://portal.mardi4nfdi.de/entity/Q44118142003-07-10Paper
https://portal.mardi4nfdi.de/entity/Q47833002002-12-04Paper
The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity2002-10-13Paper
https://portal.mardi4nfdi.de/entity/Q45011502000-09-03Paper
https://portal.mardi4nfdi.de/entity/Q44907542000-07-20Paper
https://portal.mardi4nfdi.de/entity/Q42228931998-12-20Paper
https://portal.mardi4nfdi.de/entity/Q42090931998-11-09Paper
Linear logic automata1996-07-24Paper
Petri nets, Horn programs, linear logic and vector games1995-10-04Paper
https://portal.mardi4nfdi.de/entity/Q48429711995-08-16Paper
The complexity of Horn fragments of linear logic1995-05-16Paper
Linear logic as a logic of computations1995-01-16Paper
https://portal.mardi4nfdi.de/entity/Q39772091992-06-25Paper
Efficient program synthesis in computational models1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34953411989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38265271989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q52026331989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33524901989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42054401988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38046861988-01-01Paper
Complexity of hierarchical networks of finite automata1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37657521987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57525501987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37805061987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37749201986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37452771985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37477661985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37038851984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32205731984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37140661984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33401531983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33197781983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36808211983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51848981983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36761321983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36908011982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30431391982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41984791979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41775541978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41752691978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41257451977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41280141977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41467191977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41511281977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41635241977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40754451975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40888041975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40919151975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40536271974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40536351974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40650331974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40903161974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47703851973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40445561973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40536341973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56860251972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56860261972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56439601971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56439611971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56684641970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32149011970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40536311970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55717161969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56850581969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32149001969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40795911969-01-01Paper

Research outcomes over time

This page was built for person: Max Kanovich