Automated Theorem Proving in Software Engineering

  • Johann M. Schumann

Table of contents

  1. Front Matter
    Pages I-XIV
  2. Johann M. Schumann
    Pages 1-9
  3. Johann M. Schumann
    Pages 11-22
  4. Johann M. Schumann
    Pages 23-41
  5. Johann M. Schumann
    Pages 43-70
  6. Johann M. Schumann
    Pages 71-98
  7. Johann M. Schumann
    Pages 99-136
  8. Johann M. Schumann
    Pages 137-196
  9. Johann M. Schumann
    Pages 197-202
  10. Back Matter
    Pages 203-228

About this book


The growing demand for high quality, safety, and security of software systems can only be met by rigorous application of formal methods during software design. Tools for formal methods in general, however, do not provide a sufficient level of automatic processing. This book methodically investigates the potential of first-order logic automated theorem provers for applications in software engineering.
Illustrated by complete case studies on verification of communication and security protocols and logic-based component reuse, the book characterizes proof tasks to allow an assessment of the provers capabilities. Necessary techniques and extensions, e.g., for handling inductive and modal proof tasks, or for controlling the prover, are covered in detail.
The book demonstrates that state-of-the-art automated theorem provers are capable of automatically handling important tasks during the development of high-quality software and it provides many helpful techniques for increasing practical usability of the automated theorem prover for successful applications.


Automated Theorem Proving Extension Formal Methods Processing Software Engineering Software Reuse Software Verification architecture design logic proving security theorem proving verification

Authors and affiliations

  • Johann M. Schumann
    • 1
  1. 1.Automated Software EngineeringRIACS / NASA Ames Research CenterMoffett FieldUSA

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-642-08759-2
  • Online ISBN 978-3-662-22646-9
  • Buy this book on publisher's site