( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Goldilocks: a race and transaction-aware java runtime.

, , и . PLDI, стр. 245-255. ACM, (2007)

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.

Sait Elmas

Neuartige Komplexe von Oxo-Pincer-Liganden mit späten Übergangsmetallen. Uni Köln, (2008)

enol Elmas

Tayfun Yilmaz

Tayfun Bozkurt

Tayfun Gürel

 

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

Techniques for runtime monitoring and static verification of concurrent software (Koşut-zamanlı yazılımlar için çalışma-zamanı izleme ve durağan doğrulama teknikleri). Koç University, Turkey, (2010)Verification Tools for Transactional Programs., , , , , , , , и . Transactional Memory, том 8913 из Lecture Notes in Computer Science, Springer, (2015)CONCURRIT: Testing Concurrent Programs with Programmable State-Space Exploration., , , и . HotPar, USENIX Association, (2012)CONCURRIT: a domain specific language for reproducing concurrency bugs., , , и . PLDI, стр. 153-164. ACM, (2013)A calculus of atomic actions., , и . POPL, стр. 2-15. ACM, (2009)Goldilocks: a race and transaction-aware java runtime., , и . PLDI, стр. 245-255. ACM, (2007)A classification of concurrency bugs in java benchmarks by developer intent., , и . PADTAD, стр. 23-26. ACM, (2006)QED: a proof system based on reduction and abstraction for the static verification of concurrent software.. ICSE (2), стр. 507-508. ACM, (2010)978-1-60558-719-6.Rollback Atomicity., и . RV, том 4839 из Lecture Notes in Computer Science, стр. 188-201. Springer, (2007)Simplifying Linearizability Proofs with Reduction and Abstraction., , , , и . TACAS, том 6015 из Lecture Notes in Computer Science, стр. 296-311. Springer, (2010)