1410 search results - page 123 / 282 » Proving theorems by reuse |
195
click to vote
ASE
2005
15 years 5 months ago
2005
Deductive program synthesis systems based on automated theorem proving offer the promise of software that is correct by construction. However, the difficulty encountered in constru...
211
click to vote
AML
2011
15 years 1 months ago
2011
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...
219
click to vote
LPAR
2012
Springer
14 years 1 months ago
2012
Springer
Abstract. The TPTP World is a well established infrastructure supporting research, development, and deployment of Automated Theorem Proving systems. Recently, the TPTP World has be...
166
click to vote
NDSS
2002
IEEE
15 years 11 months ago
2002
IEEE
TLS is the protocol of choice for securing today’s ecommerce and online transactions, but adding TLS to a web server imposes a significant overhead relative to an insecure web ...
277
Voted
POPL
2007
ACM
16 years 6 months ago
2007
ACM
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...