1418 search results - page 223 / 284 » The Dynamic Complexity of Formal Languages |
147
click to vote
DBPL
1999
Springer
15 years 9 months ago
1999
Springer
Semistructured databases are treated as dynamically typed: they come equipped with no independent schema or type system to constrain the data. Query languages that are designed fo...
271
click to vote
POPL
2009
ACM
16 years 5 months ago
2009
ACM
Transactional memory (TM) is a promising paradigm for concurrent programming. Whereas the number of TM implementations is growing, however, little research has been conducted to p...
143
click to vote
SP
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper we explore the problem of creating vulnerability signatures. A vulnerability signature matches all exploits of a given vulnerability, even polymorphic or metamorphic...
148
click to vote
ESOP
2004
Springer
15 years 10 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
145
click to vote
ASE
2004
15 years 4 months ago
2004
er is concerned with an abstract exploration of code mobility constructs designed for use in settings where the level of granularity associated with the mobile units exhibits sign...