From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Assume-Guarantee Software Verification Based on Game Semantics.

A. Dimovski, и R. Lazic. ICFEM, том 4260 из Lecture Notes in Computer Science, стр. 529-548. Springer, (2006)

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.

Safety alternating automata on data words.R. Lazic. ACM Trans. Comput. Log., 12 (2): 10:1-10:24 (2011)The ideal view on Rackoff's coverability technique.R. Lazic, и S. Schmitz. Inf. Comput., (2021)When is Containment Decidable for Probabilistic Automata?.L. Daviaud, M. Jurdzinski, R. Lazic, F. Mazowiecki, G. Pérez, и J. Worrell. ICALP, том 107 из LIPIcs, стр. 121:1-121:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Model Checking Freeze LTL over One-Counter Automata.S. Demri, R. Lazic, и A. Sangnier. FoSSaCS, том 4962 из Lecture Notes in Computer Science, стр. 490-504. Springer, (2008)Contextual Approximation and Higher-Order Procedures.R. Lazic, и A. Murawski. FoSSaCS, том 9634 из Lecture Notes in Computer Science, стр. 162-179. Springer, (2016)Verification column.R. Lazic. ACM SIGLOG News, 7 (3): 28 (2020)Verification column.R. Lazic. ACM SIGLOG News, 6 (4): 3 (2019)Verification column.R. Lazic. ACM SIGLOG News, 8 (4): 3 (2021)Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems.L. Clemente, S. Lasota, R. Lazic, и F. Mazowiecki. ACM Trans. Comput. Log., 20 (3): 14:1-14:31 (2019)Leafy automata for higher-order concurrency.A. Dixon, R. Lazic, A. Murawski, и I. Walukiewicz. FoSSaCS, том 12650 из Lecture Notes in Computer Science, стр. 184-204. Springer, (2021)