Abstract
We propose a categorical and logical formalism and apply it in order to compositionally specify and verify the fault-tolerance mechanisms of the Modulor system. We claim that our approach is well-suited to the validation of real-sized critical systems.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. Bundy, F. van Harmelen, J. Hesketh, and A. Smaill. Experiments with proof plans for induction. Journal of Automated Reasoning, 7:303–324, 1991.
K.M. Chandy and J. Misra. Parallel Program Design. A Foundation. Addison-Wesley, 1988.
R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench. In proceedings of the workshop on automatic verification methods for finite-state systems, LNCS 407, pages 24–37, 1989.
V. David, Ch. Fraboul, J.Y. Rousselot, and P. Siron. Partitioning and mapping communication graphs on a modular reconfigurable parallel architecture. In CON-PAR'92, Sept 1992.
E. Allen Emerson. Temporal and modal logic. In Handbook of theoretical computer science, pages 996–1071. Elsevier Science, 1990.
J. Fiadeiro and T. Maibaum. Temporal theories as modularisation units for concurrent system specification. Formal Aspects of Computing, 1992.
D. Harel. Handbook of philosophical logic, volume 2, chapter 10, Dynamic Logic, pages 497–604. 1984.
C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
D. Kozen. Results on the propositional mu-calculus. Theoritical Computer Science, 27:333–354, 1983.
L. Lamport. The temporal logic of actions. Technical Report 79, SRC, 1992.
Zohar Manna and Amir Pnueli. The temporal logic of reactive and concurrent systems. Springer-Verlag, 1992.
Robin Milner. Handbook of theoretical computer science, chapter 19, Operational and algebraic semantics of concurrent processes, pages 1203–1242. Elsevier Science, 1990.
F. Pagani, C. Seguin, P. Siron, and V. Wiels. Verification experiments on a large fault-tolerant distributed system. In Workshop AMAST “Model and Proof”, Bordeaux, France, juin 1995.
John Rushby. Formal specification and verification of a fault-masking and transient-recovery model for digital flight-control systems. In J. Vytopil, editor, Formal Techniques in Real-Time and Fault-Tolerant Systems, number 571 in LNC-S, Nijmegen, The Netherlands, January 1992. Springer Verlag.
D.E. Rydeheard and R.M. Burstall. Computational Category Theory. Prentice Hall, 1988.
J. Sauloy. Interconnexion de modules. Technical report, CERT-ONERA, DERI, 1992.
V. Wiels. Specification et verification de programmes paralleles tolerants aux fautes. Master's thesis, E.N.S.E.E.I.H.T, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Seguin, C., Wiels, V. (1996). Using a logical and categorical approach for the validation of fault-tolerant systems. In: Gaudel, MC., Woodcock, J. (eds) FME'96: Industrial Benefit and Advances in Formal Methods. FME 1996. Lecture Notes in Computer Science, vol 1051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60973-3_96
Download citation
DOI: https://doi.org/10.1007/3-540-60973-3_96
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60973-5
Online ISBN: 978-3-540-49749-3
eBook Packages: Springer Book Archive