1242 search results - page 192 / 249 » The Theory of Grammar Constraints |
282
click to vote
POPL
2005
ACM
16 years 6 months ago
2005
ACM
In traditional information-flow type systems, the security policy is often formalized as noninterference properties. However, noninterference alone is too strong to express securi...
268
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
151
click to vote
PODS
2003
ACM
16 years 6 months ago
2003
ACM
Normalization as a way of producing good database designs is a well-understood topic. However, the same problem of distinguishing well-designed databases from poorly designed ones...
160
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
d Abstract] Mikolaj Boja?nczyk Faculty of Mathematics, Informatics and Mechanics Warsaw University Poland Claire David LIAFA Universit?e Paris 7 France Anca Muscholl LIAFA Universi...
164
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
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...