Skip to main content

About VeriFun

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2741))

Abstract

VeriFun is a semi-automated system for the verification of functional programs. It has been used so far in an industrial IT-security project concerned with electronic payment in public networks as well as for teaching semantics and verification in university courses both at the undergraduate and at the graduate level. On the development it has been attempted to achieve a high degree of automatization, to provide the system with a clear and intuitive user interface, and to care for an transparent mode of operation, as all these features strongly support the work with a system in particular for non-expert users.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. http://www.informatik.tu-darmstadt.de/pm/verifun/

  2. Buchmann, J., Ruppert, M., Tak, M.: FlexiPKI - Realisierung einer flexiblen Public-Key-Infrastruktur. Technical Report TI-22/99, Theoretische Informatik, Technische Universität Darmstadt (2003)

    Google Scholar 

  3. Stephan, W., Vogt, R.: FairPay - Security Engineering für den elektronischen Zahlungsverkehr. In: Jantke, K.P., Wittig, W.S., Herrmann, J. (eds.) Von e-Learning bis e-Payment - Tagungsband LIT 2002, Berlin (2003). Akademische Verlagsgesellschaft

    Google Scholar 

  4. Walther, C., Schweitzer, S.: A Machine Supported Proof of the Unique Prime Factorization Theorem. Technical Report VFR 02/03, Programmiermethodik, Technische Universität Darmstadt (2002)

    Google Scholar 

  5. Walther, C., Schweitzer, S.: The \(\checkmark\)eriFun Tutorial. Technical Report VFR 02/04, Programmiermethodik, Technische Universität Darmstadt (2002)

    Google Scholar 

  6. Walther, C., Schweitzer, S.: \(\checkmark\)eriFun User Guide. Technical Report VFR 02/01, Programmiermethodik, Technische Universität Darmstadt (2002)

    Google Scholar 

  7. Walther, C., Schweitzer, S.: Verification in the Classroom. Technical Report VFR 02/05, Programmiermethodik, Technische Universität Darmstadt (2002)

    Google Scholar 

  8. Walther, C., Schweitzer, S.: A Machine-Verified Code Generator. Technical Report VFR 03/01, Programmiermethodik, Technische Universität Darmstadt (2003)

    Google Scholar 

  9. Walther, C., Schweitzer, S.: A Verification of Binary Search. In: Hutter, D., Stephan, W. (eds.) Mechanizing Mathematical Reasoning: Techniques, Tools and Applications. LNCS (LNAI), vol. 2605, pp. 1–18. Springer, Heidelberg (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Walther, C., Schweitzer, S. (2003). About VeriFun. In: Baader, F. (eds) Automated Deduction – CADE-19. CADE 2003. Lecture Notes in Computer Science(), vol 2741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45085-6_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45085-6_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40559-7

  • Online ISBN: 978-3-540-45085-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics