BSP-Why, un outil pour la vérification déductive de programmes BSP : machine-checked semantics and application to distributed state-space algorithms

BSP-Why, un outil pour la vérification déductive de programmes BSP : machine-checked semantics and application to distributed state-space algorithms

Show other versions (1)

This thesis takes part in the formal verification of parallel programs. The aim of formal verification is to ensure that a program will run as it should, without making mistakes, blocking, or terminating abnormally. This is even more important in the parallel computation field, where the cost of cal...

Full description

Bibliographic Details
Main Author: Fortin, Jean
Language:English
Published: Université Paris-Est 2013
Subjects:
[INFO:INFO_OH] Computer Science/Other
[INFO:INFO_OH] Informatique/Autre
Bsp
Semantics
Deductive Verification
Online Access:http://tel.archives-ouvertes.fr/tel-00974977
http://tel.archives-ouvertes.fr/docs/00/97/49/77/PDF/TH2013PEST1084_complete.pdf

Internet

http://tel.archives-ouvertes.fr/tel-00974977
http://tel.archives-ouvertes.fr/docs/00/97/49/77/PDF/TH2013PEST1084_complete.pdf

Similar Items