Follow
Viktor Vafeiadis
Viktor Vafeiadis
Max Planck Institute for Software Systems (MPI-SWS), Saarland Informatics Campus (SIC)
Verified email at mpi-sws.org - Homepage
Title
Cited by
Cited by
Year
A marriage of rely/guarantee and separation logic
V Vafeiadis, M Parkinson
CONCUR 2007–Concurrency Theory, 256-271, 2007
4102007
Concurrent Abstract Predicates.
T Dinsdale-Young, M Dodds, P Gardner, MJ Parkinson, V Vafeiadis
ECOOP 6183, 504-528, 2010
3182010
Modular fine-grained concurrency verification
V Vafeiadis
University of Cambridge, Computer Laboratory, 2008
2512008
Repairing sequential consistency in C/C++ 11
O Lahav, V Vafeiadis, J Kang, CK Hur, D Dreyer
ACM SIGPLAN Notices 52 (6), 618-632, 2017
1902017
A promising semantics for relaxed-memory concurrency
J Kang, CK Hur, O Lahav, V Vafeiadis, D Dreyer
ACM SIGPLAN Notices 52 (1), 175-189, 2017
1842017
Relaxed separation logic: A program logic for C11 concurrency
V Vafeiadis, C Narayan
OOPSLA 2013 48 (10), 867-884, 2013
1642013
CompCertTSO: A verified compiler for relaxed-memory concurrency
J Ševčík, V Vafeiadis, F Zappa Nardelli, S Jagannathan, P Sewell
Journal of the ACM (JACM) 60 (3), 1-50, 2013
1602013
Deny-guarantee reasoning
M Dodds, X Feng, M Parkinson, V Vafeiadis
ESOP 2009, 363-377, 2009
1572009
GPS: Navigating weak memory with ghosts, protocols, and separation
A Turon, V Vafeiadis, D Dreyer
Proceedings of the 2014 ACM International Conference on Object Oriented …, 2014
1562014
Automatically proving linearizability
V Vafeiadis
CAV 2010, 450-464, 2010
1492010
Proving correctness of highly-concurrent linearisable objects
V Vafeiadis, M Herlihy, T Hoare, M Shapiro
PPoPP 2006, 129-136, 2006
1372006
Common compiler optimisations are invalid in the C11 memory model and what we can do about it
V Vafeiadis, T Balabonski, S Chakraborty, R Morisset, F Zappa Nardelli
Proceedings of the 42Nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of …, 2015
1312015
Effective stateless model checking for C/C++ concurrency
M Kokologiannakis, O Lahav, K Sagonas, V Vafeiadis
Proceedings of the ACM on Programming Languages 2 (POPL), 17, 2018
1222018
Relaxed-memory concurrency and verified compilation
J Ŝevčik, V Vafeiadis, F Zappa Nardelli, S Jagannathan, P Sewell
POPL 2011, 43-54, 2011
1182011
Strong logic for weak memory: Reasoning about release-acquire consistency in Iris
JO Kaiser, HH Dang, D Dreyer, O Lahav, V Vafeiadis
31st European Conference on Object-Oriented Programming (ECOOP 2017), 2017
1162017
The power of parameterization in coinductive proof
CK Hur, G Neis, D Dreyer, V Vafeiadis
POPL 2013, 2012
1162012
Automating the choice of consistency levels in replicated systems
C Li, J Leitão, A Clement, N Preguiça, R Rodrigues, V Vafeiadis
2014 {USENIX} Annual Technical Conference ({USENIX}{ATC} 14), 281-292, 2014
1152014
Taming release-acquire consistency
O Lahav, N Giannarakis, V Vafeiadis
ACM SIGPLAN Notices 51 (1), 649-662, 2016
1112016
Proving that non-blocking algorithms don't block
A Gotsman, B Cook, M Parkinson, V Vafeiadis
POPL 2009, 16-28, 2009
1052009
Modular safety checking for fine-grained concurrency
C Calcagno, M Parkinson, V Vafeiadis
SAS 2007, 233-248, 2007
1042007
The system can't perform the operation now. Try again later.
Articles 1–20