Author of the publication

Detecting Fair Non-termination in Multithreaded Programs

, , , and . Computer Aided Verification, page 210--226. Berlin, Heidelberg, Springer, (2012)

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.

 

Other publications of authors with the same name

Model checking Branching-Time Properties of Multi-Pushdown Systems is Hard, , , and . CoRR, (2012)On the Upward/Downward Closures of Petri Nets., , , and . MFCS, volume 83 of LIPIcs, page 49:1-49:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Parameterized verification under TSO is PSPACE-complete., , and . Proc. ACM Program. Lang., 4 (POPL): 26:1-26:29 (2020)Verification of Directed Acyclic Ad Hoc Networks., , and . FMOODS/FORTE, volume 7892 of Lecture Notes in Computer Science, page 193-208. Springer, (2013)Push-Down Automata with Gap-Order Constraints., , , and . FSEN, volume 8161 of Lecture Notes in Computer Science, page 199-216. Springer, (2013)Verification of programs under the release-acquire semantics., , , and . PLDI, page 1117-1132. ACM, (2019)Budget-bounded model-checking pushdown systems., , , and . Formal Methods Syst. Des., 45 (2): 273-301 (2014)Chain-Free String Constraints (Technical Report)., , , , and . CoRR, (2023)Overcoming Memory Weakness with Unified Fairness - Systematic Verification of Liveness in Weak Memory Models., , , , and . CAV (1), volume 13964 of Lecture Notes in Computer Science, page 184-205. Springer, (2023)On the verification problem for weak memory models., , , and . POPL, page 7-18. ACM, (2010)