( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Automated Verification of Web Applications with Embedded SQL.

, , , , , , и . ICDT, том 68 из LIPIcs, стр. 16:1-16:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

Hans Zuleger

Rolf Zuleger

Martin Zuleger

Werner Zuleger

Brigitte Zuleger

 

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

Harrsh: A Tool for Unied Reasoning about Symbolic-Heap Separation Logic., , , и . LPAR (Workshop and Short Papers), том 9 из Kalpa Publications in Computing, стр. 23-36. EasyChair, (2018)Beyond Symbolic Heaps: Deciding Separation Logic With Inductive Definitions., и . LPAR, том 73 из EPiC Series in Computing, стр. 390-408. EasyChair, (2020)On the Expressive Power of Communication Primitives in Parameterised Systems., , и . LPAR, том 9450 из Lecture Notes in Computer Science, стр. 313-328. Springer, (2015)A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis., , и . CAV, том 8559 из Lecture Notes in Computer Science, стр. 745-761. Springer, (2014)From Shapes to Amortized Complexity., , , , , и . VMCAI, том 10747 из Lecture Notes in Computer Science, стр. 205-225. Springer, (2018)Verifying Safety of Synchronous Fault-Tolerant Algorithms by Bounded Model Checking., , , и . TACAS (2), том 11428 из Lecture Notes in Computer Science, стр. 357-374. Springer, (2019)Feedback generation for performance problems in introductory programming assignments., , и . SIGSOFT FSE, стр. 41-51. ACM, (2014)Bounded Model Checking of Speculative Non-Interference., , и . ICCAD, стр. 1-9. IEEE, (2021)LOOPUS - A Tool for Computing Loop Bounds for C Programs., и . WING@ETAPS/IJCAR, том 1 из EPiC Series in Computing, стр. 185-186. EasyChair, (2010)Automated clustering and program repair for introductory programming assignments., , и . PLDI, стр. 465-480. ACM, (2018)