Sciweavers

3071 search results - page 412 / 615
» Explanatory Design Theory
Sort
View
PODS
2007
ACM
171views Database» more  PODS 2007»
16 years 6 months ago
The complexity of reasoning about pattern-based XML schemas
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
Gjergji Kasneci, Thomas Schwentick
ICSE
2008
IEEE-ACM
16 years 6 months ago
Creating a cognitive metric of programming task difficulty
Conducting controlled experiments about programming activities often requires the use of multiple tasks of similar difficulty. In previously reported work about a controlled exper...
Brian de Alwis, Gail C. Murphy, Shawn Minto
ICSE
2008
IEEE-ACM
16 years 6 months ago
Exploiting connector knowledge to efficiently disseminate highly voluminous data sets
Ever-growing amounts of data that must be distributed from data providers to consumers across the world necessitate a greater understanding of the software architectural implicati...
Chris Mattmann, David Woollard, Nenad Medvidovic
ICFP
2008
ACM
16 years 6 months ago
AURA: a programming language for authorization and audit
This paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic co...
Limin Jia, Jeffrey A. Vaughan, Karl Mazurak, Jianz...
ICFP
2008
ACM
16 years 6 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy