815 search results - page 140 / 163 » Algebraic Recognizability of Languages |
100
click to vote
IFIP
2009
Springer
14 years 9 months ago
2009
Springer
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...
116
click to vote
DEXA
2011
Springer
13 years 11 months ago
2011
Springer
In this article we present RoSeS (Really Open Simple and Efficient Syndication), a generic framework for content-based RSS feed querying and aggregation. RoSeS is based on a data-...
POPL
2012
ACM
13 years 7 months ago
2012
ACM
Separation Logic has witnessed tremendous success in recent years in reasoning about programs that deal with heap storage. Its success owes to the fundamental principle that one s...
103
click to vote
WWW
2007
ACM
16 years 14 days ago
2007
ACM
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
ICFP
2005
ACM
15 years 11 months ago
2005
ACM
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...