How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Verifying Systems with Infinite but Regular State Spaces
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
An effective decision procedure for linear arithmetic over the integers and reals
ACM Transactions on Computational Logic (TOCL)
Computing Convex Hulls by Automata Iteration
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
LIRA: handling constraints of linear arithmetics over the integers and the reals
CAV'07 Proceedings of the 19th international conference on Computer aided verification
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
The power of hybrid acceleration
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
LEVER: a tool for learning based verification
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
On (Omega-)regular model checking
ACM Transactions on Computational Logic (TOCL)
Computing minimal separating DFAs and regular invariants using SAT and SMT solvers
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
| Hi-index | 0.00 |
Within the context of the verification of infinite-statesystems, "(ω)-Regular model checking" is the name ofa family of techniques in which states are represented by words,sets of states by finite automata on these objects, and transitionsby finite automata operating on pairs of state encodings, i.e.finite-state transducers. If the states are encoded by finitewords, then sets of (pairs of) states can be represented byfinite-word automata. This setting can be used to represent variousclasses of infinite-state systems, [17], including parametricsystems, FIFO-queue systems, and systems manipulating integervariables (those defined in Presburger arithmetic). When the statesare encoded by infinite words, sets of (pairs of) states arerepresented by deterministic weak Büchi automata. This settingis mainly used to represent systems involving both integer and realvariables [4,6], such as linear hybrid systems with a constantderivative.