LARA

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision Both sides next revision
sav08:verification_as_science [2010/02/22 10:41]
vkuncak
sav08:verification_as_science [2010/02/22 10:42]
vkuncak
Line 44: Line 44:
   * hardware systems are often finite state (but still very large), memory in software is practically unbounded (e.g. linked data structures)   * hardware systems are often finite state (but still very large), memory in software is practically unbounded (e.g. linked data structures)
   * automated hardware verification is more successful than SAV, so there is a lot of space for future research   * automated hardware verification is more successful than SAV, so there is a lot of space for future research
-  * in embedded systems we need to analyzer ​software, hardware, and the environment (physics, biology); many of our techniques still apply to such systems+  * in embedded systems we need to analyze ​software, hardware, and the environment (physics, biology); many of our techniques ​are still useful (even if not sufficient) for such systems