450 search results - page 9 / 90 » Algorithmic uses of the Feferman-Vaught Theorem |
RSA
2002
13 years 7 months ago
2002
Given any measure-preserving dynamical system (Y, A , , T) and g Lp() , we study convergence of the sequence 1 n n k=1 g TSk , n 1 where Sk is a dynamic Zr -valued random w...
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar...
EUC
2005
Springer
14 years 1 months ago
2005
Springer
Algorithms that process geometric objects become more and more important for many safety-critical embedded systems, e.g. for motion planning or collision detection, where correctne...
TACAS
2004
Springer
14 years 24 days ago
2004
Springer
We present a method of deriving Craig interpolants from proofs in the quantifier-free theory of linear inequality and uninterpreted function symbols, and an interpolating theorem...
CADE
2008
Springer
14 years 7 months ago
2008
Springer
We describe a framework with which first order theorem provers can be used for checking formal proofs. The main aim of the framework is to take as much advantage as possible from t...