Sciweavers

5499 search results - page 65 / 1100
» Generalized Rewrite Theories
Sort
View
POPL
2006
ACM
14 years 10 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
ICDT
2010
ACM
147views Database» more  ICDT 2010»
14 years 1 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
RULEML
2009
Springer
14 years 4 months ago
TomML: A Rule Language for Structured Data
Abstract. We present the Tom language that extends Java with the purpose of providing high level constructs inspired by the rewriting community. Tom bridges thus the gap between a ...
Horatiu Cirstea, Pierre-Etienne Moreau, Antoine Re...
TAPSOFT
1993
Springer
14 years 2 months ago
Optimal Reductions in Interaction Systems
Lamping's optimalgraph reduction technique for the -calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. Interaction Systems ...
Andrea Asperti, Cosimo Laneve
APBC
2004
154views Bioinformatics» more  APBC 2004»
13 years 11 months ago
Dispensation Order Generation for Pyrosequencing
This article describes a dispensation order generation algorithm for genotyping using the Pyrosequencing method. The input template of the algorithm is a slightly restricted regul...
Mats Carlsson, Nicolas Beldiceanu