Sciweavers

46 search results - page 2 / 10
» Rethinking Java strings
Sort
View
ESOP
2006
Springer
13 years 9 months ago
Polymorphic Type Inference for the JNI
We present a multi-lingual type inference system for checking type safety of programs that use the Java Native Interface (JNI). The JNI uses specially-formatted strings to represe...
Michael Furr, Jeffrey S. Foster
SIGSOFT
2010
ACM
13 years 3 months ago
Locating need-to-translate constant strings in web applications
Software internationalization aims to make software accessible and usable by users all over the world. For a Java application that does not consider internationalization at the be...
Xiaoyin Wang, Lu Zhang, Tao Xie, Hong Mei, Jiasu S...
ICSE
2004
IEEE-ACM
14 years 5 months ago
Static Checking of Dynamically Generated Queries in Database Applications
Many data-intensive applications dynamically construct queries in response to client requests and execute them. Java servlets, e.g., can create string representations of SQL queri...
Carl Gould, Zhendong Su, Premkumar T. Devanbu
SP
2010
IEEE
222views Security Privacy» more  SP 2010»
13 years 9 months ago
A Symbolic Execution Framework for JavaScript
—As AJAX applications gain popularity, client-side JavaScript code is becoming increasingly complex. However, few automated vulnerability analysis tools for JavaScript exist. In ...
Prateek Saxena, Devdatta Akhawe, Steve Hanna, Feng...
CORR
2004
Springer
111views Education» more  CORR 2004»
13 years 5 months ago
Finding Approximate Palindromes in Strings Quickly and Simply
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...
L. Allison