skip to main content
10.1145/2635868.2661669acmconferencesArticle/Chapter ViewAbstractPublication PagesfseConference Proceedingsconference-collections
research-article

Aalta: an LTL satisfiability checker over Infinite/Finite traces

Published: 11 November 2014 Publication History

Abstract

Linear Temporal Logic (LTL) is been widely used nowadays in verification and AI. Checking satisfiability of LTL formulas is a fundamental step in removing possible errors in LTL assertions. We present in this paper Aalta, a new LTL satisfiability checker, which supports satisfiability checking for LTL over both infinite and finite traces. Aalta leverages the power of modern SAT solvers. We have conducted a comprehensive comparison between Aalta and other LTL satisfiability checkers, and the experimental results show that Aalta is very competitive. The tool is available at www.lab205.org/aalta.

References

[1]
A. Cimatti, E.M. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani, and A. Tacchella. Nusmv 2: An opensource tool for symbolic model checking. In Computer Aided Verification, pages 359–364. Springer, 2002.
[2]
G. De Giacomo and M.Y. Vardi. Automata-theoretic approach to planning for temporally extended goals. In Proc. European Conf. on Planning, pages 226–238. Springer, 1999.
[3]
G. De Giacomo and M. Y. Vardi. Linear temporal logic and linear dynamic logic on finite traces. In Proceedings of the 24th International Joint Conference on Artificial Intelligence, IJCAI’13, pages 2000–2007. AAAI Press, 2013.
[4]
J. Li, G. Pu, L. Zhang, M. Y. Vardi, and J. He. Polsat: A portfolio ltl satisfiability solver. CoRR, abs/1311.1602, 2013.
[5]
J. Li, L. Zhang, G. Pu, M. Y. Vardi, and J. He. LTL satisfibility checking revisited. In The 20th International Symposium on Temporal Representation and Reasoning, pages 91–98, 2013.
[6]
J. Li, G. Pu, L. Zhang, M. Y. Vardi, and J. He. Fast LTL Satisfiability Checking by SAT Solvers. CoRR, abs/1401.5677, 2014.
[7]
J. Li, L. Zhang, G. Pu, M. Y. Vardi, and J. He. LT L f satisfibility checking. In The 21th European Conference on Artificial Intelligence, pages 91–96, 2014.
[8]
A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symp. on Foundations of Computer Science, pages 46–57, 1977.
[9]
K. Y. Rozier and M. Y. Vardi. LTL satisfiability checking. In Int’l J. on Software Tools for Technology Transfer, pages 123–137, 2010.
[10]
V. Schuppan. Towards a notion of unsatisfiable cores for LTL. In Fundamentals of Software Engineering, pages 129–145, 2010.
[11]
S. Schwendimann. A new one-pass tableau calculus for pltl. In Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, pages 277–292. Springer-Verlag, 1998.
[12]
M. Y. Vardi. An automata-theoretic approach to linear temporal logic. In Logics for Concurrency: Structure versus Automata, pages 238–266. Springer, 1996.

Cited By

View all
  • (2024)Learning to Check LTL Satisfiability and to Generate Traces via Differentiable Trace CheckingProceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis10.1145/3650212.3680337(996-1008)Online publication date: 11-Sep-2024
  • (2024)SAT Meets Tableaux for Linear Temporal Logic SatisfiabilityJournal of Automated Reasoning10.1007/s10817-023-09691-168:2Online publication date: 15-Mar-2024
  • (2023)Computing all facts entailed by an LTL specificationProceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning10.24963/kr.2023/66(679-689)Online publication date: 2-Sep-2023
  • Show More Cited By

Index Terms

  1. Aalta: an LTL satisfiability checker over Infinite/Finite traces

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      FSE 2014: Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering
      November 2014
      856 pages
      ISBN:9781450330565
      DOI:10.1145/2635868
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 11 November 2014

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. Model Checking
      2. Satisfiability
      3. Temporal Logic

      Qualifiers

      • Research-article

      Conference

      SIGSOFT/FSE'14
      Sponsor:

      Acceptance Rates

      Overall Acceptance Rate 17 of 128 submissions, 13%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)19
      • Downloads (Last 6 weeks)1
      Reflects downloads up to 17 Feb 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2024)Learning to Check LTL Satisfiability and to Generate Traces via Differentiable Trace CheckingProceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis10.1145/3650212.3680337(996-1008)Online publication date: 11-Sep-2024
      • (2024)SAT Meets Tableaux for Linear Temporal Logic SatisfiabilityJournal of Automated Reasoning10.1007/s10817-023-09691-168:2Online publication date: 15-Mar-2024
      • (2023)Computing all facts entailed by an LTL specificationProceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning10.24963/kr.2023/66(679-689)Online publication date: 2-Sep-2023
      • (2023)Checking LTL Satisfiability via End-to-end Learning37th IEEE/ACM International Conference on Automated Software Engineering10.1145/3551349.3561163(1-13)Online publication date: 5-Jan-2023
      • (2023)SAT-Verifiable LTL Satisfiability Checking via Graph Representation Learning2023 38th IEEE/ACM International Conference on Automated Software Engineering (ASE)10.1109/ASE56229.2023.00173(1761-1765)Online publication date: 11-Sep-2023
      • (2023)Temporal Logics for Linear and Branching Time and Model CheckingLogic: Reference Book for Computer Scientists10.1007/978-3-031-42034-4_5(231-280)Online publication date: 4-Oct-2023
      • (2022)Finite Quantified Linear Temporal Logic and Its Satisfiability CheckingArtificial Intelligence Logic and Applications10.1007/978-981-19-7510-3_1(3-18)Online publication date: 10-Dec-2022
      • (2020)SAT-Based Automata Construction for LTL over Finite Traces2020 27th Asia-Pacific Software Engineering Conference (APSEC)10.1109/APSEC51365.2020.00008(1-10)Online publication date: Dec-2020
      • (2020)Theorem Proving for Pointwise Metric Temporal Logic Over the Naturals via TranslationsJournal of Automated Reasoning10.1007/s10817-020-09541-4Online publication date: 19-Feb-2020
      • (2019)Automata based test generation with SpecProProceedings of the 6th International Workshop on Requirements Engineering and Testing10.1109/RET.2019.00010(13-16)Online publication date: 28-May-2019
      • Show More Cited By

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media