Sciweavers

166 search results - page 33 / 34
» A Parameterised Module System for Constructing Typed Logic P...
Sort
View
POPL
2004
ACM
14 years 7 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford
AOSD
2007
ACM
13 years 11 months ago
Orthogonal persistence and AOP: a balancing act
In order to increase the productivity of the application developers, it is desirable to remove the persistence concern from their responsibility. For this purpose, the orthogonal ...
Mohammed Al-Mansari, Stefan Hanenberg, Rainer Unla...
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
AGIS
2008
319views more  AGIS 2008»
13 years 7 months ago
An Efficient Algorithm for Raster-to-Vector Data Conversion
Data conversion from raster to vector (R2V) is a key function in Geographic Information Systems (GIS) and remote sensing (RS) image processing for integrating GIS and RS data. The...
Junhua Teng, Fahui Wang, Yu Liu
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 7 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard