Skip to main content
Springer Nature Link
Log in

Validation und Verifikation von Software durch symbolische Ausführung

  • Conference paper
Testen, Analysieren und Verifizieren von Software

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

Zusammenfassung

Die Grundidee der symbolischen Ausführung ist es, ein Programm auszuführen, ohne Werte für die Eingabevariablen anzugeben. Auf diese Weise erhält man ein Verfahren zur Validation und Verifikation von Programmen, das zwischen formalem Korrektheitsbeweis und Testen liegt.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
€32.70 /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
EUR 29.95
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 42.99
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 54.22
Price includes VAT (France)
  • 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.

Similar content being viewed by others

Literatur

  1. R.M. Balzer, N.M. Goldman, und D.S. Wile. Operational specification as the basis for rapid prototyping. ACM Sigsoft Software Engineering Notes, 7(5):3–16, 1982.

    Article  Google Scholar 

  2. R.M. Burstall. Program proving as hand simulation with a little induction. In Information Processing ’74. North-Holland Pubi. Co., 1974.

    Google Scholar 

  3. D. Coleman und J.W. Hughes. The clean termination of Pascal programs. Acta Informatica, 11: 195–210, 1979.

    Article  MATH  Google Scholar 

  4. Donald. Cohen. Symbolic execution of the GIST specification language. In Proc. 8th Int. Joint Conference on Artificial Intelligence ’83 (IJCAI-83%) S. 17–21, 1983.

    Google Scholar 

  5. Lori A. Clarke und Debra J. Richardson. Symbolic evaluation — an aid to testing and verification. In Hans-Ludwig Hausen, Editor, Software Validation, S. 141–166. North-Holland, 1984.

    Google Scholar 

  6. D. Cohen, W. Swartout, und R. Balzer. Using symbolic execution to characterize behavior. ACM Sigsoft Software Engineering Notes, 7(5):25–32, Dezember 1982.

    Article  Google Scholar 

  7. Martin Davis. Hilbert’s tenth problem is unsolvable. American Mathematical Monthly, 80: 233–269, 1973.

    Article  MATH  MathSciNet  Google Scholar 

  8. Laura K. Dillon. Using symbolic execution for verification of Ada tasking programs. ACM Transactions on Programming Languages and Systems, 12: 643–669, 1990.

    Article  Google Scholar 

  9. Sidney L. Hantier und James C. King. An introduction to proving the correctness of programs. ACM Computing Surveys, 8(3):331–353, September 1976.

    Article  MATH  Google Scholar 

  10. William E. Howden. An evaluation of the effectiveness of symbolic testing. Software — Practice and Experience, 8: 381–397, 1978.

    Article  MATH  Google Scholar 

  11. C.B. Jones, K.D. Jones, P.A. Lindsay, und R.C. Moore, mural — A Formal Development Support System. Springer-Verlag, 1991. With contributions from J. Bicarregui, M. Elvang-Goransson, R. Fields, R. Kneuper, B. Ritchie, A.C. Wills.

    MATH  Google Scholar 

  12. Ralf Kneuper. Symbolic execution: a semantic approach. Science of Computer Programming, 16: 207–249, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  13. Peter Liggesmeyer. Modultest und Modulverifikation. State of the Art. BI Wissenschaftsverlag, 1990.

    MATH  Google Scholar 

  14. Andreas Spillner. Aufdeckung von Codesequenzen, die nach Integration dynamisch nicht mehr erreichbar sind. Software-Technik Trends, 6(l):25–29, Juni 1986.

    Google Scholar 

  15. William R. Swartout. The GIST behavior explainer. Research report ISI/RS-83–3, USC/Information Sciences Institute, Juli 1983.

    Google Scholar 

  16. Pamela Zave. The operational versus the conventional approach to software development. Communications of the ACM, 27(2):104–118, Februar 1984.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wilhelm-Leuschner-Straße 2, 6100, Darmstadt, Germany

    Ralf Kneuper

Authors
  1. Ralf Kneuper
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Lehrstuhl für Software-Technik, Fakultät für Elektrotechnik, Ruhr-Universität Bochum, Postfach 102 148, W-4630, Bochum 1, Deutschland

    Peter Liggesmeyer

  2. SES-Software-Engineering Service GmbH, Rosenheimer Landstraße 37, W-8012, Ottobrunn, Deutschland

    Harry M. Sneed

  3. Fachbereich Mathematik/Informatik, Universität Bremen, Postfach 330 440, W-2800, Bremen 33, Deutschland

    Andreas Spillner

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kneuper, R. (1992). Validation und Verifikation von Software durch symbolische Ausführung. In: Liggesmeyer, P., Sneed, H.M., Spillner, A. (eds) Testen, Analysieren und Verifizieren von Software. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-77747-9_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-77747-9_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55860-6

  • Online ISBN: 978-3-642-77747-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation