B-ASM: specification of ASM à la B

  • Authors:

  • David Michel;Frédéric Gervais;Pierre Valarcher

  • Affiliations:

  • LIX, CNRS, Polytechnique School, Palaiseau, France;Dpt. informatique, LACL, Université Paris-Est, IUT Sénart Fontainebleau, Fontainebleau, France;Dpt. informatique, LACL, Université Paris-Est, IUT Sénart Fontainebleau, Fontainebleau, France

  • Venue:
  • ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
  • Year:
  • 2010

Quantified Score

Hi-index 0.01

Visualization

Abstract

We aim at extending the B language in order to build ASM programs which are correct with respect to B-like logical specifications. On the one hand, the main strengths of the B formal method are: i) the ability to express logical statements, and ii) the construction of a correct implementation by refinement. On the other hand, from our viewpoint, the striking aspects of ASM are the non-bounded outer loop that can reach the fixed point of a program and the power to express naturally any kind of (sequential) algorithms.