Sciweavers

3653 search results - page 210 / 731
» On Recognizable Timed Languages
Sort
View
IPSN
2009
Springer
16 years 7 days ago
Archetype-based design: Sensor network programming for application experts, not just programming experts
Sensor network application experts such as biologists, geologists, and environmental engineers generally have little experience with, and little patience for, general-purpose and ...
Lan S. Bai, Robert P. Dick, Peter A. Dinda
CC
2007
Springer
143views System Software» more  CC 2007»
15 years 11 months ago
Accurate Garbage Collection in Uncooperative Environments with Lazy Pointer Stacks
Implementing a new programming language by the means of a translator to an existing language is attractive as it provides portability over all platforms supported by the host langu...
Jason Baker, Antonio Cunei, Filip Pizlo, Jan Vitek
PLDI
2003
ACM
15 years 10 months ago
Taming the IXP network processor
We compile Nova, a new language designed for writing network processing applications, using a back end based on integer-linear programming (ILP) for register allocation, optimal b...
Lal George, Matthias Blume
CONCUR
2010
Springer
15 years 6 months ago
Mean-Payoff Automaton Expressions
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
Krishnendu Chatterjee, Laurent Doyen, Herbert Edel...
PODS
2009
ACM
122views Database» more  PODS 2009»
16 years 6 months ago
Satisfiability of downward XPath with data equality tests
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...
Diego Figueira