Abstract

We present an overview of results on verification of temporal properties of infinite-state transition systems arising from processes that carry and manipulate unbounded data. The techniques bring into play tools from logic, database theory, and model checking. The theoretical results establish the boundaries of decidability and the complexity of verification for various models. We also describe verifier implementations with surprisingly good performance, suggesting that this line of research has real potential for practical impact.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call