Modular, crash-safe refinement for ASMs with submachines

@article{Ernst2016ModularCR,
  title={Modular, crash-safe refinement for ASMs with submachines},
  author={Gidon Ernst and J{\"o}rg Pf{\"a}hler and Gerhard Schellhorn and Wolfgang Reif},
  journal={Sci. Comput. Program.},
  year={2016},
  volume={131},
  pages={3-21}
}
Abstract In this paper we define a formal refinement theory for a variant of Abstract State Machines (ASMs) with submachines and power cuts. The theory is motivated by the development of a verified flash file system. Different components of the system are modeled as submachines and refined individually. We define a non-atomic semantics that is suitable for considering power cuts in the middle of operations. We prove that refinement is compositional with respect to submachines and crashes. We… CONTINUE READING
BETA

References

Publications referenced by this paper.
SHOWING 1-10 OF 45 REFERENCES

Modeling in Event-B: Train system

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Dynamic logic

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

P

G. Ntzik
  • da Rocha Pinto, P. Gardner, Fault-tolerant resource reasoning, in: Proc. of the Asian Symposium on Programming Languages and Systems (APLAS), Springer LNCS 9458
  • 2015
VIEW 2 EXCERPTS

Similar Papers

Loading similar papers…