13383 search results - page 229 / 2677 » Abstractions from proofs |
224
click to vote
CL
2000
Springer
15 years 11 months ago
2000
Springer
We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of appropriate refinement operations. The system has been ...
171
click to vote
CADE
1999
Springer
15 years 11 months ago
1999
Springer
CutRes is a system which takes as input an LK-proof with arbitrary cuts and skolemized end-sequent and gives as output an LKproof with atomic cuts only. The elimination of cuts is ...
165
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...
184
click to vote
LPAR
2010
Springer
15 years 5 months ago
2010
Springer
Induction proofs often fail because the stated theorem is noninductive, in which case the user must strengthen the theorem or prove auxiliary properties before performing the induc...
154
click to vote
ICSR
2009
Springer
15 years 4 months ago
2009
Springer
Anecdotal experience constructing proofs of correctness of code built from reusable software components reveals that they tend to be relatively trivial bookkeeping exercises: they ...