Abstract
We describe an approach to formally specify object-based software components, in order to be able to automatically check their behavior at run-time. The specification is a regular expression built from the propositions about the states (or pairs of states) of a component. Checking is done by a specification-generated wrapper, which produces a fail-stop component from a component which fails in an arbitrary way. The wrapper-generator is implemented for a subset of Java classes. We argue that specification-based error-detection is particularly suitable for the components of open, object-based distributed systems.
Chapter PDF
Similar content being viewed by others
Keywords
References
A.K. Chandra and L.J Stockmeyer. Alternation. In FOCS 17, pages 98–108, 1976.
M. Dwyer, G. Avrunin, and J. Corbett. Patterns in property specifications for finite-state verification. In International Conference on Software Engineering, 1999.
B. Jacobs and J. Rutten. A tutorial on (co)algebras and (co)induction. EATCS Bulletin, 62: 222–259, 1997.
Bart Jacobs. Objects and classes, co-algebraically. In Object-Orientation with Parallelism and Persistence. Kluwer, 1996.
T. Janowski. On bisimulation, fault-monotonicity and provable fault-tolerance. In Proc. 6th AMAST, volume 1349 of LNCS, 1997.
T. Janowski and W. Mostowski. Fail-stop software components by pattern matching. Presented at the Workshop on Run-Time Result Verification, part of the Federated Logic Conference, Trento, 1999.
J.C. Laprie. Dependability: Basic concepts and associated terminology. Technical report, PDCS, 1990.
Z. Liu and M. Joseph. Specification and verification of fault-tolerance, timing, and scheduling. ACM TOPLAS, 21 (1), 1999.
R. Milner. Communication and Concurrency. Prentice Hall, 1989.
C. Pfister and C. Szyperski. Why objects are not enough. In Int. Component Users Conference, Munich, Germany, 1996.
The RAISE Language Group. The RAISE Specification Language. Prentice Hall, 1992.
D. Richardson, O. O’Malley, and C. Tittle. Approaches to specification-based testing. In ACM Symposium on Software Testing, Analysis and Verification, 1989.
Donald Sannella and Andrzej Tarlecki. Essential Concepts of Algebraic Specification and Program Development. Formal Aspects of Computing, 9: 229–269, 1997.
R.D. Schlichting and F.B. Schneider. Fail stop processors: An approach to designing fault-tolerant computing systems. ACM TOCS, 1 (3): 222–238, 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 IFIP International Federation for Information Processing
About this paper
Cite this paper
Janowski, T., Mostowski, W.I. (2000). Fail-Stop Components by Pattern Matching. In: Smith, S.F., Talcott, C.L. (eds) Formal Methods for Open Object-Based Distributed Systems IV. FMOODS 2000. IFIP Advances in Information and Communication Technology, vol 49. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35520-7_18
Download citation
DOI: https://doi.org/10.1007/978-0-387-35520-7_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-1018-2
Online ISBN: 978-0-387-35520-7
eBook Packages: Springer Book Archive