344 search results - page 5 / 69 » Some Theorems We Should Prove |
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
Abstract. We address the general problem of automatically proving safety properties of reactive systems within the UNITY model. We take up a relational and set-based approach, and ...
TCC
2004
Springer
14 years 20 days ago
2004
Springer
Abstract. We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the well-known simulatability approach of modern cryptography...
APAL
2006
13 years 7 months ago
2006
Abstract. The main result is that for every recursively enumerable existential consistent theory (in the usual language of group theory), there exists a finitely presented SQ-univ...
EVOW
2008
Springer
13 years 9 months ago
2008
Springer
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed under permutation (c.u.p.) sets and we c...
CSL
2008
Springer
13 years 9 months ago
2008
Springer
We study the problem of proving in weak theories of Bounded Arithmetic the theorem that there are arbitrarily large prime numbers. We show that the theorem can be proved by some &...