Skip to main content

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

The validation of implementations is an essential part of the design of both hardware and software systems in order to establish the correctness of such systems. As such it has been an important application area for all kinds of formal methods to support this activity. Many of such methods, however, aim at a complete proof of correctness, which become unmanageable in the case of larger, realistic designs. In practice, therefore, attention is limited to such methods that can be applied partially or in an approximative manner. Albeit more pragmatic, these approaches usually lack a good measure for the extent to which correctness is established. Such coverage measures are needed to compare and assess different strategies for partial validation in the context of a given specification. In this article we propose to follow a measure-theoretic approach in which an exogenous cost function (quantifying the effect of certain properties in an implementation) is integrated over a measure that is induced by the probability of error occurrences in implementations. In this way, in fact, we do not only obtain a notion of coverage, but a general way of assigning measures to specification theories in the context of a given class of implementation structures.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Alilovic-Curgus, S.T. Vuong, A Metric Based Theory of Test Selection and Coverage, in: A. Danthine, G. Leduc, and P. Wolper (eds.), Protocol Specification, Testing, and Verification, XIII, North-Holland (to appear).

    Google Scholar 

  2. H. Bauer, Probability Theory and Elements of Measure Theory, Holt, Rine-hart, and Winston.

    Google Scholar 

  3. G. Bernot, Testing against formal specifications: a theoretical view. In: S. Abramsky and T.S.E. Maibaum (eds.), TAPSOFT’91,Volume 2, 99–119. LNCS 494, Springer-Verlag, 1991.

    Google Scholar 

  4. E. Brinksma, A Theory for the derivation of tests. In: S. Aggarwal and K. Sabnani (eds.), Protocol Specification, Testing, and Verification VIII, 63–74, North-Holland, 1988.

    Google Scholar 

  5. E. Brinksma, J. Tretmans, and L. Verhaard, A framework for test selection. In: B. JĂ³nsson, J. Parrow, and B. Pehrson (eds.), Protocol Specification, Testing, and Verification XI, 233–248, North-Holland, 1991.

    Google Scholar 

  6. R. van Glabbeek, S.A. Smolka, B. Steffen, C. Tofts, Reactive, generative, and stratified models of probabilistic processes, in: Proceedings LICS 1990.

    Google Scholar 

  7. P. Godefroid and P. Wolper, Using Partial orders for the Efficient Verification of Deadlock Freedom and Safety Properties. In: K.G. Larsen and A. Skou (eds.), Computer Aided Verification y91, 332–342. LNCS 575, Springer-Verlag, 1992.

    Google Scholar 

  8. H.J. Keisler, Model Theory for Infinitary Logic,North-Holland.

    Google Scholar 

  9. N.F. Maxemchuk and K. Sabnani, Probabilistic Verification of Communication Protocols. In: H. Rudin and C. West (eds.), Protocol Specification, Testing, and Verification VII,North-Holland, 1987.

    Google Scholar 

  10. C. Stirling, Modal and Temporal Logics for Processes, LFCS Report Series,ECS-LFCS-92-221, Dept. of Computer Science, University of Edinburgh, 1992.

    Google Scholar 

  11. J.P. Tremblay and R. Manohar, Discrete Mathematical Structures with Applications to Computer Science, McGraw-Hill, 1975.

    Google Scholar 

  12. A. Valmari, Error detection by reduced reachability graph generation. In: Proc. 10th International Conference on Application and Theory of Petri Nets, volume 2, 1–22, Bonn, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1994 British Computer Society

About this paper

Cite this paper

Brinksma, E. (1994). On the coverage of partial validations. In: Nivat, M., Rattray, C., Rus, T., Scollo, G. (eds) Algebraic Methodology and Software Technology (AMAST’93). Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3227-1_25

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3227-1_25

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19852-9

  • Online ISBN: 978-1-4471-3227-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics