Sciweavers

118 search results - page 4 / 24
» An Account of Implementing Applicative Term Rewriting
Sort
View
POPL
2006
ACM
14 years 7 months ago
The essence of command injection attacks in web applications
Web applications typically interact with a back-end database to retrieve persistent data and then present the data to the user as dynamically generated output, such as HTML web pa...
Zhendong Su, Gary Wassermann
ENTCS
2007
123views more  ENTCS 2007»
13 years 7 months ago
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
Beatriz Alarcón, Raúl Gutiérr...
CAV
2012
Springer
270views Hardware» more  CAV 2012»
11 years 10 months ago
Automated Termination Proofs for Java Programs with Cyclic Data
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...
Marc Brockschmidt, Richard Musiol, Carsten Otto, J...
VLDB
1998
ACM
141views Database» more  VLDB 1998»
13 years 11 months ago
Bulk-Loading Techniques for Object Databases and an Application to Relational Data
We present a framework for designing, in a declarative and flexible way, efficient migration programs and an undergoing implementation of a migration tool called RelOO whose targe...
Sihem Amer-Yahia, Sophie Cluet, Claude Delobel
IPPS
2006
IEEE
14 years 1 months ago
Algorithmic skeletons for stream programming in embedded heterogeneous parallel image processing applications
Algorithmic skeletons can be used to write architecture independent programs, shielding application developers from the details of a parallel implementation. In this paper, we pre...
Wouter Caarls, Pieter P. Jonker, Henk Corporaal