1385 search results - page 58 / 277 » Natural Rewriting for General Term Rewriting Systems |
189
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
261
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
156
click to vote
CCS
2005
ACM
15 years 11 months ago
2005
ACM
Current software attacks often build on exploits that subvert machine-code execution. The enforcement of a basic safety property, Control-Flow Integrity (CFI), can prevent such at...
165
click to vote
ACTA
2006
15 years 6 months ago
2006
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...
161
click to vote
POPL
1995
ACM
15 years 9 months ago
1995
ACM
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing s...