Skip to main content

Characteristics of Proof Tasks

  • Chapter
  • 187 Accesses

Abstract

In this chapter, we will have a close look at the essential characteristics of the proof obligations which arise from the application and which are supposed to be processed by an automated inference system. These characteristics can be classified into different categories: syntactic- and size-related issues, logic-related issues and validity, and system-related issues.

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 EPUB and 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
Hardcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Schumann, J.M. (2001). Characteristics of Proof Tasks. In: Automated Theorem Proving in Software Engineering. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-22646-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-22646-9_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-08759-2

  • Online ISBN: 978-3-662-22646-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics