( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Abstraction refinement and antichains for trace inclusion of infinite state systems.

, , , и . Formal Methods Syst. Des., 55 (3): 137-170 (2020)

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.

Helga Holik

Josef Holik

Helga Holik

Helga Holik

Ludmilla Holik

 

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

Antichains for Inclusion Games., , и . CoRR, (2016)Approximate reduction of finite automata for high-speed network intrusion detection., , , , и . Int. J. Softw. Tools Technol. Transf., 22 (5): 523-539 (2020)Nested antichains for WS1S., , , и . Acta Inf., 56 (3): 205-228 (2019)Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection., , , , и . CoRR, (2017)From Low-Level Pointers to High-Level Containers., , , , и . VMCAI, том 9583 из Lecture Notes in Computer Science, стр. 431-452. Springer, (2016)Low-Level Bi-Abduction (Artifact)., , , , , и . Dagstuhl Artifacts Ser., 8 (2): 11:1-11:6 (2022)Z3-Noodler: An Automata-based String Solver (Technical Report)., , , , , и . CoRR, (2023)Effect Summaries for Thread-Modular Analysis - Sound Analysis Despite an Unsound Heuristic., , , и . SAS, том 10422 из Lecture Notes in Computer Science, стр. 169-191. Springer, (2017)Fast Matching of Regular Patterns with Synchronizing Counting., , , и . FoSSaCS, том 13992 из Lecture Notes in Computer Science, стр. 392-412. Springer, (2023)Simplifying Alternating Automata for Emptiness Testing., и . APLAS, том 13008 из Lecture Notes in Computer Science, стр. 243-264. Springer, (2021)