367 search results - page 44 / 74 » A Rewriting Logic Sampler |
109
Voted
ICLP
2005
Springer
15 years 6 months ago
2005
Springer
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...
106
Voted
ACSAC
2004
IEEE
15 years 4 months ago
2004
IEEE
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-...
113
click to vote
AGP
1997
IEEE
15 years 4 months ago
1997
IEEE
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
103
Voted
CSL
2007
Springer
15 years 6 months ago
2007
Springer
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 ...
134
Voted
BNCOD
2007
15 years 1 months ago
2007
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...