Skip to main content

Tutorial 1: Abstraction and Refinement of Concurrent Programs and Formal Specification A Practical View

  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPDPS 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1800))

Included in the following conference series:

  • 1077 Accesses

Abstract

Formal methods allow to model systems and systems properties by providing accurate mathematical notations (type theory, set theory, ...). Implementations can be derived from a formal specification using methods based on refinement. Therefore, from a pragmatic industrial point of vue, the dual work based on abstraction is very important too for verifying safety critical systems, but also for addressing questions like maintenance, reverse ingineering of codes, modifications of programming language, code evolution, inspection of open codes to ensure their correctness with respect to the specification, program comprehension... The tutorial will sketch practical issues related to abstraction and refinement techniques for concurrent programming.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. J.-R. Abrial. The B book-Assigning Programs to Meanings. Cambridge University Press, 1996.

    Google Scholar 

  2. J.-R. Abrial. Extending b without changing it (for developing distributed systems). In H. Habrias, editor, 1 stConference on the B method, pages 169–190, November 1996.

    Google Scholar 

  3. J.-R. Abrial and L. Mussat. Introducing dynamic constraints in B. In D. Bert, editor, B’ 98: Recent Advances in the Development and Use of the B Method, volume 1393 of Lecture Notes in Computer Science. Springer-Verlag, 1998.

    Google Scholar 

  4. J.R. Abrial. Development of the abr protocol. ps file, february 1999.

    Google Scholar 

  5. P. Cousot. Calculational System Design, chapter The Calculational Design of a Generic Abstract Interpreter. NATO ASI Series F. Amsterdam: IOS Press, 1999.

    Google Scholar 

  6. P. Cousot and R. Cousot. Abstract interpretation frameworks. Journal of Logic and Computation, 2(4):511–547, 1992.

    Article  MathSciNet  Google Scholar 

  7. P. Cousot and R. Cousot. Refining model checking by abstract interpretation. 6(l):69–96, January 1999.

    Google Scholar 

  8. STERIA-Technologies de l’Information, Aix-en-Provence (F). Atelier B, Manuel Utilisateur, 1998. Version 3.5.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cansell, D., Méry, D., Tabacznyj, C. (2000). Tutorial 1: Abstraction and Refinement of Concurrent Programs and Formal Specification A Practical View. In: Rolim, J. (eds) Parallel and Distributed Processing. IPDPS 2000. Lecture Notes in Computer Science, vol 1800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45591-4_141

Download citation

  • DOI: https://doi.org/10.1007/3-540-45591-4_141

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45591-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics