Skip to main navigation Skip to search Skip to main content

Weakly Acyclic Diagrams: A Data Structure for Infinite-State Symbolic Verification

  • Michael Blondin
  • , Michaël Cadilhac
  • , Xin Yi Cui
  • , Philipp Czerner
  • , Javier Esparza
  • , Jakob Schulz
  • Université de Sherbrooke
  • Technische Universität München

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original languageEnglish
Title of host publicationTools and Algorithms for the Construction and Analysis of Systems - 31st International Conference, TACAS 2025, Held as Part of the International Joint Conferences on Theory and Practice of Software, ETAPS 2025, Proceedings
EditorsArie Gurfinkel, Marijn Heule
PublisherSpringer Science and Business Media Deutschland GmbH
Pages23-42
Number of pages20
ISBN (Print)9783031906596
DOIs
StatePublished - 2025
Event31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2025, which was held as part of the International Joint Conferences on Theory and Practice of Software, ETAPS 2025 - Hamilton, Canada
Duration: May 3 2025 → May 8 2025

Publication series

NameLecture Notes in Computer Science
Volume15698 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2025, which was held as part of the International Joint Conferences on Theory and Practice of Software, ETAPS 2025
Country/TerritoryCanada
CityHamilton
Period5/3/25 → 5/8/25

ASJC Scopus Subject Areas

  • Theoretical Computer Science
  • General Computer Science

Keywords

  • binary decision diagrams
  • partially ordered automata
  • weakly acyclic languages
  • well-structured transition systems

Cite this