Using term rewriting to solve Bit-vector arithmetic problems (Poster Presentation)
Among many theories supported by SMT solvers, the theory of finite-precision bit-vector arithmetic is one of the most useful, for both hardware and software systems verification. This theory is also particularly useful for some specific domains such as cryptography, in which algorithms are naturally...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | conferencePaper |
| Idioma: | eng |
| Publicado em: |
2012
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/24676 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/24676 |