181 search results - page 5 / 37 » On Quantification with A Finite Universe |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We investigate the relation between the theory of the iterations in the sense of Shelah-Stupp and of Muchnik, resp., and the theory of the base structure for several logics. These ...
CAV
2006
Springer
13 years 11 months ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
CAV
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we address the problem of shape analysis for concurrent programs. We present new algorithms, based on abstract interpretation, for automatically verifying properties ...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
In this work we consider the problem of universal prediction of individual sequences where the universal predictor is a deterministic finite state machine, with a fixed, relativel...
COLING
1994
13 years 9 months ago
1994
This paper presents a novel technique called "universal guides" which explores inherent properties of logic grammars (changing variable binding status) in order to chara...