3229 search results - page 489 / 646 » Theories with the Independence Property |
154
click to vote
CCS
2009
ACM
16 years 1 months ago
2009
ACM
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...
180
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
169
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
166
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
We consider a restricted variant of the hairpin completion called bounded hairpin completion. The hairpin completion is a formal operation inspired from biochemistry. Applied to a ...
172
click to vote
GLOBECOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— We propose and analyze a novel decentralized mechanism that motivates otherwise non-cooperative stations to participate as relays in cooperative ARQ protocol. Cooperation incen...