110 search results - page 19 / 22 » Mean-Payoff Automaton Expressions |
ICDT
2007
ACM
14 years 2 months ago
2007
ACM
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
SIGADA
2007
Springer
14 years 2 months ago
2007
Springer
A system based on a hierarchical scheduler is a system in which the processor is shared between several collaborative schedulers. Such schedulers exist since 1960 and they are bec...
IPPS
2005
IEEE
14 years 2 months ago
2005
IEEE
— Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness ...
RE
2001
Springer
14 years 1 months ago
2001
Springer
A logic model checker can be an effective tool for debugging software applications. A stumbling block can be that model checking tools expect the user to supply a formal statement...
SIGGRAPH
2000
ACM
14 years 29 days ago
2000
ACM
This paper proposes a simple and computationally inexpensive method for animation of clouds. The cloud evolution is simulated using cellular automaton that simplifies the dynamics...