Viktor Vafeiadis

Viktor Vafeiadis

Auto-generated profile, based on publicly available information

Viktor Vafeiadis

MPI-SWS, Kaiserslautern, Germany

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 August 2007 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
VVViktor Vafeiadis
Viktor Vafeiadis
MPMatthew Parkinson
Matthew Parkinson

1 January 2010
Verified
Book Chapter
Closed access
PDF file
TDThomas Dinsdale-Young
Thomas Dinsdale-Young
MDMike Dodds
Mike Dodds
PGPhilippa Gardner
Philippa Gardner
MPMatthew J. Parkinson
Matthew J. Parkinson
VVViktor Vafeiadis
Viktor Vafeiadis

14 June 2017
Verified
Conference Paper
Open access
PDF file
OLOri Lahav
Ori Lahav
VVViktor Vafeiadis
Viktor Vafeiadis
JKJeehoon Kang
Jeehoon Kang
CHChung-Kil Hur
Chung-Kil Hur
DDDerek Dreyer
Derek Dreyer
The C/C++11 memory model defines the semantics of concurrent memory accesses in C/C++, and in particular supports racy \"atomic\" accesses at a range of different consistency levels, from very weak consistency (\"relaxed\") to strong, sequential consistency (\"SC\"). Unfortunately, as we observe in this paper, the semantics of SC atomic accesses in C/C++11, as well as in all proposed strengthenings of the semantics, is flawed, in that (contrary to previously published results) both suggested compilation schemes to the Power architecture are unsound. We propose a model, called RC11 (for Repaired C11), with a better semantics for SC accesses that restores the soundness of the compilation schemes to Power, maintains the DRF-SC guarantee, and provides stronger, more useful, guarantees to SC fences. In addition, we formally prove, for the first time, the correctness of the proposed stronger compilation schemes to Power that preserve load-to-store ordering and avoid \"out-of-thin-air\" reads.

1 January 2017
Verified
Conference Paper
Open access
JKJeehoon Kang
Jeehoon Kang
CHChung-Kil Hur
Chung-Kil Hur
OLOri Lahav
Ori Lahav
VVViktor Vafeiadis
Viktor Vafeiadis
DDDerek Dreyer
Derek Dreyer
Despite many years of research, it has proven very difficult to develop a memory model for concurrent programming languages that adequately balances the conflicting desiderata of programmers, compilers, and hardware. In this paper, we propose the first relaxed memory model that (1) accounts for a broad spectrum of features from the C++11 concurrency model, (2) is implementable, in the sense that it provably validates many standard compiler optimizations and reorderings, as well as standard compilation schemes to x86-TSO and Power, (3) justifies simple invariant-based reasoning, thus demonstrating the absence of bad "out-of-thin-air" behaviors, (4) supports "DRF" guarantees, ensuring that programmers who use sufficient synchronization need not understand the full complexities of relaxed-memory semantics, and (5) defines the semantics of racy programs without relying on undefined behaviors, which is a prerequisite for applicability to type-safe languages like Java. The key novel idea behind our model is the notion of *promises*: a thread may promise to execute a write in the future, thus enabling other threads to read from that write out of order. Crucially, to prevent out-of-thin-air behaviors, a promise step requires a thread-local certification that it will be possible to execute the promised write even in the absence of the promise. To establish confidence in our model, we have formalized most of our key results in Coq.

1 June 2013 in Journal of the ACM
Verified
Journal Article
Open access
JŠJaroslav Ševčík
Jaroslav Ševčík
VVViktor Vafeiadis
Viktor Vafeiadis
FNFrancesco Zappa Nardelli
Francesco Zappa Nardelli
SJSuresh Jagannathan
Suresh Jagannathan
PSPeter Sewell
Peter Sewell
In this article, we consider the semantic design and verified compilation of a C-like programming language for concurrent shared-memory computation on x86 multiprocessors. The design of such a language is made surprisingly subtle by several factors: the relaxed-memory behavior of the hardware, the effects of compiler optimization on concurrent code, the need to support high-performance concurrent algorithms, and the desire for a reasonably simple programming model. In turn, this complexity makes verified compilation both essential and challenging. We describe ClightTSO, a concurrent extension of CompCert’s Clight in which the TSO-based memory model of x86 multiprocessors is exposed for high-performance code, and CompCertTSO, a formally verified compiler from ClightTSO to x86 assembly language, building on CompCert. CompCertTSO is verified in Coq: for any well-behaved and successfully compiled ClightTSO source program, any permitted observable behavior of the generated assembly code (if it does not run out of memory) is also possible in the source semantics. We also describe some verified fence-elimination optimizations, integrated into CompCertTSO.

1 January 2010
Verified
Book Chapter
Closed access
PDF file
VVViktor Vafeiadis
Viktor Vafeiadis