Travelled to:1 × Cyprus
1 × South Africa
1 × United Kingdom
7 × USA
Collaborated with:S.Tasiran S.Qadeer J.Burnim G.C.Necula K.Sen ∅ G.Bolukbasi M.E.Keremoglu A.Sezgin O.Subasi
Talks about:concurr (4) specif (3) runtim (3) nondeterminist (2) goldilock (2) sequenti (2) parallel (2) abstract (2) softwar (2) correct (2)
Person: Tayfun Elmas
DBLP: Elmas:Tayfun
Contributed to:
2013
20122011
2010
2010
20092007
200620052005Wrote 10 papers:
- PLDI-2013-ElmasBNS #concurrent #debugging #domain-specific language #named
- CONCURRIT: a domain specific language for reproducing concurrency bugs (TE, JB, GCN, KS), pp. 153–164.
- PPoPP-2012-BurnimENS #correctness #named #nondeterminism #parallel #specification
- NDetermin: inferring nondeterministic sequential specifications for parallelism correctness (JB, TE, GCN, KS), pp. 329–330.
- PLDI-2011-BurnimENS #correctness #named #nondeterminism #parallel #runtime #specification
- NDSeq: runtime checking for nondeterministic sequential specifications of parallel correctness (JB, TE, GCN, KS), pp. 401–414.
- ICSE-2010-Elmas #abstraction #concurrent #named #proving #reduction #verification
- QED: a proof system based on reduction and abstraction for the static verification of concurrent software (TE), pp. 507–508.
- TACAS-2010-ElmasQSST #abstraction #proving #reduction
- Simplifying Linearizability Proofs with Reduction and Abstraction (TE, SQ, AS, OS, ST), pp. 296–311.
- POPL-2009-ElmasQT #calculus
- A calculus of atomic actions (TE, SQ, ST), pp. 2–15.
- PLDI-2007-ElmasQT #java #named #runtime #transaction
- Goldilocks: a race and transaction-aware java runtime (TE, SQ, ST), pp. 245–255.
- FATES-RV-2006-ElmasQT #named #using
- Goldilocks: Efficiently Computing the Happens-Before Relation Using Locksets (TE, SQ, ST), pp. 193–208.
- FATES-2005-TasiranEBK #component #metric #novel #test coverage
- A Novel Test Coverage Metric for Concurrently-Accessed Software Components (ST, TE, GB, MEK), pp. 62–71.
- PLDI-2005-ElmasTQ #concurrent #detection #named #runtime #source code #verification
- VYRD: verifYing concurrent programs by runtime refinement-violation detection (TE, ST, SQ), pp. 27–37.