Viktor Vafeiadis
Viktor Vafeiadis
Max Planck Institute for Software Systems (MPI-SWS), Saarland Informatics Campus (SIC)
Dirección de correo verificada de mpi-sws.org - Página principal
Título
Citado por
Citado por
Año
A marriage of rely/guarantee and separation logic
V Vafeiadis, M Parkinson
CONCUR 2007–Concurrency Theory, 256-271, 2007
3612007
Concurrent abstract predicates
T Dinsdale-Young, M Dodds, P Gardner, MJ Parkinson, V Vafeiadis
European Conference on Object-Oriented Programming, 504-528, 2010
2552010
Modular fine-grained concurrency verification
V Vafeiadis
University of Cambridge, Computer Laboratory, 2008
2262008
Deny-guarantee reasoning
M Dodds, X Feng, M Parkinson, V Vafeiadis
ESOP 2009, 363-377, 2009
1442009
Automatically proving linearizability
V Vafeiadis
CAV 2010, 450-464, 2010
1322010
Relaxed separation logic: A program logic for C11 concurrency
V Vafeiadis, C Narayan
OOPSLA 2013 48 (10), 867-884, 2013
1242013
Proving correctness of highly-concurrent linearisable objects
V Vafeiadis, M Herlihy, T Hoare, M Shapiro
PPoPP 2006, 129-136, 2006
1242006
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
1202013
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
1132014
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
1022017
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
1022017
Relaxed-memory concurrency and verified compilation
J Ŝevčik, V Vafeiadis, F Zappa Nardelli, S Jagannathan, P Sewell
POPL 2011, 43-54, 2011
1002011
Proving that non-blocking algorithms don't block
A Gotsman, B Cook, M Parkinson, V Vafeiadis
POPL 2009, 16-28, 2009
1002009
Modular safety checking for fine-grained concurrency
C Calcagno, M Parkinson, V Vafeiadis
SAS 2007, 233-248, 2007
942007
Shape-value abstraction for verifying linearizability
V Vafeiadis
VMCAI 2009, 335-348, 2009
932009
The power of parameterization in coinductive proof
CK Hur, G Neis, D Dreyer, V Vafeiadis
POPL 2013, 2012
912012
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
902015
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
872014
Acute: high-level programming language design for distributed computation
P Sewell, JJ Leifer, K Wansbrough, F Zappa Nardelli, M Allen-Williams, ...
ICFP 2005, 15-26, 2005
81*2005
Structuring the verification of heap-manipulating programs
A Nanevski, V Vafeiadis, J Berdine
POPL 2010, 261-274, 2010
802010
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20