Concolic Testing in Logic programming
Software testing is one of the most popular validation techniques in the software industry. Surprisingly, we can only find a few approaches to testing in the context of logic programming. In this paper, we introduce a systematic approach for dynamic testing that combines both concrete and symbolic e...
| Autores: | , , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 2015 |
| País: | España |
| Recursos: | Universitat Politècnica de València (UPV) |
| Repositorio: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Idioma: | inglés |
| OAI Identifier: | oai:riunet.upv.es:10251/61510 |
| Acesso em linha: | https://riunet.upv.es/handle/10251/61510 |
| Access Level: | acceso abierto |
| Palavra-chave: | Symbolic execution Logic programming Testing LENGUAJES Y SISTEMAS INFORMATICOS |
| Resumo: | Software testing is one of the most popular validation techniques in the software industry. Surprisingly, we can only find a few approaches to testing in the context of logic programming. In this paper, we introduce a systematic approach for dynamic testing that combines both concrete and symbolic execution. Our approach is fully automatic and guarantees full path coverage when it terminates. We prove some basic properties of our technique and illustrate its practical usefulness through a prototype implementation. |
|---|