( en | de | ru )

 

Disambiguation of "Zuleger, Florian"

Author of the publication

copydeleteadd this publication to your clipboard
Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability.

, , , and . Description Logics, volume 1193 of CEUR Workshop Proceedings, page 591-594. CEUR-WS.org, (2014)

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.

Rolf Zuleger

Hans Zuleger

Werner Zuleger

Martin Zuleger

Brigitte Zuleger

 

Other publications of authors with the same name

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