Skip to main content
SpringerLink
Log in

A While Program Normal Form Theorem in Total Correctness

  • Conference paper
Book cover Relations and Kleene Algebra in Computer Science (RelMiCS 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5827))

Included in the following conference series:

Abstract

A classical while-program normal-form theorem is derived in demonic refinement algebra. In contrast to Kozen’s partial-correctness proof of the theorem in Kleene algebra with tests, the derivation in demonic refinement algebra provides a proof that the theorem holds in total correctness.

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

Access this chapter

Log in via an institution
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. Back, R.J.R., von Wright, J.: Refinement calculus: A systematic introduction. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  2. Böhm, C., Jacopini, G.: Flow diagrams, Turing machines and languages with only two formation rules. Commun. ACM 9(5), 366–371 (1966)

    Article  MATH  Google Scholar 

  3. Cohen, E.: Separation and reduction. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol. 1837, pp. 45–59. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  4. Desharnais, J., Möller, B., Struth, G.: Kleene algebra with domain. ACM Trans. Comput. Log. 7(4), 798–833 (2006)

    MathSciNet  Google Scholar 

  5. Dijkstra, E.W.: A discipline of programming. Prentice-Hall International, Englewood Cliffs (1976)

    MATH  Google Scholar 

  6. Harel, D.: On folk theorems. Commun. ACM 23(7), 379–389 (1980)

    Article  MATH  Google Scholar 

  7. Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Inf. Comput. 110(2), 366–390 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  8. Kozen, D.: Kleene algebra with tests. ACM Trans. Prog. Lang. Syst. 19(3), 427–443 (1997)

    Article  Google Scholar 

  9. Mirkowska, G.: Algorithmic logic and its applications. PhD thesis. Univ. of Warsaw, Warsaw, Poland (1972) (in Polish)

    Google Scholar 

  10. von Wright, J.: From Kleene algebra to refinement algebra. In: Boiten, E.A., Möller, B. (eds.) MPC 2002. LNCS, vol. 2386, pp. 233–262. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. von Wright, J.: Towards a refinement algebra. Science of Computer Programming 51, 23–45 (2004)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Uppsala Universitet, Uppsala, Sweden

    Kim Solin

Authors
  1. Kim Solin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Olshausenstraße 40, 24098, Kiel, Germany

    Rudolf Berghammer

  2. College of Engineering, Qatar University, P.O. Box 2713, CSE 209, Doha, Qatar,  

    Ali Mohamed Jaoua

  3. Institut für Informatik, Universität Augsburg, Universitätsstr. 6a, 86135, Augsburg, Germany

    Bernhard Möller

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Solin, K. (2009). A While Program Normal Form Theorem in Total Correctness. In: Berghammer, R., Jaoua, A.M., Möller, B. (eds) Relations and Kleene Algebra in Computer Science. RelMiCS 2009. Lecture Notes in Computer Science, vol 5827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04639-1_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04639-1_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04638-4

  • Online ISBN: 978-3-642-04639-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation