1101 search results - page 54 / 221 » Forcing in proof theory |
122
click to vote
POPL
2012
ACM
13 years 8 months ago
2012
ACM
Despite recent successes, large-scale proof development within proof assistants remains an arcane art that is extremely timeconsuming. We argue that this can be attributed to two ...
101
Voted
IAT
2008
IEEE
15 years 7 months ago
2008
IEEE
We develop strategy/false-name-proof multi-unit auction protocols for non-quasi-linear utilities. One almost universal assumption in auction theory literature is that each bidder ...
112
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
101
Voted
TACAS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Given a theory T and two formulas A and B jointly unsatisfiable in T , a theory interpolant of A and B is a formula I such that (i) its non-theory symbols are shared by ...
83
Voted
HICSS
2005
IEEE
15 years 6 months ago
2005
IEEE
This case study was commissioned by the Office of Force Transformation in the United States Department of Defense to examine the employment of Network Centric Warfare (NCW) system...