Author(s) Defining Datalog in Rewriting Logic ⋆
Uloženo v:
| Název: | Author(s) Defining Datalog in Rewriting Logic ⋆ |
|---|---|
| Autoři: | Author(s) M. Alpuente, M. A. Feliu, C. Joubert, A. Villanueva, M. Alpuente, M. A. Feliú |
| Přispěvatelé: | The Pennsylvania State University CiteSeerX Archives |
| Zdroj: | http://www.dsic.upv.es/~joubert/publications/Alpuente-Feliu-Joubert-Villanueva-09-d.pdf. |
| Rok vydání: | 2009 |
| Sbírka: | CiteSeerX |
| Témata: | Datalog, rewriting logic, Maude, JAVA program analysis V o B o |
| Popis: | In recent work, the effectiveness of using declarative languages has been demonstrated for many problems in program analysis. Using a simple relational query language, like Datalog, complex interprocedural analyses involving dynamically created objects can be expressed in just a few lines. By exploiting the power of the Rewriting Logic language Maude, we aim at transforming Datalog programs into efficient rewrite systems that compute the same answers. A prototype has been implemented and applied to some real-world Datalog-based analyses. Experimental results show that the performance of solving Datalog queries in rewriting logic is comparable to state-of-the-art Datalog solvers. 1 |
| Druh dokumentu: | text |
| Popis souboru: | application/pdf |
| Jazyk: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.7050 |
| Dostupnost: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.7050 http://www.dsic.upv.es/~joubert/publications/Alpuente-Feliu-Joubert-Villanueva-09-d.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Přístupové číslo: | edsbas.72FE83E |
| Databáze: | BASE |
Nájsť tento článok vo Web of Science | Abstrakt: | In recent work, the effectiveness of using declarative languages has been demonstrated for many problems in program analysis. Using a simple relational query language, like Datalog, complex interprocedural analyses involving dynamically created objects can be expressed in just a few lines. By exploiting the power of the Rewriting Logic language Maude, we aim at transforming Datalog programs into efficient rewrite systems that compute the same answers. A prototype has been implemented and applied to some real-world Datalog-based analyses. Experimental results show that the performance of solving Datalog queries in rewriting logic is comparable to state-of-the-art Datalog solvers. 1 |
|---|