Skip to main content
SpringerLink
Log in

Die Korrektheit von Algorithmen

oder wie man es richtig macht

  • Chapter
Algorithmik

  • 2123 Accesses

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 34.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 49.99
Price excludes VAT (USA)
  • Durable hardcover 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.

Kapitel 5

  1. Z. Manna, Mathematical Theory of Computation, McGraw-Hill, 1974.

    Google Scholar 

  2. S. Alagić und M. A. Arbib, The Design of Well-Structured and Correct Programs, Springer-Verlag, 1978.

    Google Scholar 

  3. J. W. de Bakker, Mathematical Theory of Program Correctness, Prentice-Hall International, 1980.

    Google Scholar 

  4. J. Loeckx und K. Sieber, The Foundations of Program Verification, 2. Auflage, John Wiley & Sons, 1987.

    Google Scholar 

  5. N. Francez, Program Verification, Addison-Wesley, 1991.

    Google Scholar 

  6. K. R. Apt und E.-R. Olderog, Verification of Sequential and Concurrent Programs, Springer-Verlag, 1991.

    Google Scholar 

  7. Z. Manna und A. Pnueli, Temporal Verification of Reactive Systems: Safety, Springer-Verlag, 1995.

    Google Scholar 

  8. E. M. Clarke, O. Grumberg und D. A. Peled, Model Checking, MIT Press, 2000.

    Google Scholar 

  9. R. Bird, Programs and Machines: An Introduction to the Theory of Computation, John Wiley & Sons, 1976.

    Google Scholar 

  10. J. M. Brady, The Theory of Computer Science: A Programming Approach, Chapman & Hall, 1977.

    Google Scholar 

  11. S.A. Greibach, Theory of Program Structures: Schemes, Semantics, Verification, Springer-Verlag, 1975.

    Google Scholar 

  12. E. V. Krishnamurthy, Introductory Theory of Computer Science, Springer-Verlag, 1983.

    Google Scholar 

  13. ACM Transactions on Programming Languages and Systems, mitunter abgekürzt als ACM Trans. Prog. Lang. Syst. oder einfach TOPLAS; herausgegeben von der ACM.

    Google Scholar 

  14. Acta Informatica, abgekürzt als Ada Inf.; herausgegeben vom Springer-Verlag.

    Google Scholar 

  15. Science of Computer Programming, abgekürzt als Sci. Comput. Prog; herausgegeben von Elsevier.

    Google Scholar 

  16. Journal of Automated Reasoning, abgekürzt als /. Autom. Reas.; herausgegeben von Kluwer Academic Publishers.

    Google Scholar 

  17. IEEE Transactions on Software Engineering, abgekürzt als IEEE Trans. Soft. Eng.; herausgegeben von der IEEE.

    Google Scholar 

  18. Formal Aspects of Computing, abgekürzt als Form. Aspects Comput.; herausgegebenvom Springer-Verlag.

    Google Scholar 

  19. Software and System Modeling, abgekürzt als Soft. Syst. Modeling oder einfach SoSyM; herausgegeben vom Springer-Verlag.

    Google Scholar 

  20. ACM Software Engineering Notes; herausgegeben von der Interessengruppe fur Soft-waretechnik der ACM.

    Google Scholar 

  21. A. V. Aho, R. Sethi und J. D. Ullman, Compilers: Principles, Techniques, and Tools, Addison-Wesley, 1986.

    Google Scholar 

  22. R. Allen, K. Kennedy und J. R. Allen, Optimizing Compilers for Modern Architectures: A Dependence-Based Approach, Morgan Kaufrnann, 2001.

    Google Scholar 

  23. S. S. Muchnick, Advanced Compiler Design and Implementation, Morgan Kaufrnann, 1997.

    Google Scholar 

  24. C. Kaner, J. Falk und H. Q. Nguyen, Testing Computer Software, 2. Auflage, John Wiley & Sons, 1999.

    Google Scholar 

  25. B. Hetzel, The Complete Guide to Software Testing, 2. Auflage, John Wiley & Sons, 1993.

    Google Scholar 

  26. R. V. Binder, Testing Object-Oriented Systems: Models, Patterns, and Tools, Addison-Wesley, 1999.

    Google Scholar 

  27. B. Marick, The Craft of Software Testing: Subsystem Testing, Including Object-Based and Object-Oriented Testing, Prentice-Hall, 1994.

    Google Scholar 

  28. G. J. Myers, The Art of Software Testing, John Wiley & Sons, 1979.

    Google Scholar 

  29. G. D. Bergland, „A Guided Tour of Program Design Methodologies,“ Computer 14 (1981), s. 13–37.

    Google Scholar 

  30. E. W. Dijkstra, „Notes on Structured Programming,“ in Structured Programming, Academic Press, 1972.

    Google Scholar 

  31. Z. Manna, „The Correctness of Programs,“ J. Comput. Syst. Sci. 3 (1969), S. 119–27.

    MATH  MathSciNet  Google Scholar 

  32. D. L. Parnas, „Software Aspects of Strategic Defense Systems,“ Comm. Assoc. Comput. Mack 28 (1985), S. 1326–35.

    Google Scholar 

  33. R. A. De Millo, R. J. Lipton und A. J. Perlis, „Social Processes and Proofs of Theorems and Programs,“ Comm. Assoc. Comput. Mach. 22 (1979), S. 271–80.

    Google Scholar 

  34. J. H. Fetzer, „Program Verification: The Very Idea,“ Comm. Assoc. Comput. Mach. 31 (1988), S. 1048–63.

    Google Scholar 

  35. R. W. Floyd, „Assigning Meanings to Programs,“ Proc. Symp. on Applied Math. (Vol. 19: „Mathematical Aspects of Computer Science“), American Math. Soc, Providence, RI, S. 19–32, 1967.

    Google Scholar 

  36. C. A. R. Hoare, „An Axiomatic Basis for Computer Programming,“ Comm. Assoc. Comput. Mach. 12 (1969), S. 576–83.

    MATH  Google Scholar 

  37. S. Cook, „Soundness and Completeness of an Axiom System for Program Verification,“ SIAMJ. Comput. 7 (1978), S. 70–90.

    Article  MATH  Google Scholar 

  38. E. M. Clarke, „Programming Language Constructs for which it is Impossible to Obtain Good Hoare-Like Axioms,“ J. Assoc. Comput. Mach. 26 (1979), S. 129–47.

    MATH  MathSciNet  Google Scholar 

  39. K. R. Apt, „Ten Years of Hoare’s Logic: A Survey,“ ACM Trans. Prog. Lang. Syst. 3 (1981), S. 431–83.

    Article  MATH  Google Scholar 

  40. P. Cousot, „Methods and Logics for Proving Programs,“ in Handbook of Theoretical Computer Science, Vol. B, J. van Leeuwen, Hrsg., Elsevier und MIT Press, 1990, S. 841–993.

    Google Scholar 

  41. A. Shamir, „Finding Minimum Cutsets in Reducible Graphs,“ SIAM J. Comput. 8 (1979), S. 645–55.

    Article  MATH  MathSciNet  Google Scholar 

  42. D. Harel, „Arithmetical Completeness in Logics of Programs,“ Proc. Int. Colloq. on Automata, Lang. and Prog., Lecture Notes in Computer Science, Vol. 62, Springer-Verlag, S. 268–88, 1978.

    MATH  MathSciNet  Google Scholar 

  43. D. Harel, D. Kozen und J. Tiuryn, Dynamic Logic, MIT Press, 2000.

    Google Scholar 

  44. M. Wand, Induction, Recursion, and Programming, Elsevier Science, 1980.

    Google Scholar 

  45. R. E. Allardice und A. Y. Fraser, „La tour d’Hanoï“ Proc. Edinburgh Math. Soc, 2 (1884), S. 50–3.

    Article  Google Scholar 

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

    Google Scholar 

  47. D. Gries, The Science of Programming, Springer-Verlag, 1981.

    Google Scholar 

  48. J. C. Reynolds, The Craft of Programming, Prentice-Hall International, 1981.

    Google Scholar 

  49. Z. Manna und R. Waldinger, The Deductive Foundations of Computer Programming, Addison-Wesley, 1993.

    Google Scholar 

  50. B. Meyer, Objektorientierte Softwareentwicklung, Hanser Fachbuchverlag, 1990.

    Google Scholar 

  51. R. Mitchell und J. McKim, Design by Contract, by Example, Addison-Wesley, 2002.

    Google Scholar 

  52. R. S. Boyer und J S. Moore, The Computational Logic Handbook, Academic Press, 1997.

    Google Scholar 

  53. R. L. Constable et al., Implementing Mathematics with the Nuprl Proof Development System, Prentice-Hall, 1986.

    Google Scholar 

  54. M. J. Gordon, A. J. R. G. Milner und C. P. Wadsworth, Edinburgh LCF: A Mechanised Logic of Computation, Lecture Notes in Computer Science, Vol. 78, Springer-Verlag, 1979.

    Google Scholar 

  55. K. L. McMillan, Symbolic Model Checking: An Approach to the State Explosion Problem, Kluwer Academic Publishers, 1993.

    Google Scholar 

  56. E. M. Clarke, O. Grumberg und D. A. Peled, Model Checking, MIT Press, 2000.

    Google Scholar 

  57. A. Salwicki,„Formalized Algorithmic Languages,“ Bull. Acad. Polon. Sci, Ser. Sci. Math. Astron. Phys. 18 (1970), S. 227–32.

    Google Scholar 

  58. V. R. Pratt, „Semantical Considerations on Floyd-Hoare Logic,“ Proc. 17th IEEE Symp. on Foundations of Computer Science, IEEE Press, S. 109–21, 1976.

    Google Scholar 

  59. M. J. Fischer und R. E. Ladner, „Propositional Dynamic Logic of Regular Programs,“ J. Comput. Syst. Sci. 18 (1979), S. 194–211.

    Article  MATH  MathSciNet  Google Scholar 

  60. D. Harel, D. Kozen und J. Tiuryn, Dynamic Logic, MIT Press, 2000.

    Google Scholar 

  61. N. Dershowitz, The Evolution of Programs, Birkhauser, 1983.

    Google Scholar 

  62. Z. Manna und R. Waldinger, The Deductive Foundations of Computer Programming, Addison-Wesley, 1993.

    Google Scholar 

  63. J. Darlington und R. M. Burstall, „A System which Automatically Improves Programs,“ Proc. 3rd Int. Conf. on Artificial Intelligence, S. 479–85, 1973.

    Google Scholar 

  64. S. L. Gerhart, „Proof Theory of Partial Correctness Verification Systems,“ SIAM J. Corn-put. 5 (1976), S. 355–77.

    Article  MathSciNet  Google Scholar 

  65. H. Partsch und R. Steinbrüggen, „Program Transformation Systems,“ Comput. Surv. 15 (1983), S. 199–236.

    Article  Google Scholar 

  66. K. I. Appel und W. Haken, „Every Planar Map is Four Colorable,“ Bull. Amer. Math. Soc. 82 (1976), S. 711–12.

    Article  MATH  MathSciNet  Google Scholar 

  67. T. L. Saaty und P. C. Kainen, The Four Color Problem: Assaults and Conquest, Dover, 1986.

    Google Scholar 

Download references

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2006). Die Korrektheit von Algorithmen. In: Algorithmik. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-37437-X_5

Download citation

Publish with us

Policies and ethics

Search

Navigation