Datalog-Based program analysis with BES and RWL
This paper describes two techniques for Datalog query evaluation and their application to object-oriented program analysis. The first technique transforms Datalog programs into an implicit Boolean Equation System (Bes) that can then be solved by using linear-time complexity algorithms that are avail...
| Autores: | , , , |
|---|---|
| Formato: | capítulo de livro |
| Fecha de publicación: | 2011 |
| 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/37650 |
| Acesso em linha: | https://riunet.upv.es/handle/10251/37650 |
| Access Level: | acceso abierto |
| Palavra-chave: | Boolean equation system Model checking Query evaluation Rewriting logic CIENCIAS DE LA COMPUTACION E INTELIGENCIA ARTIFICIAL LENGUAJES Y SISTEMAS INFORMATICOS |
| Resumo: | This paper describes two techniques for Datalog query evaluation and their application to object-oriented program analysis. The first technique transforms Datalog programs into an implicit Boolean Equation System (Bes) that can then be solved by using linear-time complexity algorithms that are available in existing, general purpose verification toolboxes such as Cadp. In order to improve scalability and to enable analyses involving advanced meta-programming features, we develop a second methodology that transforms Datalog programs into rewriting logic (Rwl) theories. This method takes advantage of the preeminent features and facilities that are available within the high-performance system Maude, which provides a very efficient implementation of Rwl. We provide evidence of the practicality of both approaches by reporting on some experiments with a number of real-world Datalog-based analyses. © 2011 Springer-Verlag. |
|---|