124 search results - page 6 / 25 » The Undecidability of the Generalized Collatz Problem |
TPHOL
2003
IEEE
14 years 20 days ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
UAI
2001
13 years 8 months ago
2001
There is increasing interest within the research community in the design and use of recursive probability models. There remains concern about computational complexity costs and th...
HYBRID
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...
POPL
2010
ACM
14 years 4 months ago
2010
ACM
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
MFCS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. In this paper we discuss the computational power of Lipschitz dynamical systems which are robust to infinitesimal perturbations. Whereas the study in [1] was done only f...