3 citations · 3 across the 2 of their papers we have counts for
7 papers
On the Complexity of Verification of Time-Sensitive Distributed Systems: Technical Report
Max Kanovich, Tajana Ban Kirigin, Vivek Nigam +2
This paper develops a Multiset Rewriting language with explicit time for the specification and analysis of Time-Sensitive Distributed Systems (TSDS). Goals are often specified usin…
The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities
Max Kanovich, Stepan Kuznetsov, Andre Scedrov
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…
Language Models for Some Extensions of the Lambek Calculus
Max Kanovich, Stepan Kuznetsov, Andre Scedrov
We investigate language interpretations of two extensions of the Lambek calculus: with additive conjunction and disjunction and with additive conjunction and the unit constant. For…
Compliance in Real Time Multiset Rewriting Models
Max Kanovich, Tajana Ban Kirigin, Vivek Nigam +2
The notion of compliance in Multiset Rewriting Models (MSR) has been introduced for untimed models and for models with discrete time. In this paper we revisit the notion of complia…
On the Complexity of Pointer Arithmetic in Separation Logic (an extended version)
James Brotherston, Max Kanovich
We investigate the complexity consequences of adding pointer arithmetic to separation logic. Specifically, we study extensions of the points-to fragment of symbolic-heap separation…
Simulating Linear Logic in 1-Only Linear Logic
Max Kanovich
Linear Logic was introduced by Girard as a resource-sensitive refinement of classical logic. It turned out that full propositional Linear Logic is undecidable (Lincoln, Mitchell, S…