Sciweavers

1322 search results - page 24 / 265
» Unsound Theorem Proving
Sort
View
IPPS
1998
IEEE
13 years 11 months ago
Automatically Proving UNITY Safety Properties with Arrays and Quantifiers
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 ...
Xavier Thirioux
CCS
2006
ACM
13 years 11 months ago
Replayer: automatic protocol replay by binary analysis
We address the problem of replaying an application dialog between two hosts. The ability to accurately replay application dialogs is useful in many security-oriented applications,...
James Newsome, David Brumley, Jason Franklin, Dawn...
JCT
2010
98views more  JCT 2010»
13 years 2 months ago
Lifts of matroid representations over partial fields
There exist several theorems which state that when a matroid is representable over distinct fields 1,..., k, it is also representable over other fields. We prove a theorem, the Li...
Rudi Pendavingh, Stefan H. M. van Zwam
JCT
2010
79views more  JCT 2010»
13 years 2 months ago
Confinement of matroid representations to subsets of partial fields
Let M be a matroid representable over a (partial) field and B a matrix representable over a sub-partial field . We say that B confines M to if, whenever a -representation matrix ...
Rudi Pendavingh, Stefan H. M. van Zwam
JUCS
2010
110views more  JUCS 2010»
13 years 2 months ago
On Choice Principles and Fan Theorems
: Veldman proved that the contrapositive of countable binary choice is a theorem of full-fledged intuitionism, to which end he used a principle of continuous choice and the fan the...
Hannes Diener, Peter Schuster