Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/oxford-university-press/formally-verifying-fault-tolerant-system-designs-m0WZP2e30k
References (29)
-
Huimin Lin (1993)
A Verification Tool for Value-Passing Processes -
G. Bruns, Ian Sutherland (1997)
Model Checking and Fault Tolerance -
K. Prasad (1984)
Specification and Proof of a Simple Fault Tolerant System in CCS -
F. Cristian (1985)
A Rigorous Approach to Fault-Tolerant ProgrammingIEEE Transactions on Software Engineering, SE-11
-
M. Hennessy, R. Milner (1985)
Algebraic laws for nondeterminism and concurrencyJ. ACM, 32
-
P. Krishnan (1994)
A Semantic Characterisation for Faults in Replicated SystemsTheor. Comput. Sci., 128
-
Z. Manna, A. Pnueli (1991)
The Temporal Logic of Reactive and Concurrent Systems -
J. Laprie, A. Avizienis, H. Kopetz (1992)
Dependability: Basic Concepts and Terminology -
D. Peled, M. Joseph (1994)
A Compositional Framework for Fault Tolerance by Specification TransformationTheor. Comput. Sci., 128
-
F. Boer, J. Coenen, R. Gerth (1992)
Exception Handling in Process Algebra -
H. Schepers, R. Gerth (1993)
A compositional proof theory for fault tolerant real-time distributed systemsProceedings of 1993 IEEE 12th Symposium on Reliable Distributed Systems
-
D. Powell, J. Arlat, L. Beus-Dukic, A. Bondavalli, P. Coppola, A. Fantechi, E. Jenn, C. Rabéjac, A. Wellings (1997)
GUARDS: A Generic Upgradable Architecture for Real-Time Dependable SystemsIEEE Trans. Parallel Distributed Syst., 10
-
R. Milner (1989)
Communication and concurrency -
H. Schepers, J. Hooman (1994)
A Trace-Based Compositional Proof Theory for Fault Tolerant Distributed SystemsTheor. Comput. Sci., 128
-
C. Bernardeschi, A. Fantechi, S. Gnesi (1999)
Formal Validation of the GUARDS Inter-Consistency Mechanism -
T. Janowski (1997)
On Bisimulation, Fault-Monotonicity and Provable Fault-Tolerance -
L. Lamport, Stephan Merz (1994)
Specifying and Verifying Fault-Tolerant Systems -
J. Burch, E. Clarke, D. Dill, Jenq-Neng Hwang (1989)
Symbolic model checking: 1020 states and beyond -
A. Fantechi, S. Gnesi, F. Mazzanti, R. Pugliese, E. Tronci (1998)
A Symbolic Model Checker for ACTL -
Uriel Witting (1995)
Dependable Computing for Critical Applications 4 -
E. Clarke, E. Emerson, A. Sistla (1986)
Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Trans. Program. Lang. Syst., 8
-
Didier Austry, Gérard Boudol (1984)
Algèbre de Processus et SynchronisationTheor. Comput. Sci., 30
-
C. Bernardeschi, A. Fantechi, L. Simoncini (1994)
Formal Reasoning on Fault Coverage of Fault Tolerant Techniques: A Case Study -
Zhiming Liu, M. Joseph (1999)
Specification and verification of fault-tolerance, timing, and schedulingACM Trans. Program. Lang. Syst., 21
-
Jens Nordahl (1993)
Design for Dependability -
Jean-Claude Fernandez, L. Mounier (1991)
"On the Fly" Verification of Behavioural Equivalences and Preorders -
T. Janowski (1994)
Fault-Tolerant Bisimulation and Process Tranformations -
F. Schneider (1990)
Implementing fault-tolerant services using the state machine approach: a tutorialACM Comput. Surv., 22
-
A. Bouali, S. Gnesi, Salvatore Larosa (1994)
The Integration Project for the JACK EnvironementBulletin of The European Association for Theoretical Computer Science
- Publisher
- Oxford University Press
- Copyright
- Copyright © 2015 British Computer Society
- ISSN
- 0010-4620
- eISSN
- 1460-2067
- DOI
- 10.1093/comjnl/43.3.191
- Publisher site
- See Article on Publisher Site
Abstract
This paper presents an approach for the specification and the verification of the correctness of fault tolerant system designs achieved by the application of fault tolerant techniques. The approach is based on process algebras, equivalence theory and temporal logic. The behaviour of the system in the absence of faults is formally specified and faults are assumed as random events which interfere with the system by modifying its behaviour. The fault tolerant technique is formalized by a context that specifies how replicas of the system cooperate to deal with faults. The system design is proved to behave correctly under a given fault hypothesis by proving the observational equivalence between the system design specification and the fault-free system specification. Additionally, model checking of a temporal logic formula which gives an abstract notion of correct behaviour can be applied to verify the correctness of the design. The opportunities given by the expression of the fault hypothesis using temporal logic are discussed. The actual usability of the approach in real case studies is supported by the availability of automatic tools for equivalence checking and for proving the temporal logic properties by model checking. Received 13 September, 1999. Revised 5 April, 2000. Copyright 2000 « Previous | Next Article » Table of Contents This Article The Computer Journal (2000) 43 (3): 191-205. doi: 10.1093/comjnl/43.3.191 » Abstract Free Full Text (PDF) Free Classifications Article Services Article metrics Alert me when cited Alert me if corrected Find similar articles Similar articles in Web of Science Add to my archive Download citation Request Permissions Citing Articles Load citing article information Citing articles via CrossRef Citing articles via Scopus Citing articles via Web of Science Citing articles via Google Scholar Google Scholar Articles by Bernardeschi, C. Articles by Simoncini, L. Search for related content Related Content Load related web page information Share Email this article CiteULike Delicious Facebook Google+ Mendeley Twitter What's this? Search this journal: Advanced » Current Issue November 2015 58 (11) Alert me to new issues The Journal About this journal Rights & Permissions Dispatch date of the next issue The Wilkes Award We are mobile – find out more Reviewer Guidelines Guidelines for Editors Review and Appeals Process Journals Career Network Published on behalf of BCS, The Chartered Institute for IT Impact factor: 0.787 5-Yr impact factor: 0.962 View full editorial board For Authors Instructions to authors Online submission instructions Submit a manuscript Self archiving policy Alerting Services Email table of contents Email Advance Access CiteTrack XML RSS feed Corporate Services Advertising sales Reprints Supplements var taxonomies = ("SCI01540"); Most Most Read Fast Implementation of Relational Operations Via Inverse Projections What is the Use of Operating Systems? Defining System Requirements to meet Business Needs: a Case Study Example On the Meaning of Safety and Security A Simplex Method for Function Minimization » View all Most Read articles Most Cited A Simplex Method for Function Minimization How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis Hierarchical grouping methods and stopping rules: an evaluation Function minimization by conjugate gradients A new approach to variable metric algorithms » View all Most Cited articles Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department. Online ISSN 1460-2067 - Print ISSN 0010-4620 Copyright © 2015 British Computer Society Oxford Journals Oxford University Press Site Map Privacy Policy Cookie Policy Legal Notices Frequently Asked Questions Other Oxford University Press sites: Oxford University Press Oxford Journals China Oxford Journals Japan Academic & Professional books Children's & Schools Books Dictionaries & Reference Dictionary of National Biography Digital Reference English Language Teaching Higher Education Textbooks International Education Unit Law Medicine Music Online Products & Publishing Oxford Bibliographies Online Oxford Dictionaries Online Oxford English Dictionary Oxford Language Dictionaries Online Oxford Scholarship Online Reference Rights and Permissions Resources for Retailers & Wholesalers Resources for the Healthcare Industry Very Short Introductions World's Classics function fnc_onDomLoaded() { var query_context = getQueryContext(); PF_initOIUnderbar(query_context,":QS:default","","JRN"); PF_insertOIUnderbar(0); }; if (window.addEventListener) { window.addEventListener('load', fnc_onDomLoaded, false); } else if (window.attachEvent) { window.attachEvent('onload', fnc_onDomLoaded); } var gaJsHost = (("https:" == document.location.protocol) ? "https://ssl." : "http://www."); document.write(unescape("%3Cscript src='" + gaJsHost + "google-analytics.com/ga.js' type='text/javascript'%3E%3C/script%3E")); try { var pageTracker = _gat._getTracker("UA-189672-16"); pageTracker._setDomainName(".oxfordjournals.org"); pageTracker._trackPageview(); } catch(err) {}
Journal
The Computer Journal – Oxford University Press
Published: Jan 1, 2000