Sciweavers

4126 search results - page 458 / 826
» Relationships with other Formalisms
Sort
View
WWW
2005
ACM
16 years 7 months ago
Expressiveness of XSDs: from practice to theory, there and back again
On an abstract level, XML Schema increases the limited expressive power of Document Type Definitions (DTDs) by extending them with a recursive typing mechanism. However, an invest...
Geert Jan Bex, Wim Martens, Frank Neven, Thomas Sc...
SIGCSE
2009
ACM
194views Education» more  SIGCSE 2009»
16 years 7 months ago
Integrating pedagogical code reviews into a CS 1 course: an empirical study
Formal code inspections are employed by teams of professional software engineers to identify software defects and improve the quality of software. After reviewing a piece of code ...
Christopher D. Hundhausen, Anukrati Agrawal, Dana ...
POPL
2006
ACM
16 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
POPL
2004
ACM
16 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
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
16 years 4 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...