Tayfun Elmas

According to our database, Tayfun Elmas authored at least 19 papers between 2004 and 2015.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2015

Verification Tools for Transactional Programs.

Adrián Cristal, Burcu Kulahcioglu Ozkan, Ernie Cohen, Gokcen Kestor, Ismail Kuru, Osman S. Unsal, Serdar Tasiran, Suha Orhun Mutluergil, Tayfun Elmas

Proceedings of the Transactional Memory. Foundations, Algorithms, Tools, and Applications, 2015

2013

CONCURRIT: a domain specific language for reproducing concurrency bugs.

Tayfun Elmas, Jacob Burnim, George C. Necula, Koushik Sen

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2013

2012

NDetermin: inferring nondeterministic sequential specifications for parallelism correctness.

Jacob Burnim, Tayfun Elmas, George C. Necula, Koushik Sen

Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2012

CONCURRIT: Testing Concurrent Programs with Programmable State-Space Exploration.

Jacob Burnim, Tayfun Elmas, George C. Necula, Koushik Sen

Proceedings of the 4th USENIX Workshop on Hot Topics in Parallelism, 2012

2011

NDSeq: runtime checking for nondeterministic sequential specifications of parallel correctness.

Jacob Burnim, Tayfun Elmas, George C. Necula, Koushik Sen

Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, 2011

2010

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)

Tayfun Elmas

PhD thesis, 2010

Goldilocks: a race-aware Java runtime.

Tayfun Elmas, Shaz Qadeer, Serdar Tasiran

Commun. ACM, 2010

Simplifying Linearizability Proofs with Reduction and Abstraction.

Tayfun Elmas, Shaz Qadeer, Ali Sezgin, Omer Subasi, Serdar Tasiran

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2010

QED: a proof system based on reduction and abstraction for the static verification of concurrent software.

Tayfun Elmas

Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering, 2010

2009

A calculus of atomic actions.

Tayfun Elmas, Shaz Qadeer, Serdar Tasiran

Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2009

An annotation assistant for interactive debugging of programs with common synchronization idioms.

Tayfun Elmas, Ali Sezgin, Serdar Tasiran, Shaz Qadeer

Proceedings of the 7th Workshop on Parallel and Distributed Systems: Testing, 2009

2007

Rollback Atomicity.

Serdar Tasiran, Tayfun Elmas

Proceedings of the Runtime Verification, 7th International Workshop, 2007

Goldilocks: a race and transaction-aware java runtime.

Tayfun Elmas, Shaz Qadeer, Serdar Tasiran

Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, 2007

2006

A classification of concurrency bugs in java benchmarks by developer intent.

M. Erkan Keremoglu, Serdar Tasiran, Tayfun Elmas

Proceedings of the 4th Workshop on Parallel and Distributed Systems: Testing, 2006

Goldilocks: Efficiently Computing the Happens-Before Relation Using Locksets.

Tayfun Elmas, Shaz Qadeer, Serdar Tasiran

Proceedings of the Formal Approaches to Software Testing and Runtime Verification, 2006

2005

VyrdMC: Driving Runtime Refinement Checking with Model Checkers.

Tayfun Elmas, Serdar Tasiran

Proceedings of the Fifth Workshop on Runtime Verification, 2005

VYRD: verifYing concurrent programs by runtime refinement-violation detection.

Tayfun Elmas, Serdar Tasiran, Shaz Qadeer

Proceedings of the ACM SIGPLAN 2005 Conference on Programming Language Design and Implementation, 2005

A Novel Test Coverage Metric for Concurrently-Accessed Software Components.

Serdar Tasiran, Tayfun Elmas, Guven Bolukbasi, M. Erkan Keremoglu

Proceedings of the Formal Approaches to Software Testing, 5th International Workshop, 2005

2004

Distributed Document Sharing with Text Classification over Content-Addressable Network.

Tayfun Elmas, Öznur Özkasap

Proceedings of the Content Computing, Advanced Workshop on Content Computing, 2004