Verification of Boolean programs with unbounded thread creation.
Most symbolic software model checkers use abstraction techniques to reduce the verification of infinite-state programs to that of decidable classes. Boolean programs [T. Ball, S.K. Rajamani, Bebop: A symbolic model checker for Boolean programs, in: SPIN 00, in: Lecture Notes in Computer Science, vol...
| Autors principals: | , , |
|---|---|
| Format: | Journal article |
| Idioma: | English |
| Publicat: |
2007
|