Travelled to:
1 × Austria
1 × France
1 × Ireland
1 × Italy
1 × Spain
1 × United Kingdom
6 × USA
Collaborated with:
M.Herlihy B.Cook M.J.Parkinson T.Terauchi T.Antonopoulos J.Yang O.Tripp M.Sagiv M.Y.Vardi S.Gulwani S.Jain T.C.Le D.Dimitrov V.Raychev M.T.Vechev K.Bansal T.Wies D.Zufferey P.Gazzillo M.H.0001 S.Wei
Talks about:
transact (5) nondetermin (2) program (2) analysi (2) tempor (2) reason (2) object (2) refin (2) methodolog (1) decomposit (1)
Person: Eric Koskinen
DBLP: Koskinen:Eric
Contributed to:
Wrote 15 papers:
- PLDI-2015-KoskinenP #transaction
- The Push/Pull model of transactions (EK, MJP), pp. 186–195.
- ESOP-2014-HerlihyK #composition #transaction
- Composable Transactional Objects: A Position Paper (MH, EK), pp. 1–7.
- LICS-CSL-2014-KoskinenT #reasoning
- Local temporal reasoning (EK, TT), p. 10.
- PLDI-2014-DimitrovRVK #commutative #concurrent #detection
- Commutativity race detection (DD, VR, MTV, EK), p. 33.
- OOPSLA-2013-TrippKS #nondeterminism #parallel
- Turning nondeterminism into parallelism (OT, EK, MS), pp. 589–604.
- PLDI-2013-CookK #nondeterminism #reasoning #source code
- Reasoning about nondeterminism in programs (BC, EK), pp. 219–230.
- TACAS-2013-BansalKWZ #abstraction
- Structural Counter Abstraction (KB, EK, TW, DZ), pp. 62–77.
- CAV-2011-CookKV #program analysis #verification
- Temporal Property Verification as a Program Analysis Task (BC, EK, MYV), pp. 333–348.
- POPL-2011-CookK
- Making prophecies with decision predicates (BC, EK), pp. 399–410.
- POPL-2010-KoskinenPH #transaction
- Coarse-grained transactions (EK, MJP, MH), pp. 19–30.
- PLDI-2009-GulwaniJK #analysis #bound #control flow #invariant #refinement
- Control-flow refinement and progress invariants for bound analysis (SG, SJ, EK), pp. 375–385.
- PPoPP-2008-HerlihyK #transaction
- Transactional boosting: a methodology for highly-concurrent transactional objects (MH, EK), pp. 207–216.
- OOPSLA-2019-AntonopoulosKL #refinement #specification
- Specification and inference of trace refinement relations (TA, EK, TCL), p. 30.
- POPL-2016-KoskinenY #reachability
- Reducing crash recoverability to reachability (EK, JY), pp. 97–108.
- PLDI-2017-AntonopoulosGHK #composition #proving #self
- Decomposition instead of self-composition for proving the absence of timing channels (TA, PG, MH0, EK, TT, SW), pp. 362–375.