Abstract
In this note, we illustrate how parameterised Boolean equation systems can be employed for verifying system correctness. Several small examples are used to give a flavour of the more common techniques available for conducting typical verifications in this setting.We finish with a short discussion of the research challenges that lie ahead.
| Original language | English |
|---|---|
| Pages (from-to) | 51-58 |
| Journal | Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica |
| Volume | 2010 |
| Publication status | Published - 2010 |