( en | de | ru )

 

Disambiguation of "Elmas, Tayfun"

Author of the publication

copydeleteadd this publication to your clipboard
Goldilocks: a race and transaction-aware java runtime.

, , and . PLDI, page 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. You can also use the button next to the name to display some publications already assigned to the person.

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

 

Other publications of authors with the same name

CONCURRIT: Testing Concurrent Programs with Programmable State-Space Exploration., , , and . HotPar, USENIX Association, (2012)Verification Tools for Transactional Programs., , , , , , , , and . Transactional Memory, volume 8913 of Lecture Notes in Computer Science, Springer, (2015)CONCURRIT: a domain specific language for reproducing concurrency bugs., , , and . PLDI, page 153-164. ACM, (2013)A calculus of atomic actions., , and . POPL, page 2-15. ACM, (2009)Goldilocks: a race and transaction-aware java runtime., , and . PLDI, page 245-255. ACM, (2007)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)VyrdMC: Driving Runtime Refinement Checking with Model Checkers., and . RV@CAV, volume 144 of Electronic Notes in Theoretical Computer Science, page 41-56. Elsevier, (2005)A classification of concurrency bugs in java benchmarks by developer intent., , and . PADTAD, page 23-26. ACM, (2006)QED: a proof system based on reduction and abstraction for the static verification of concurrent software.. ICSE (2), page 507-508. ACM, (2010)978-1-60558-719-6.Simplifying Linearizability Proofs with Reduction and Abstraction., , , , and . TACAS, volume 6015 of Lecture Notes in Computer Science, page 296-311. Springer, (2010)