Skip to main content
SpringerLink
Log in

Zum Nutzen sequentieller Kontrollabstraktionen

  • Conference paper
Informatik ’97 Informatik als Innovationsmotor

Part of the book series: Informatik aktuell ((INFORMAT))

  • 170 Accesses

Zusammenfassung

Der Begriff „Kontrollabstraktion“ wurde von Crowl and LeBlanc [2] eingeführt als „der Prozess, durch den Programmierer neue Kontrollkonstrukte einführen, indem sie — losgelöst von einer Implementierung — Anforderungen an die Ausführungsreihenfolge von Anweisungen spezifizieren“. Mit „Ausführungsreihenfolge“ ist dabei vor allem die Möglichkeit der Parallelausführung gemeint. Crowl and LeBlanc entwerfen eine Notation für parallele Kontrollabstraktionen and weisen deren Nützlichkeit an vielen Beispielen nach.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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.

Literatur

  1. K. M. Chandy, J. Misra. Parallel Program Design: A Foundation. AddisonWesley, 1988.

    Google Scholar 

  2. L. A. Crowl, T. J. LeBlanc. Parallel Programming with Control Abstraction. ACM Trans. Program. Lang. Syst. 16, 3, Mai 1994.

    Google Scholar 

  3. E. W. Dijkstra. Guarded commands, nondeterminacy, and formal derivation of programs. Comm. ACM 18, 8, Aug. 1975.

    Article  MathSciNet  Google Scholar 

  4. E. W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976.

    MATH  Google Scholar 

  5. S. Heilbrunner, L. Schmitz. For Statements with Restricted Enumerations. In: M. Paul, B. Robinet (eds.): International Symposium on Programming, LNCS 167, Springer, 1984.

    Google Scholar 

  6. C. A. R. Hoare. A note on the for statement. Bit 12, 1972, pp. 334 - 341.

    Article  MATH  Google Scholar 

  7. B. Liskov, J. Guttag. Abstraction and Specification in Program Development. MIT Press/McGraw-Hill, 1986.

    Google Scholar 

  8. B. Meyer. Design by Contract. In: D. Mandrioli, B. Meyer (eds.): Advances in Object-Oriented Software Engineering. Prentice-Hall, 1991.

    Google Scholar 

  9. D. L. Parnas. A Technique for Software Module Specification with Examples. Comm. ACM 15, 5, Mai 1972.

    Google Scholar 

  10. L. Schmitz. An Improved Transitive Closure Algorithm. Computing 30, 1983, pp. 359 - 371.

    Article  MathSciNet  MATH  Google Scholar 

  11. L. Schmitz. Using Inheritance to Explore a Family of Algorithms. Struct. Programming 13, 1992, pp. 55 - 64.

    Google Scholar 

  12. L. Schmitz. Rigorous Program Development with Control Abstractions: A Case Study. Univ. Bw. Munchen, Bericht 9602, Mai 1996.

    Google Scholar 

  13. M. Shaw, W. Wulf, R. L. London. Abstraction and verification in Alphard: defining and specifying iteration and generators. Comm. ACM 20, 8, Aug. 1977.

    Article  Google Scholar 

  14. R. E. Tarjan. Depth-first Search and Linear Graph Algorithms. SIAM J. Comput. 1, 2, Juni 1972.

    Article  MathSciNet  Google Scholar 

  15. H. S. Warren. A modification of Warshall’s algorithm for the transitive closure of binary relations. Comm. ACM 18, 4, April 1975.

    Article  MathSciNet  Google Scholar 

  16. S. Warshall. A theorem on Boolean matrices. J. ACM 9, 1, Jan. 1962.

    Google Scholar 

Download references

Authors
  1. Lothar Schmitz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. U. Dresden
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Lehrstuhl für Informatik V, RWTH Aachen, D-52056, Aachen, Germany

    Matthias Jarke  & Klaus Pohl  & 

  2. Philips GmbH Forschungslaboratorien, Weißhausstr. 2, D-52066, Aachen, Germany

    Klaus Pasedach

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schmitz, L., Dresden, T.U. (1997). Zum Nutzen sequentieller Kontrollabstraktionen. In: Jarke, M., Pasedach, K., Pohl, K. (eds) Informatik ’97 Informatik als Innovationsmotor. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60831-5_72

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-60831-5_72

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63066-1

  • Online ISBN: 978-3-642-60831-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation