Computing inductive invariants of regular abstraction frameworks
From MaRDI portal
Cites work
- A survey of regular model checking
- Abstract regular model checking
- Automata theory. An algorithmic approach
- Decision procedures. An algorithmic point of view
- Iterating transducers
- Iterating transducers in the large (extended abstract)
- Learning regular sets from queries and counterexamples
- Model checking parameterized systems
- Regular model checking
- Regular model checking made simple and efficient
- 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
- Transitive closures of regular relations for verifying infinite-state systems
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)