Travelled to:1 × Canada
1 × Cyprus
1 × Israel
1 × Italy
1 × United Kingdom
8 × USA
Collaborated with:S.Qadeer T.Elmas R.K.Brayton B.K.Ozkan M.Emmi A.Bouajjani C.Enea A.Aziz E.Mutlu B.Livshits Y.Yu B.Batson C.Hawblitzel E.Petrank G.Bolukbasi M.E.Keremoglu S.O.Mutluergil B.Cook Talia Ringer D.Grossman D.Schwartz-Narbonne A.Sezgin O.Subasi R.Alur T.A.Henzinger F.Y.C.Mang S.K.Rajamani K.Khazem D.Kroening M.Tautschnig M.R.Tuttle A.Chudnov N.Collins J.Dodds B.Huffman C.MacCárthaigh S.Magill E.Mertens E.Mullen A.Tomb E.Westbrook F.Balarin S.Cheng R.Hojati T.Kam S.C.Krishnan R.K.Ranjan T.R.Shiple V.Singhal H.Wang A.L.Sangiovanni-Vincentelli
Talks about:program (4) concurr (4) formal (3) verif (3) model (3) use (3) goldilock (2) abstract (2) modular (2) verifi (2)
Person: Serdar Tasiran
DBLP: Tasiran:Serdar
Facilitated 2 volumes:
EdEdContributed to:
20152015
2015
2010
2009
2007
200620052005
2003199819971994
20172018
2017Wrote 19 papers:
- CAV-2015-HawblitzelPQT #automation #composition #concurrent #reasoning #refinement #source code
- Automated and Modular Refinement Reasoning for Concurrent Programs (CH, EP, SQ, ST), pp. 449–465.
- CAV-2015-OzkanET #android #debugging
- Systematic Asynchrony Bug Exploration for Android Apps (BKO, ME, ST), pp. 455–461.
- ESEC-FSE-2015-MutluTL #detection #javascript #matter
- Detecting JavaScript races that matter (EM, ST, BL), pp. 381–392.
- 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.
- DAC-2003-TasiranYB #model checking #monitoring #simulation #specification #using
- Using a formal specification and a model checker to monitor and direct simulation (ST, YY, BB), pp. 356–361.
- CAV-1998-AlurHMQRT #composition #model checking #named
- MOCHA: Modularity in Model Checking (RA, TAH, FYCM, SQ, SKR, ST), pp. 521–525.
- CAV-1997-TasiranB #case study #composition #named #verification
- STARI: A Case Study in Compositional and Hierarchical Timing Verification (ST, RKB), pp. 191–201.
- DAC-1994-AzizBCHKKRSSTWBS #named #verification
- HSIS: A BDD-Based Environment for Formal Verification (AA, FB, STC, RH, TK, SCK, RKR, TRS, VS, ST, HYW, RKB, ALSV), pp. 454–459.
- DAC-1994-AzizTB #finite #state machine
- BDD Variable Ordering for Interacting Finite State Machines (AA, ST, RKB), pp. 283–288.
- ESOP-2017-BouajjaniEEOT #concurrent #robust #source code #verification
- Verifying Robustness of Event-Driven Asynchronous Programs Against Concurrency (AB, ME, CE, BKO, ST), pp. 170–200.
- CAV-2018-BouajjaniEMT #abstraction #reasoning #reduction #source code #using
- Reasoning About TSO Programs Using Reduction and Abstraction (AB, CE, SOM, ST), pp. 336–353.
- CAV-2018-ChudnovCCDHMMMM #verification
- Continuous Formal Verification of Amazon s2n (AC, NC, BC, JD, BH, CM, SM, EM, EM, ST, AT, EW), pp. 430–446.
- CAV-2018-CookKKTTT #model checking
- Model Checking Boot Code from AWS Data Centers (BC, KK, DK, ST, MT, MRT), pp. 467–486.
- OOPSLA-2017-RingerGST #generative
- A solver-aided language for test input generation (TR, DG, DSN, ST), p. 24.