( en | de | ru )

 

Disambiguation of "Ngo, Tuan Phong"

Author of the publication

copydeleteadd this publication to your clipboard
Dynamic Partial Order Reduction Under the Release-Acquire Semantics (Tutorial).

, , , and . NETYS, volume 11704 of Lecture Notes in Computer Science, page 3-18. Springer, (2019)

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.

Tuan Ba Pham

Nguyen Thanh Phong

Nguyen Thanh Phong

phong khám đa khoa Viện gút

Michael Seri Phongphit

 

Other publications of authors with the same name

The Benefits of Duality in Verifying Concurrent Programs under TSO., , , and . CONCUR, volume 59 of LIPIcs, page 5:1-5:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Replacing Store Buffers by Load Buffers in TSO., , , and . VECoS, volume 11181 of Lecture Notes in Computer Science, page 22-28. Springer, (2018)Precise and Sound Automatic Fence Insertion Procedure under PSO., , , and . NETYS, volume 9466 of Lecture Notes in Computer Science, page 32-47. Springer, (2015)The Best of Both Worlds: Trading Efficiency and Optimality in Fence Insertion for TSO., , and . ESOP, volume 9032 of Lecture Notes in Computer Science, page 308-332. Springer, (2015)Generating qualified summarization answers using fuzzy concept hierarchies., , and . SoICT, volume 449 of ACM International Conference Proceeding Series, page 41-48. ACM, (2010)A Load-Buffer Semantics for Total Store Ordering., , , and . Logical Methods in Computer Science, (2018)Optimal stateless model checking for reads-from equivalence under sequential consistency., , , , , and . Proc. ACM Program. Lang., 3 (OOPSLA): 150:1-150:29 (2019)Context-Bounded Analysis for POWER., , , and . TACAS (2), volume 10206 of Lecture Notes in Computer Science, page 56-74. (2017)An Efficient Algorithm for Discovering Maximum Length Frequent Itemsets., , and . KSE, page 62-69. IEEE Computer Society, (2011)Dynamic Partial Order Reduction Under the Release-Acquire Semantics (Tutorial)., , , and . NETYS, volume 11704 of Lecture Notes in Computer Science, page 3-18. Springer, (2019)