Skip to main content
Log in

Testing LTL formula translation into Büchi automata

  • Special section on SPIN
  • Published:
International Journal on Software Tools for Technology Transfer Aims and scope Submit manuscript

Abstract.

Model checkers are often used to verify critical systems, and thus a lot of effort should be put on ensuring their reliability. We describe techniques for testing linear temporal logic (LTL) model checker implementations, focusing especially on LTL-to-Büchi automata translation. We propose a randomized testing approach based on the cross-comparison of independent translator implementations, and present methods for test failure analysis. We give experimental results using an automated tool implementing the testing methodology. This method has helped to detect errors in model checking tools such as Spin. We also propose extending LTL model checkers with a simple counterexample validation algorithm.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Published online: 2 October 2002

RID="*"

ID="*"The financial support of Academy of Finland (Projects 43963 and 47754) and the Tekniikan Edistämissäätiö Foundation is gratefully acknowledged.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tauriainen, H., Heljanko, K. Testing LTL formula translation into Büchi automata. STTT 4, 57–70 (2002). https://doi.org/10.1007/s100090200070

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s100090200070