Sciweavers

268 search results - page 39 / 54
» Expressive Power of Grammatical Formalisms
Sort
View
IJFCS
2006
130views more  IJFCS 2006»
15 years 19 days ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
128
Voted
JCP
2008
142views more  JCP 2008»
15 years 19 days ago
QoS Aware Query Processing Algorithm for Wireless Sensor Networks
In sensor networks, continuous query is commonly used for collecting periodical data from the objects under monitoring. This sort of queries needs to be carefully designed, in orde...
Jun-Zhao Sun
93
Voted
TIC
1998
Springer
127views System Software» more  TIC 1998»
15 years 4 months ago
Stack-Based Typed Assembly Language
In previous work, we presented a Typed Assembly Language (TAL). TAL is sufficiently expressive to serve as a target language for compilers of high-level languages such as ML. More...
J. Gregory Morrisett, Karl Crary, Neal Glew, David...
107
Voted
ICFP
2010
ACM
15 years 1 months ago
The impact of higher-order state and control effects on local relational reasoning
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
Derek Dreyer, Georg Neis, Lars Birkedal
199
Voted
POPL
2006
ACM
16 years 29 days ago
Certified assembly programming with embedded code pointers
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
Zhaozhong Ni, Zhong Shao