A Programming Language Approach
to Fault Tolerance for Fork-Join Parallelism
Mustafa Zengin and Viktor Vafeiadis
Max Planck Institute for Software Systems (MPI-SWS)
Our Coq development defines these semantics formally and proves correspondence properties between the fault-prone semantics and standard fault-free evaluation.
More information can be found in the following paper:
-
Mustafa Zengin and Viktor Vafeiadis.
A programming language approach to fault tolerance for fork-join parallelism.
Proceedings of the 7th International Symposium on Theoretical Aspects of Software Engineering (TASE 2013).
- Ott-generated rules: lang.pdf
- Compilable coq sources: coq.zip
- HTML view of coq sources: coq/index.html