( en | de | ru )

 

Disambiguation of "Kanovich, Max I."

Author of the publication

copydeleteadd this publication to your clipboard
A Rewriting Framework for Activities Subject to Regulations.

, , , , , and . RTA, volume 15 of LIPIcs, page 305-322. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nata i i

Ulrich Max

William Clinton Maxwell

Petru Joan Maxim

Bernhard Maxeiner

 

Other publications of authors with the same name

Computational and Concurrency Aspects of Linear Logic.. IFIP Congress (1), volume A-51 of IFIP Transactions, page 336-341. North-Holland, (1994)Bounded Memory Protocols and Progressing Collaborative Systems., , , and . ESORICS, volume 8134 of Lecture Notes in Computer Science, page 309-326. Springer, (2013)The Complexity of Horn Fragments of Linear Logic.. Ann. Pure Appl. Log., 69 (2-3): 195-241 (1994)Inductive methods and contract-signing protocols., , and . ACM Conference on Computer and Communications Security, page 176-185. ACM, (2001)Phase semantics for light linear logic., , and . Theor. Comput. Sci., 294 (3): 525-549 (2003)Collaborative Planning with Confidentiality., , and . J. Autom. Reason., 46 (3-4): 389-421 (2011)On the Complexity of Pointer Arithmetic in Separation Logic (an extended version)., and . CoRR, (2018)Undecidability of Propositional Separation Logic and Its Neighbours., and . J. ACM, 61 (2): 14:1-14:43 (2014)Bounded Memory Dolev-Yao Adversaries in Collaborative Systems., , , and . Formal Aspects in Security and Trust, volume 6561 of Lecture Notes in Computer Science, page 18-33. Springer, (2010)Explorations in Subexponential non-associative non-commutative Linear Logic (extended version)., , , , and . CoRR, (2023)