Sciweavers

467 search results - page 81 / 94
» Designer Definites in Logical Form
Sort
View
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 9 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
TLDI
2010
ACM
218views Formal Methods» more  TLDI 2010»
14 years 5 months ago
Pointwise generalized algebraic data types
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
Chuan-kai Lin, Tim Sheard
PERCOM
2009
ACM
14 years 3 months ago
Distributed Policy Resolution Through Negotiation in Ubiquitous Computing Environments
—Ensuring spontaneous ad hoc interoperation in decentralized ubiquitous computing environments is challenging, because of heterogeneous resources and divergent policies. Centrali...
Venkatraman Ramakrishna, Peter L. Reiher, Leonard ...
GPCE
2007
Springer
14 years 3 months ago
A type-centric framework for specifying heterogeneous, large-scale, component-oriented, architectures
Maintaining integrity, consistency, and enforcing conformance in architectures of large-scale systems requires specification and enforcement of many different forms of structural...
Georg Jung, John Hatcliff
PLDI
2004
ACM
14 years 2 months ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken