Parameterized verification of infinite-state processes with global conditions
We present a simple and effective approximated backward reachability algorithm for
parameterized systems with existentially and universally quantified global conditions. The …
parameterized systems with existentially and universally quantified global conditions. The …
Systematic acceleration in regular model checking
B Jonsson, M Saksena - … : 19th International Conference, CAV 2007, Berlin …, 2007 - Springer
Regular model checking is a form of symbolic model checking technique for systems whose
states can be represented as finite words over a finite alphabet, where regular sets are used …
states can be represented as finite words over a finite alphabet, where regular sets are used …
[PDF][PDF] Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols (Extended Version)
M Saksena, O Wibling, B Jonsson - 2007 - it.uu.se
We present a technique for modeling and automatic verification of network protocols, based
on graph transformation. It is suitable for protocols with a potentially unbounded number of …
on graph transformation. It is suitable for protocols with a potentially unbounded number of …