Skip to main content

A Look at the Source Code of Herby

  • Chapter
Automated Theorem Proving
  • 291 Accesses

Abstract

This chapter introduces you to the source code of HERBY. Section 11.1 briefly describes the source files. Section 11.2, and, in particular, Figure 11.1, describe how the functions in these files are linked. A brief description of the main functions in HERBY is presented in Section 11.3. HERBY represents a theorem at the machine code level as described in Section 11.4. Major array in HERBY are described in Section 11.5.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Science+Business Media New York

About this chapter

Cite this chapter

Newborn, M. (2001). A Look at the Source Code of Herby. In: Automated Theorem Proving. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-0089-2_11

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-0089-2_11

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-6519-1

  • Online ISBN: 978-1-4613-0089-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics