From post

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

Counterexample Validation and Interpolation-Based Refinement for Forest Automata.

L. Holík, M. Hruska, O. Lengál, A. Rogalewicz, и T. Vojnar. VMCAI, том 10145 из Lecture Notes in Computer Science, стр. 288-309. Springer, (2017)

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.

Jost Adam

Adam Gruber

Milan Adam

Adam Sklorz

Klaus Adam

Другие публикации лиц с тем же именем

Automata-Based Termination Proofs.R. Iosif, и A. Rogalewicz. CIAA, том 5642 из Lecture Notes in Computer Science, стр. 165-177. Springer, (2009)Low-Level Bi-Abduction (Artifact).L. Holík, P. Peringer, A. Rogalewicz, V. Soková, T. Vojnar, и F. Zuleger. Dagstuhl Artifacts Ser., 8 (2): 11:1-11:6 (2022)Abstraction Refinement for Trace Inclusion of Data Automata.R. Iosif, A. Rogalewicz, и T. Vojnar. CoRR, (2014)Deciding Boolean Separation Logic via Small Models.T. Dacík, A. Rogalewicz, T. Vojnar, и F. Zuleger. TACAS (1), том 14570 из Lecture Notes in Computer Science, стр. 188-206. Springer, (2024)Automata-Based Termination Proofs.R. Iosif, и A. Rogalewicz. Comput. Informatics, 32 (4): 739-775 (2013)Abstraction refinement and antichains for trace inclusion of infinite state systems.L. Holík, R. Iosif, A. Rogalewicz, и T. Vojnar. Formal Methods Syst. Des., 55 (3): 137-170 (2020)Counterexample Validation and Interpolation-Based Refinement for Forest Automata.L. Holík, M. Hruska, O. Lengál, A. Rogalewicz, и T. Vojnar. VMCAI, том 10145 из Lecture Notes in Computer Science, стр. 288-309. Springer, (2017)Low-Level Bi-Abduction.L. Holík, P. Peringer, A. Rogalewicz, V. Soková, T. Vojnar, и F. Zuleger. ECOOP, том 222 из LIPIcs, стр. 19:1-19:30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)SL-COMP: Competition of Solvers for Separation Logic.M. Sighireanu, J. Pérez, A. Rybalchenko, N. Gorogiannis, R. Iosif, A. Reynolds, C. Serban, J. Katelaan, C. Matheja, T. Noll и 14 other автор(ы). TACAS (3), том 11429 из Lecture Notes in Computer Science, стр. 116-132. Springer, (2019)Deciding Entailments in Inductive Separation Logic with Tree Automata.R. Iosif, A. Rogalewicz, и T. Vojnar. ATVA, том 8837 из Lecture Notes in Computer Science, стр. 201-218. Springer, (2014)

BibSonomy

Disambiguation