Computing Minimal Separating DFAs and Regular Invariants Using SAT and SMT Solvers

DOI10.1007/978-3-642-33386-6_28zbMath1374.68264OpenAlexW21416174MaRDI QIDQ4649308

Daniel Neider

Publication date: 21 November 2012

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33386-6_28

Mathematics Subject Classification ID

Integer programming (90C10) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Minimal consistent DFA revisited ⋮ Certifying DFA bounds for recognition and separation ⋮ Privacy-preserving co-synthesis against sensor-actuator eavesdropping intruder ⋮ A sufficient condition to polynomially compute a minimum separating DFA

Uses Software

• InvGen

This page was built for publication: Computing Minimal Separating DFAs and Regular Invariants Using SAT and SMT Solvers