797 search results - page 46 / 160 » Eliminating Proofs from Programs |
114
Voted
EUROCRYPT
2008
Springer
15 years 2 months ago
2008
Springer
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
98
Voted
ICALP
2001
Springer
15 years 5 months ago
2001
Springer
We work with an extension of Resolution, called Res(2), that allows clauses with conjunctions of two literals. In this system there are rules to introduce and eliminate such conju...
130
click to vote
TLDI
2005
ACM
15 years 6 months ago
2005
ACM
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
126
click to vote
DALT
2008
Springer
15 years 2 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...
102
Voted
KBSE
1999
IEEE
15 years 5 months ago
1999
IEEE
Deductive retrieval and deductive synthesis are two conceptually closely related software development methods which apply theorem proving techniques to support the construction of...