98 search results - page 20 / 20 » Combinations of Theories for Decidable Fragments of First-Or... |
AI
2008
Springer
13 years 5 months ago
2008
Springer
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
CORR
2009
Springer
13 years 3 months ago
2009
Springer
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
ICFP
2012
ACM
11 years 7 months ago
2012
ACM
In the static analysis of functional programs, pushdown flow analabstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method re...