Computing inductive invariants of regular abstraction frameworks

DOI10.4230/LIPICS.CONCUR.2024.19MaRDI QIDQ6859935zbMATH OpenFDO

Authors Philipp Czerner, Javier Esparza, Valentin Krasotin, Christoph Welzel-Mohr

Publication date 10 February 2026

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

abstractionregular model checkinginductive invariants

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• scientific article; zbMATH DE number 1670791 (Why is no real title available?)
• scientific article; zbMATH DE number 1927558 (Why is no real title available?)
• scientific article; zbMATH DE number 1538041 (Why is no real title available?)
• scientific article; zbMATH DE number 1796140 (Why is no real title available?)
• Automata theory. An algorithmic approach
• CONCUR 2004 - Concurrency Theory
• Computer Aided Verification
• Decision procedures. An algorithmic point of view
• Iterating transducers in the large (extended abstract)
• Learning regular sets from queries and counterexamples
• Model checking parameterized systems
• Regular model checking upside-down: an invariant-based approach
• Regular model checking: evolution and perspectives
• Satisfiability modulo theories
• Symbolic model checking with rich assertional languages
• The octagon abstract domain

This page was built for publication: Computing inductive invariants of regular abstraction frameworks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859935)