Sciweavers

367 search results - page 44 / 74
» A Rewriting Logic Sampler
Sort
View
ICLP
2005
Springer
14 years 1 months ago
Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
Manh Thang Nguyen, Danny De Schreye
ACSAC
2004
IEEE
13 years 11 months ago
Detecting Attacks That Exploit Application-Logic Errors Through Application-Level Auditing
Host security is achieved by securing both the operating system kernel and the privileged applications that run on top of it. Application-level bugs are more frequent than kernel-...
Jingyu Zhou, Giovanni Vigna
AGP
1997
IEEE
14 years 4 days ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...
CSL
2007
Springer
14 years 2 months ago
Unbounded Proof-Length Speed-Up in Deduction Modulo
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
Guillaume Burel
BNCOD
2007
137views Database» more  BNCOD 2007»
13 years 9 months ago
Isolating Order Semantics in Order-Sensitive XQuery-to-SQL Translation
Order is essential for XML query processing. Efficient XML processing with order consideration over relational storage is non-trivial, especially for complex nested XQuery expressi...
Song Wang, Ling Wang, Elke A. Rundensteiner