3228 search results - page 157 / 646 » Computationally Sound Proofs |
198
click to vote
DALT
2008
Springer
15 years 8 months ago
2008
Springer
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...
164
click to vote
JSYML
2010
15 years 5 months ago
2010
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
128
click to vote
TCS
1998
15 years 6 months ago
1998
In this paper we present an alternative order-theoretic proof of the Banach fixed point theorem for selfmaps on complete metric spaces which is based on formal balls and, contrary...
263
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
188
click to vote
COMPSAC
2009
IEEE
15 years 7 months ago
2009
IEEE
Modular certification of low-level intermediate representation (IR) programs is one of the key steps of proof-transforming compilation. The major challenges are lexity of abstract ...