Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages under the theory of ...
We present a compositional semantics of synchronous systems that captures both safety and progress properties of such systems. The fair synchronous transitions systems (fsts) mode...
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
Emmanuel M. Tadjouddine, Frank Guerin, Wamberto We...
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...