Francesc Babot

Learn More
Equivalence reasoning with distributed system models, expressed directly as imperative programs with explicit parallelism, communication operations, storage variables and boolean conditions, remains virtually unexplored. Only reasoning with models expressed as process algebras has been amply dealt with in literature. However, these formalisms do not(More)
The theory of formal sequentialization proofs of distributed system models has been covered in the literature, as is detailed in the introduction. Formal communication elimination is an essential part of these proofs. In spite of the impressive reduction on the upper bound of the number of states obtained in some applications, no interactive tool to aid in(More)
  • 1