Brief Announcement: Automated Support for the Design and Validation of Fault Tolerant Parameterized Systems - A Case Study
Background and motivations. Algorithms for ensuring fault tolerance are key ingredients in many applications such as avionics and networking. There is an increasing demand to integrate (formal) validation in the design process of these algorithms as they are often part of safety critical systems.When validation fails, the designer would benefit from tracking the sequence of events that led to an incorrect state to recover the error. To productively integrate formal verification in the design phase, tools should be able to return such error traces. Fault tolerant algorithms are often parametric, which makes their automated verification a daunting task. Indeed, checking that an algorithm satisfies a certain property requires to prove it for any number of processes.
Unable to display preview. Download preview PDF.
- 1.Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: Proc. of LICS, pp. 313–321 (1996)Google Scholar
- 2.Ghilardi, S., Nicolini, E., Ranise, S., Zucchelli, D.: Towards SMT Model-Checking of Array-based Systems. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 67–82. Springer, Heidelberg (2008)Google Scholar
- 3.Ghilardi, S., Ranise, S.: Mcmt: A Model Checker Modulo Theories. To appear in Proc. of IJCAR (July 2010)Google Scholar
- 5.Ghilardi, S., Ranise, S.: A note on the stopping failure model (Unpublished note), http://homes.dsi.unimi.it/~ghilardi/mcmt/stop_fail_note.pdf
- 7.The SMT-LIB initiative, http://www.SMT-LIB.org
- 8.Toueg, S., Chandra, T.D.: Time and Message Efficient Reliable Broadcast. In: van Leeuwen, J., Santoro, N. (eds.) WDAG 1990. LNCS, vol. 486, pp. 289–303. Springer, Heidelberg (1991)Google Scholar